Shortest paths in piecewise continuous time-dependent networks

Authors:
M. Dell'Amico;M. Iori;D. Pretolani
Affiliations:
DISMI, via Amendola, 2, 42100 Reggio Emilia, Italy;DISMI, via Amendola, 2, 42100 Reggio Emilia, Italy;DISMI, via Amendola, 2, 42100 Reggio Emilia, Italy
Venue:
Operations Research Letters
Year:
2008

Citing 2
Cited 0

Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length

Journal of the ACM (JACM)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a shortest path problem, where the travel times on the arcs may vary with time and waiting at any node is allowed. Simple adaptations of the Dijkstra algorithm may fail to solve the problem, when discontinuities exist. We propose a new Dijkstra-like algorithm that overcomes these difficulties.