Translator Disclaimer
Paper
7 August 2007 Bidirectional Dijkstra algorithm for best-routing of urban traffic network
Author Affiliations +
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.
© (2007) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Luyao Chen, Ji Zhou, Jing Li, and Yunhao Chen "Bidirectional Dijkstra algorithm for best-routing of urban traffic network", Proc. SPIE 6754, Geoinformatics 2007: Geospatial Information Technology and Applications, 675418 (7 August 2007); https://doi.org/10.1117/12.764679
PROCEEDINGS
8 PAGES


SHARE
Advertisement
Advertisement
Back to Top