Geo-spatial Information Science

, Volume 3, Issue 4, pp 36–42 | Cite as

An optimum vehicular path algorithm for traffic network based on hierarchical spatial reasoning



Human beings’ intellection is the characteristic of a distinct hierarchy and can be taken to construct a heuristic in the shortest path algorithms. It is detailed in this paper how to utilize the hierarchical reasoning on the basis of greedy and directional strategy to establish a spatial heuristic, so as to improve running efficiency and suitability of shortest path algorithm for traffic network. The authors divide urban traffic network into three hierarchies and set forward a new node hierarchy division rule to avoid the unreliable solution of shortest path. It is argued that the shortest path, no matter distance shortest or time shortest, is usually not the favorite of drivers in practice. Some factors difficult to expect or quantify influence the drivers’ choice greatly. It makes the drivers prefer choosing a less shortest, but more reliable or flexible path to travel on. The presented optimum path algorithm, in addition to the improvement of the running efficiency of shortest path algorithms up to several times, reduces the emergence of those factors, conforms to the intellection characteristic of human beings, and is more easily accepted by drivers. Moreover, it does not require the completeness of networks in the lowest hierachy and the applicability and fault tolerance of the algorithm have improved. The experiment result shows the advantages of the presented algorithm. The authors argued that the algorithm has great potential application for navigation systems of large-scale traffic networks.

Key Words

optimum path algorithm traffic network hierarchical spatial reasoning 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Fisher P F. A Primer of Geographic Search Using Artificial Intelligence.Computers & Geosciences, 1990, 16 (6): 753–776CrossRefGoogle Scholar
  2. 2.
    Shirai Y, Tsujii J.Artificial Intelligence: Concepts, Techniques and Applications. New York: John Wiley & Sons, 1984Google Scholar
  3. 3.
    Winston P H.Artificial Intelligence. Reading: Addison-Wesley, 1984Google Scholar
  4. 4.
    Johnson D B. A Note on Dijkstra’s Shortest Path Algorithm.Journal of the Association for Computing Machinery, 1993(20): 385–388Google Scholar
  5. 5.
    Denardo E V, Fox B L. Shortest Route Methods: 1. Reaching, Pruning and Buckets.Operations Research, 1979(27): 161–186Google Scholar
  6. 6.
    Pallotlino S. Shortest Path Methods: Complexity, Interrelation and New Propositions.Networks, 1984, 14: 257–267CrossRefGoogle Scholar
  7. 7.
    Fredman M L, Tarjan R E. Fibonacci Heaps and Their Uses in Improved Network Optimization Algorithms.Journal of the Association for Computing Machinery, 1987, 34(3): 596–615Google Scholar
  8. 8.
    Ahuja R K, Mehlhorn K. Faster Algorithms for the Shortest Path Problem.Journal of the Association for Computing Machinery, 1990, 37(2): 213–223Google Scholar
  9. 9.
    Bertsekas D P. A Simple and Fast Label Correcting Algorithm for Shortest Paths.Networks, 1993, 23: 703–709CrossRefGoogle Scholar
  10. 10.
    Zhan F B, Han Y. Fastest Algorithms for Computing One-to-one Shortest Paths. In: Li D R, Gong J Y, Chen X L, eds.Spatial Information Science, Technology and Its Applications-RS, GPS, GIS Their Integration and Applications. Wuhan: Press of Wuhan Technical University of Surveying and Mapping, 1998. 489–496 (in Chinese)Google Scholar
  11. 11.
    Yue Y, Gong J Y. An Efficient Implementation of Shortest Path Algorithm Based on Dijkstra Algorithm.Journal of Wuhan Technical University of Surveying and Mapping, 1999, 24(3) (in Chinese)Google Scholar
  12. 12.
    Weng M F, Pan J. Design and Implementation of Object Oriented Autonomous Vehicle Route Planning.Computer Research and Development, 1991, 33(7): 533–540 (in Chinese)Google Scholar
  13. 13.
    Wang S T. Research on Bidirectional Heuristic Graph Search Algorithm BRA *.Journal of Computer, 1991, 9: 671–677, (in Chinese)Google Scholar
  14. 14.
    Rune. TheA * Algorithm: Comparison to Other Common Path-finders.URL: Google Scholar
  15. 15.
    Deo N, Pang C Y. Shortest-path Algorithms: Taxonomy and Annotation.Networks, 1984, 14: 275–323CrossRefGoogle Scholar
  16. 16.
    Cherkassky B V, Goldberg A V. Shortest Paths Algorithms: Theory and Experimental Evaluation.Mathematical Programming, 1996, 73: 129–174Google Scholar
  17. 17.
    Pallotlino S, Scutella M G. Shortest Path Algorithms in Transportation Models: Classical and Innovative Aspects. Technical Report. Universita di Pisa, 1997Google Scholar
  18. 18.
    Zhan F B. Three Faster Shortest Path Algorithms on Real Road Networks: Data Structures and Procedures.Journal of Geographic Information and Decision Analysis, 1997, 1(1): 69–82Google Scholar
  19. 19.
    Zhan F B, Noon C E. Shortest Path Algorithms: an Evaluation Using Real Road Networks.Transportation Science, 1998, 32: 65–73CrossRefGoogle Scholar
  20. 20.
    Pan J G, Gu T C, Zheng J,et al. Common Data Structures and Algorithms for Modern Computer. Nanjing: Press of Nanjing University, 1994 ((in Chinese)Google Scholar
  21. 21.
    ESRI. Pathfinding Algorithm Overview. ARC/INFO online manual, 1997Google Scholar
  22. 22.
    Lu F, Lu D M, Cui W H. Improved Dijkstra’s Algorithm Based on Quad-heap Priority Queue and Inverse Adjacent Lists.Journal of Image and Graphics, 1999, 4A (12): 1039–1045 (in Chinese)Google Scholar
  23. 23.
    Lu F, Lu D M, Cui W H. Time Shortest Path Algorithm for Restricted Searching Area in Transportation Networks.Journal of Image and Graphics, 1999, 4A(10): 849–853 (in Chinese)Google Scholar
  24. 24.
    Hirtle S C, Jonides J. Evidence of Hierarchies in Cognitive Maps.Memory & Cognition, 1995, 13(3): 208–217Google Scholar
  25. 25.
    Kuipers B, Levitt T S. Navigation and Mapping in Large-scale Space.AI Magazine, 1988, 9(2): 25–43Google Scholar
  26. 26.
    Car A, Frank A. General Principles of Hierarchical Spatial Reasoning-the Case of Wayfinding. In:Proceedings of the 6th International Symposium on Spatial Data Handling. Scotland: Edinburgh, 1994, 646–664Google Scholar

Copyright information

© Wuhan University of Technology 2000

Authors and Affiliations

  1. 1.State key Laboratory of Resources and Environmental Information systemsThe Chinese Academy of SciencesBeijingChina

Personalised recommendations