Shortest paths in piecewise continuous time-dependent networks |
| |
| Authors: | M Dell’Amico M Iori D Pretolani |
| |
| Institution: | DISMI, via Amendola, 2, 42100 Reggio Emilia, Italy |
| |
| 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. |
| |
| Keywords: | Shortest path Time-dependent travel times Algorithms |
| 本文献已被 ScienceDirect 等数据库收录！ |
