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

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

0.00 Avg rating0 Votes
Article ID: iaor20072324
Country: United Kingdom
Volume: 33
Issue: 11
Start Page Number: 3324
End Page Number: 3343
Publication Date: Nov 2006
Journal: Computers and Operations Research
Authors: , ,
Keywords: networks: path, heuristics
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.

Reviews

Required fields are marked *. Your email address will not be published.