An efficient shortest path computation system for real road networks

Authors:
Zhenyu Wang;Oscar Che;Lijuan Chen;Andrew Lim
Affiliations:
School of Computer Science and Engineering, South China Univ of Technology, Guangdong, China;Dept of IELM, HKUST, Kowloon, Hong Kong;Dept of IELM, HKUST, Kowloon, Hong Kong;School of Computer Science and Engineering, South China Univ of Technology, Guangdong, China
Venue:
IEA/AIE'06 Proceedings of the 19th international conference on Advances in Applied Artificial Intelligence: industrial, Engineering and Other Applications of Applied Intelligent Systems
Year:
2006

Citing 6
Cited 0

Hierarchical Encoded Path Views for Path Query Processing: An Optimal Model and Its Performance Evaluation

IEEE Transactions on Knowledge and Data Engineering
An Efficient Path Computation Model for Hierarchically Structured Topographical Road Maps

IEEE Transactions on Knowledge and Data Engineering
Materialization Trade-Offs in Hierarchical Shortest Path Algorithms

SSD '97 Proceedings of the 5th International Symposium on Advances in Spatial Databases
Shortest Path Algorithms: An Evaluation Using Real Road Networks

Transportation Science
Heuristic techniques for accelerating hierarchical routing on road networks

IEEE Transactions on Intelligent Transportation Systems
Route finding by using knowledge about the road network

IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans

Quantified Score

Hi-index	0.00

Visualization

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.