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.
Dijkstra-Based Dynamic Algorithm for Strongest Road Capacity
17th COTA International Conference of Transportation Professionals ; 2017 ; Shanghai, China
CICTP 2017 ; 2725-2730
2018-01-18
Conference paper
Electronic Resource
English
Dıjkstra Algorıthm Usıng Uav Path Plannıng ; Dıjkstra Algoritması Kullanılarak İha Yol Planlaması
BASE | 2020
|Shortest Travel Path Searching System Based on Dijkstra Algorithm
Tema Archive | 2012
|Research on Railway Transportation Route Based on Dijkstra Algorithm
Springer Verlag | 2022
|EV load prediction method based on dynamic weighting Dijkstra
European Patent Office | 2023
|