Abstract
Route planning system in bus network is very important on providing passengers a better experience for public transportation services. This work presents a new on-line dynamic path planning algorithm in a stochastic and time-dependent bus network, with the objective of least expected travel time. Firstly, an initial optimal path is found when a passenger leaves from the starting location at time t for the destination location. Secondly, when the passenger reaches a bus stop, the real time traffic condition is checked to decide whether the optimal path should be modified and re-calculated. If so, the shortest path algorithm is re-applied to find the new path. The simulation scenario is executed to show the performance and efficiency of the proposed dynamic path planning system.
Highlights
Intelligent urban transportation services is one of the most important applications in smart cities and becomes more and more important for commuters
The traditional route planners generally rely on fixed schedules, which is too ideal to be held in the realistic transportation network, because bus real arrival times at each stop mostly depend on actual traffic circumstances, which are extremely time-dependent and stochastic
Comparing with the static transportation network researched by traditional route planners, the travel time on each arc is random during the trip in the Stochastic and TimeDependent (STD) network
Summary
Intelligent urban transportation services is one of the most important applications in smart cities and becomes more and more important for commuters. Authors in [1,2] focus on the problem of searching the optimal path with the least expected travel time between two nodes in the STD network. The proposed work, named dynamic on-line route planning system, advances all the above proposals by taking into account waiting time, travel time and on-line traffic information in public transportation networks. The main contributions of this paper are as follows: (i) introducing a dynamic on-line route planning structure in the STD network considering waiting time and travel time. The paper is organized as follows: the first section surveys the background and literatures of the path planning in the STD network with the objective of least expected travel time. The last section concludes the current work and proposes some future works
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
