Bidirectional Dijkstra algorithm for best-routing of urban traffic network

Luyao Chen · Ji Ti Zhou · Jing Li · Yunhao Chen

4 citations0/0 files storedProceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Transportation Planning and Optimization Traffic control and management Vehicle Routing Optimization Methods

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 brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Imported from OpenAlex (CC0) — nothing here is generated.