Finding shortest paths on real road networks: the case for A*

The problem of identifying the shortest path along a road network is a fundamental problem in network analysis, ranging from route guidance in a navigation system to solving spatial allocation problems. Since this type of problem is solved so frequently, it is important to craft an approach that is as efficient as possible. Based upon past research, it is generally accepted that several efficient implementations of the Dijkstra algorithm are the fastest at optimally solving the ‘one‐to‐one’ shortest path problem (Cherkassky et al. 1996). We show that the most efficient state‐of‐the‐art implementations of Dijkstra can be improved by taking advantage of network properties associated with GIS‐sourced data. The results of this paper, derived from tests of different algorithmic approaches on real road networks, will be extremely valuable for application developers and researchers in the GIS community.

[1]  Andrew V. Goldberg,et al.  Shortest paths algorithms: Theory and experimental evaluation , 1994, SODA '94.

[2]  Stuart E. Dreyfus,et al.  An Appraisal of Some Shortest-Path Algorithms , 1969, Oper. Res..

[3]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[4]  Shashi Shekhar,et al.  Path Computation in Advanced Traveler Information Systems , 1996 .

[5]  Andrew V. Goldberg,et al.  Buckets, heaps, lists, and monotone priority queues , 1997, SODA '97.

[6]  Gerhard Ertl,et al.  Shortest path calculation in large road networks , 1998 .

[7]  F. Benjamin Zhan,et al.  A Comparison Between Label-Setting and Label-Correcting Algorithms for Computing One-to-One Shortest Paths ∗ , 2000 .

[8]  T. Lindvall.  ON A ROUTING PROBLEM , 2004, Probability in the Engineering and Informational Sciences.

[9]  Judea Pearl.  On the Discovery and Generation of Certain Heuristics , 1983, AI Mag..

[10]  L. R. Ford,et al.  NETWORK FLOW THEORY , 1956 .

[11]  Weixiong Zhang,et al.  State-Space Search , 1999, Springer New York.

[12]  F. Benjamin Zhan,et al.  Shortest Path Algorithms: An Evaluation Using Real Road Networks , 1998, Transp. Sci..

[13]  George J. Minty.  Letter to the Editor—A Variant on the Shortest-Route Problem , 1957 .

[14]  Laurence R. Rilett,et al.  Heuristic shortest path algorithms for transportation applications: State of the art , 2006, Comput. Oper. Res..

[15]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[16]  G. Gallo,et al.  SHORTEST PATH METHODS: A UNIFYING APPROACH , 1986 .

[17]  Fred W. Glover,et al.  A New Polynomially Bounded Shortest Path Algorithm , 1985, Oper. Res..

[18]  G. Dantzig.  Discrete-Variable Extremum Problems , 1957 .

[19]  Ronald J. Gutman,et al.  Reach-Based Routing: A New Approach to Shortest Path Algorithms Optimized for Road Networks , 2004, ALENEX/ANALC.

[20]  B. L. Golden,et al.  Shortest paths with euclidean distances: An explanatory model , 1978, Networks.

[21]  Stefano Pallottino,et al.  Shortest-path methods: Complexity, interrelations and new propositions , 1984, Networks.