Issue |
MATEC Web Conf.
Volume 259, 2019
2018 6th International Conference on Traffic and Logistic Engineering (ICTLE 2018)
|
|
---|---|---|
Article Number | 01002 | |
Number of page(s) | 5 | |
Section | Transportation and Path Planning | |
DOI | https://doi.org/10.1051/matecconf/201925901002 | |
Published online | 25 January 2019 |
Dynamic on-line multimodal route planning with least expected travel time in the stochastic and time-dependent bus network
IMT Lille Douai, Univ. Lille, Unité de Recherche Informatique, et Automatique, F-59000 Lille, France
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.
© The Authors, published by EDP Sciences, 2019
This is an Open Access article distributed under the terms of the Creative Commons Attribution License 4.0, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.