Skip to main content
padlock icon - secure page this page is secure

Critical Review of Time-Dependent Shortest Path Algorithms: A Multimodal Trip Planner Perspective

Buy Article:

$55.00 + tax (Refund Policy)

A multimodal trip planner that produces optimal journeys involving both public transport and private vehicle legs has to solve a number of shortest path problems, both on the road network and the public transport network. The algorithms that are used to solve these shortest path problems have been researched since the late 1950s. However, in order to provide accurate journey plans that can be trusted by the user, the variability of travel times caused by traffic congestion must be taken into consideration. This requires the use of more sophisticated time-dependent shortest path algorithms, which have only been researched in depth over the last two decades, from the mid-1990s. This paper will review and compare nine algorithms that have been proposed in the literature, discussing the advantages and disadvantages of each algorithm on the basis of five important criteria that must be considered when choosing one or more of them to implement in a multimodal trip planner.
No Reference information available - sign in for access.
No Citation information available - sign in for access.
No Supplementary Data.
No Article Media
No Metrics

Keywords: dynamic; multimodal; planning; shortest path algorithms; time-dependent; trip

Document Type: Research Article

Affiliations: Faculty of Built Environment and Engineering, Queensland University of Technology, Smart Transport Research Centre, 2 George Street, GPO BOX 2434, Brisbane, 4001, Australia

Publication date: July 4, 2014

More about this publication?
  • Access Key
  • Free content
  • Partial Free content
  • New content
  • Open access content
  • Partial Open access content
  • Subscribed content
  • Partial Subscribed content
  • Free trial content
Cookie Policy
Cookie Policy
Ingenta Connect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more