Shortest path algorithm based on distance comparison
Xiucheng Yang, Danfeng Liu, Cong Lin, Ligang Liang
Abstract
Xiucheng Yang, Danfeng Liu, Cong Lin, Ligang Liang
Abstract
The paper presents a newly shortest path algorithm aiming at the point-to-point problems in traffic network. The algorithm makes use of the axiom that distance is less than path based on the characteristics of transportation network. The test compared with the typical Dijkstra shows the validity and efficiency of the proposed algorithm.
OpenAlex reports 7 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The paper presents a newly shortest path algorithm aiming at the point-to-point problems in traffic network. The algorithm makes use of the axiom that distance is less than path based on the characteristics of transportation network. The test compared with the typical Dijkstra shows the validity and efficiency of the proposed algorithm.
Key concepts: Dijkstra's algorithm, Shortest path problem, Suurballe's algorithm, Yen's algorithm, Pathfinding, K shortest path routing, Shortest Path Faster Algorithm, Computer science