| Article ID: | iaor20102898 |
| Volume: | 36 |
| Issue: | 6 |
| Start Page Number: | 688 |
| End Page Number: | 691 |
| Publication Date: | Nov 2008 |
| Journal: | Operations Research Letters |
| Authors: | Dell'Amico M, Iori M, Pretolani D |
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.