Dijkstra-Based Dynamic Algorithm for Strongest Road Capacity
Teng Long, Bo Sun, Qingxia Yang, Guangtao Long · CICTP 2017 · 2018
Dijkstra algorithm solves classic shortest path problems. However, in practice, the existence of a number of restrictions requires the algorithm to be improved and optimized. In real traffic problems, an improved algorithm is proposed based on the analysis of classical Dijkstra algorithm. Based on actual traffic flow and congestion data, different congestion coefficients are given to different routes in traffic network, and an improved algorithm is utilized to obtain the optimal path of traffic capacity for a concrete example. This algorithm is implemented in C program language.