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. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Wang, Z., Che, O., Chen, L., & Lim, A. (2006). An efficient shortest path computation system for real road networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4031 LNAI, pp. 711–720). Springer Verlag. https://doi.org/10.1007/11779568_77
Mendeley helps you to discover research relevant for your work.