The traffic congestion changes over time in the real transportation network, and the vehicle navigation is a real-time processing. Both the accuracy and time performance of navigation algorithm are important. To respond rapidly to transportation network changes, this paper proposes two new dynamic shortest path algorithms based on the re-optimization method. The algorithms take full advantage of the previous search results, thus they take relatively few computing time to obtain the optimal solution. Experimental results demonstrate that the proposed algorithms can be applied to vehicle navigation in the transportation network with dynamic variation of the travel times on arcs and runs much faster than the traditional Dijkstra algorithm.
A re-optimization dynamic shortest path algorithm for vehicle navigation
01.07.2014
577991 byte
Aufsatz (Konferenz)
Elektronische Ressource
Englisch
Optimizing Drone Navigation Using Shortest Path Algorithms
Springer Verlag | 2024
|Shortest Path Optimization Algorithm in Intelligent Transportation System
Trans Tech Publications | 2013
|Dynamic Shortest-Path Algorithm for Continuous Arc Travel Times
Transportation Research Record | 2008
|