The Shortest-Path Problem : Analysis and Comparison of Methods

Many applications in different domains need to calculate the shortest-path between two points in a graph.

In this paper we describe this shortest path problem in detail, starting with the classic Dijkstra's algorithm and moving to more advanced solutions that are currently applied to road network routing, including the use of heuristics and precomputation techniques.

Since several of these improvements involve subtle changes to the search space, it may be difficult to appreciate their benefits in terms of time or space requirements.

To make methods more comprehensive and to facilitate their comparison, this book presents a single case study that serves as a common benchmark.

The paper also compares the search spaces explored by the methods described, both from a quantitative and qualitative point of view, and including an analysis of the number of reached and settled nodes by different methods for a particular topology.