Share Email Print
cover

Proceedings Paper

Bidirectional Dijkstra algorithm for best-routing of urban traffic network
Author(s): Luyao Chen; Ji Zhou; Jing Li; Yunhao Chen
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

Best-routing is one of the effective ways to solve the problem of traffic jam in a technical way. Based on the classic Dijkstra Algorithm, the bidirectional search algorithm is adopted to improve algorithmic efficiency in this paper. And section resistance is also adopted in best-routing model in order to indicate not only the condition of road itself, but also the information like traffic flow, which can make the road information more general and efficient. And cross linked list is adopted to reflect topological information of road net, which ensures the weight keep minimum. The feasibility and efficiency are verified by a study case of local area in Beijing.

Paper Details

Date Published: 7 August 2007
PDF: 8 pages
Proc. SPIE 6754, Geoinformatics 2007: Geospatial Information Technology and Applications, 675418 (7 August 2007); doi: 10.1117/12.764679
Show Author Affiliations
Luyao Chen, Beijing Normal Univ. (China)
Ji Zhou, Beijing Normal Univ. (China)
Jing Li, Beijing Normal Univ. (China)
Yunhao Chen, Beijing Normal Univ. (China)


Published in SPIE Proceedings Vol. 6754:
Geoinformatics 2007: Geospatial Information Technology and Applications

© SPIE. Terms of Use
Back to Top