An efficient shortest path computation system for real road networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4031 LNAI, Issue , 2006, Pages 711-720

  Wang, Zhenyu ^a   Che, Oscar ^b   Chen, Lijuan ^b   Lim, Andrew ^a,b  

^a SOUTH CHINA UNIVERSITY OF TECHNOLOGY   (China)

^b HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

Author keywords

Decision support; Hierarchical network structure; Shortest path computation; Systems for real life applications

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; COMPUTER SCIENCE; DECISION SUPPORT SYSTEMS; RESPONSE TIME (COMPUTER SYSTEMS); STORAGE ALLOCATION (COMPUTER);

BOUNDARY NODES; HIERARCHICAL NETWORK STRUCTURE; SHORTEST PATH COMPUTATION; SYSTEMS FOR REAL LIFE APPLICATIONS;

COMPUTER NETWORKS;

EID: 33746254813     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11779568_77     Document Type: Conference Paper

References (13)

1. Ashok K. Goel, Todd J. Callantine, Murali Shankar, and B. Chandrasekaran. Representation, organization, and use of topographic models of physical spaces for route planning In Proc. the 7th IEEE Conference on Artificial Intelligence Applications, pages 308-314. IEEE Computer Society Press, 1991. Miami Beach, Florida, February 1991.
2. Maylz B. Habbal, Haris N. Koutsopoulos, and Steven R. Lerman. A decomposition algorithm for the all-pairs shortest path problem on massively parallel computer architectures. Transportation Science, 28(4):292-308, 1994.
3. G. R. Jagadeesh, T. Srikanthan, and K. H. Quek. Heuristic techniques for accelerating hierarchical routing on road networks. IEEE Transactions on Intelligent Transportation Systems, 3(4):301-309, 2002.
4. Ning Jing, Yun-Wu Huang, and Elke A. Rundensteiner. 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.
5. Ning Jing, Yun-Wu Huang, and Elke A. Rundensteiner. Optimizing path query performance: Graph clustering strategies. Transportation Research Part C, 8(1-6):381-408, 2000.
6. Sungwon Jung and Sakti Pramanik. An efficient path computation model for hierarchically structured topographical road maps. IEEE Transactions on Knowledge and Data Engineering, 14(5): 1029-1046, 2002.
7. George Karypis and Vipin Kumar. 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.
8. George Karypis and Vipin Kumar. 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.
9. George Karypis and Vipin Kumar. 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.
10. Bing Liu. 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.
11. Shashi Shekhar, Andrew Fetterer, and Brajesh Goyal. Materialization trade-offs in hierarchical shortest path algorithms. In Proc. the 5th International Symposium on Advances in Spatial Databases, pages 94-111, 1997.
12. F. Benjamin Zhan. 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.
13. F. Benjamin Zhan and Charles E. Noon. Shortest path algorithms: An evaluation using real road networks. Transportation Science, 32(1):65-73, February 1998.