Project centers in Chennai

IEEE Final Year Project Topic for IT

Base Paper Title

An Online Ride-Sharing Path-Planning Strategy for Public Vehicle Systems

Our Title

IEEE Project Abstract

As efficient traffic-management platforms, public vehicle (PV) systems are envisioned to be a promising approach to solving traffic congestion and pollution for future smart cities. PV systems provide online/dynamic peer-to-peer ride-sharing services with the goal of serving a sufficient number of customers with a minimum number of vehicles and the lowest possible cost. A key component of the PV system is the online ride-sharing scheduling strategy. In this paper, an efficient path-planning strategy based on a greedy algorithm is proposed, which focuses on a limited potential search area for each vehicle by filtering out the requests that violate the passenger service quality level, so that the global search is reduced to a local search. Moreover, the proposed heuristic can be easily used in the future globally optimal algorithm (if it will exist) to speed the computation time. The performance of the proposed solution, such as reduction ratio of computational complexity, is analyzed. Simulations based on the Manhattan taxi data set show that the computing time is reduced by 22% compared with the exhaustive search method under the same service quality performance.As efficient traffic-management platforms, public vehicle (PV) systems are envisioned to be a promising approach to solving traffic congestion and pollution for future smart cities. PV systems provide online/dynamic peer-to-peer ride-sharing services with the goal of serving a sufficient number of customers with a minimum number of vehicles and the lowest possible cost. A key component of the PV system is the online ride-sharing scheduling strategy. In this paper, an efficient path-planning strategy based on a greedy algorithm is proposed, which focuses on a limited potential search area for each vehicle by filtering out the requests that violate the passenger service quality level, so that the global search is reduced to a local search. Moreover, the proposed heuristic can be easily used in the future globally optimal algorithm (if it will exist) to speed the computation time. The performance of the proposed solution, such as reduction ratio of computational complexity, is analyzed. Simulations based on the Manhattan taxi data set show that the computing time is reduced by 22% compared with the exhaustive search method under the same service quality performance.

Existing System

Drawback of Existing System

Proposed System

Advantage of Proposed System

Enhancement from Base Paper

Architecture

Technology Used : Hardware & Software

Existing Algorithm

Proposed Algorithm

Advantages of Proposed Algorithm

Project Modules

Literature Survey

Conclusion

Future Work

To View the Abstract Contents

Exclusive
Offer
Refer Your Friend
10%
CASHBACK
Refer Another Friend
Thanks for Referring Your Friend / Relation

Now it is Your Time to Shine.

Great careers Start Here.

We Guide you to Every Step

Success! You're Awesome

Thank you for filling out your information!

We’ve sent you an email with your Final Year Project PPT file download link at the email address you provided. Please enjoy, and let us know if there’s anything else we can help you with.

To know more details Call 900 31 31 555

The WISEN Team