| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1143479 | Operations Research Letters | 2008 | 4 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
M. Dell'Amico, M. Iori, D. Pretolani,