A platform for research: civil engineering, architecture and urbanism
A platform for research: civil engineering, architecture and urbanism
The Shortest Path Algorithm Based on Hierarchical Road Network
The shortest path algorithm is one basic theoretic problem in ITS which has already been an indispensable function in different kinds of navigation systems, monitor and control systems, and other analysis aided decision systems. Firstly Dijkstra algorithm and heuristic algorithm will be analyzed in this paper. Secondly the shortest path algorithm based on hierarchical road network will be put forward. Finally a test will be implemented on the traffic map of Chengdu in China whose result will be satisfactory.
The Shortest Path Algorithm Based on Hierarchical Road Network
The shortest path algorithm is one basic theoretic problem in ITS which has already been an indispensable function in different kinds of navigation systems, monitor and control systems, and other analysis aided decision systems. Firstly Dijkstra algorithm and heuristic algorithm will be analyzed in this paper. Secondly the shortest path algorithm based on hierarchical road network will be put forward. Finally a test will be implemented on the traffic map of Chengdu in China whose result will be satisfactory.
The Shortest Path Algorithm Based on Hierarchical Road Network
Gangwu, Jiang (author) / Jing, Wang (author) / Bo, Chen (author)
2006-06-01
3448058 byte
Conference paper
Electronic Resource
English
A Shortest Path Algorithm Based on Hierarchical Graph Model
| British Library Conference Proceedings | 2003
| British Library Online Contents | 2013
Parallel All-Pairs Shortest Path Algorithm: Network-Decomposition Approach
| British Library Online Contents | 2016
Shortest routes through a road network
| TIBKAT | 1972