Heuristic shortest path algorithms for transportation applications: state of the art

  • Authors:

  • L. Fu;D. Sun;L. R. Rilett

  • Affiliations:

  • Department of Civil Engineering, University of Waterloo, Waterloo, ON, Canada;College of Automation, Chongqing University, Chongqing, China;Mid-America Transportation Center, University of Nebraska-Lincoln, Lincoln, NE

  • Venue:
  • Computers and Operations Research
  • Year:
  • 2006

Quantified Score

Hi-index 0.01

Visualization

Abstract

There are a number of transportation applications that require the use of a heuristic shortest path algorithm rather than one of the standard, optimal algorithms. This is primarily due to the requirements of some transportation applications where shortest paths need to be quickly identified either because an immediate response is required (e.g., in-vehicle route guidance systems) or because the shortest paths need to be recalculated repeatedly (e.g., vehicle routing and scheduling). For this reason a number of heuristic approaches have been advocated for decreasing the computation time of the shortest path algorithm. This paper presents a survey review of various heuristic shortest path algorithms that have been developed in the past. The goal is to identify the main features of different heuristic strategies, develop a unifying classification framework, and summarize relevant computational experience.