Dynamic on-line multimodal route planning with least expected travel time in the stochastic and time-dependent bus network

  • Li J
  • Doniec A
  • Boonaert J
  • et al.
N/ACitations
Citations of this article
5Readers
Mendeley users who have this article in their library.

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.

Cite

CITATION STYLE

APA

Li, J., Doniec, A., Boonaert, J., & Lozenguez, G. (2019). Dynamic on-line multimodal route planning with least expected travel time in the stochastic and time-dependent bus network. MATEC Web of Conferences, 259, 01002. https://doi.org/10.1051/matecconf/201925901002

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free