A Shortest Path Algorithm Based on Limited Search Heuristics

  • Feng Lu
  • Poh-Chin Lai
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3967)


Dijkstra’s algorithm is arguably the most popular computational solution to finding single source shortest paths. Increasing complexity of road networks, however, has posed serious performance challenge. While heuristic procedures based on geometric constructs of the networks would appear to improve performance, the fallacy of depreciated accuracy has been an obstacle to the wider application of heuristics in the search for shortest paths. The authors presented a shortest path algorithm that employs limited search heuristics guided by spatial arrangement of networks. The algorithm was tested for its efficiency and accuracy in finding one-to-one and one-to-all shortest paths among systematically sampled nodes on a selection of real-world networks of various complexity and connectivity. Our algorithm was shown to outperform other theoretically optimal solutions to the shortest path problem and with only little accuracy lost. More importantly, the confidence and accuracy levels were both controllable and predictable.


shortest path algorithm road network heuristic 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Deo, N., Pang, C.Y.: Shortest-path algorithms: taxonomy and annotation. Networks 4, 275–323 (1984)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Cherkassky, B.V., Goldberg, A.V., Radzik, T.: Shortest paths algorithms: theory and experimental evaluation. Mathematical Programming 73, 129–174 (1996)MathSciNetzbMATHGoogle Scholar
  3. 3.
    Pallottino, S., Scutellà, M.G.: Shortest path algorithms in transportation models: classical and innovative aspects. In: Marcotte, P., Nguyen, S. (eds.) Equilibrium and advanced transportation modeling, pp. 245–281. Kluwer, Norwell, MA (1998)CrossRefGoogle Scholar
  4. 4.
    Miller, H.J., Shaw, S.L.: Geographic Information Systems for Transportation: Principles and Applications. Oxford University Press, New York (2001)Google Scholar
  5. 5.
    Goldberg, A.V., Tarjan, R.E.: Expected performance of Dijkstra’s shortest path algorithm. Technical Report No. PRINCETONCS//TR-530-96, Princeton University (1996)Google Scholar
  6. 6.
    Zhan, F.B., Noon, C.E.: Shortest path algorithms: an evaluation using real road networks. Transportation Science 32, 65–73 (1998)CrossRefzbMATHGoogle Scholar
  7. 7.
    Zhao, Y.L.: Vehicle Location and Navigation Systems. Artech House Publishers, Boston (1997)zbMATHGoogle Scholar
  8. 8.
    Nilsson, N.J.: Artificial Intelligence: A New Synthesis. Morgan Kaufmann Publishers, San Francisco (1998)zbMATHGoogle Scholar
  9. 9.
    Fisher, P.F.: A primer of geographic search using artificial intelligence. Computers and Geosciences 16, 753–776 (1990)CrossRefGoogle Scholar
  10. 10.
    Holzer, M., Schulz, F., Willhalm, T.: Combining Speed-Up Techniques for Shortest-Path Computations. In: Ribeiro, C.C., Martins, S.L. (eds.) WEA 2004. LNCS, vol. 3059, pp. 269–284. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  11. 11.
    Nordbeck, S., Rystedt, B.: Computer cartography — range map. BIT 9, 157–166 (1969)CrossRefzbMATHGoogle Scholar
  12. 12.
    Lu, F., Guan, Y.: An optimum vehicular path solution with multi-heuristics. In: Bubak, M., van Albada, G.D., Sloot, P.M.A., Dongarra, J. (eds.) ICCS 2004. LNCS, vol. 3039, pp. 964–971. Springer, Heidelberg (2004)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Feng Lu
    • 1
  • Poh-Chin Lai
    • 2
  1. 1.State Key Laboratory of Resources and Environmental Information System, The Institute of Geographical Sciences and Natural Resources ResearchChinese Academy of SciencesBeijingP.R. China
  2. 2.Department of GeographyThe University of Hong KongHong Kong SARP.R. China

Personalised recommendations