Network-tree model and shortest path algorithm

Authors:
Guozhen Tan;Xiaojun Han;Wen Gao
Affiliations:
Department of Computer Science and Engineering, Dalian University of Technology, China;Department of Computer Science and Engineering, Dalian University of Technology, China;Institute of Computing Technology, Chinese Academy of Sciences, China
Venue:
ICCS'03 Proceedings of the 2003 international conference on Computational science: PartIII
Year:
2003

Citing 4
Cited 1

Shortest paths algorithms: theory and experimental evaluation

Mathematical Programming: Series A and B
Hierarchical Encoded Path Views for Path Query Processing: An Optimal Model and Its Performance Evaluation

IEEE Transactions on Knowledge and Data Engineering
Approximating Shortest Paths in Large-Scale Networks with An Application to Intelligent Transportation Systems

INFORMS Journal on Computing
A performance analysis of hierarchical shortest path algorithms

ICTAI '97 Proceedings of the 9th International Conference on Tools with Artificial Intelligence

A parallel algorithm for computing shortest paths in large-scale networks

ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part III

Quantified Score

Hi-index	0.00

Visualization

Abstract

For the first time, this paper proposes the Network-Tree Model (NTM), route optimization theory and wholly new, high performance algorithm for shortest path calculation in large-scale network. We first decompose the network into a set of sub-networks by adopting the idea of multi-hierarchy partition and anomalistic regional partition, and then construct the NTM and the Expanded NTM. The Network-Tree Shortest Path (NTSP) algorithm presented in this paper narrows the searching space of the route optimization within a few sub-networks, so it greatly reduces the requirements for main memory and improves the computational efficiency compared to traditional algorithms. Experiment results based on grid network show that NTSP algorithm achieves much higher computational performance than Dijkstra algorithm and other hierarchical shortest path algorithms.