Eine Plattform für die Wissenschaft: Bauingenieurwesen, Architektur und Urbanistik
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 (Autor:in) / Jing, Wang (Autor:in) / Bo, Chen (Autor:in)
01.06.2006
3448058 byte
Aufsatz (Konferenz)
Elektronische Ressource
Englisch
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
|