A re-optimization dynamic shortest path algorithm for vehicle navigation

Abstract

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.

Cite this work

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

Stored only when both papers are in the corpus — 3 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.