Abstract
In this paper, we develop an efficient system to compute shortest paths in real road networks. An optimal shortest path algorithm is proposed based on a two-level hierarchical network structure. A pre-computation technique is used to improve the time efficiency. To further improve time efficiency and reduce memory requirement, we propose an algorithm to minimize the number of boundary nodes by relocating them between adjacent sub-networks. The performances of our approach with different network partition methods (with or without minimization of the number of boundary nodes) are compared in terms of both time efficiency and memory requirement. The experimental results on the real road network of Hong Kong demonstrated the efficiency of our method and the usefulness of minimizing of the number of boundary nodes.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Goel, A.K., Callantine, T.J., Shankar, M., Chandrasekaran, B.: Representation, organization, and use of topographic models of physical spaces for route planning. In: Proc. the 7th IEEE Conference on Artificial Intelligence Applications, Miami Beach, Florida, pp. 308–314. IEEE Computer Society Press, Los Alamitos (1991)
Habbal, M.B., Koutsopoulos, H.N., Lerman, S.R.: A decomposition algorithm for the all-pairs shortest path problem on massively parallel computer architectures. Transportation Science 28(4), 292–308 (1994)
Jagadeesh, G.R., Srikanthan, T., Quek, K.H.: Heuristic techniques for accelerating hierarchical routing on road networks. IEEE Transactions on Intelligent Transportation Systems 3(4), 301–309 (2002)
Jing, N., Huang, Y.-W., Rundensteiner, E.A.: Hierarchical encoded path views for path query processing: An optimal model and its performance evaluation. IEEE Transactions on Knowledge and Data Engineering 10(3), 409–432 (1998)
Jing, N., Huang, Y.-W., Rundensteiner, E.A.: Optimizing path query performance: Graph clustering strategies. Transportation Research Part C 8(1-6), 381–408 (2000)
Jung, S., Pramanik, S.: An efficient path computation model for hierarchically structured topographical road maps. IEEE Transactions on Knowledge and Data Engineering 14(5), 1029–1046 (2002)
Karypis, G., Kumar, V.: A fast and high quality multilevel scheme for partitioning irregular graphs. University of Minnesota, Department of Computer Science/ Army HPC Research Center, Minneapolis, MN 55455 Technical Report No. 95-035 (1998)
Karypis, G., Kumar, V.: Multilevel algorithm for multi- constraint graph partitioning. University of Minnesota, Department of Computer Science/ Army HPC Research Center, Minneapolis, MN 55455 Technical Report No. 98-019 (1998)
Karypis, G., Kumar, V.: Multilevel k-way partitioning scheme for irregular graphs. University of Minnesota, Department of Computer Science/ Army HPC Research Center, Minneapolis, MN 55455 Technical Report No. 95-064 (1998)
Liu, B.: Route finding by using knowledge about the road network. IEEE Transactions On Systems, Man, and Cybernetics-Part A: Systems and Humans 27(4), 436–448 (1997)
Shekhar, S., Fetterer, A., Goyal, B.: Materialization trade-offs in hierarchical shortest path algorithms. In: Proc. the 5th International Symposium on Advances in Spatial Databases, pp. 94–111 (1997)
Zhan, F.B.: Three fastest shortest path algorithms on real road networks: Data structures and procedures. Journal of Geographic Information and Decision Analysis 1(1), 69–82 (1997)
Zhan, F.B., Noon, C.E.: Shortest path algorithms: An evaluation using real road networks. Transportation Science 32(1), 65–73 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, Z., Che, O., Chen, L., Lim, A. (2006). An Efficient Shortest Path Computation System for Real Road Networks. In: Ali, M., Dapoigny, R. (eds) Advances in Applied Artificial Intelligence. IEA/AIE 2006. Lecture Notes in Computer Science(), vol 4031. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11779568_77
Download citation
DOI: https://doi.org/10.1007/11779568_77
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35453-6
Online ISBN: 978-3-540-35454-3
eBook Packages: Computer ScienceComputer Science (R0)