Shortest paths in piecewise continuous time-dependent networks

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. © 2008 Elsevier B.V. All rights reserved.

https://doi.org/10.1016/j.orl.2008.07.002

Cite as:

@article{Dell_Amico_2008,
	doi = {10.1016/j.orl.2008.07.002},
	url = {https://doi.org/10.1016%2Fj.orl.2008.07.002},
	year = 2008,
	month = {nov},
	publisher = {Elsevier {BV}},
	volume = {36},
	number = {6},
	pages = {688--691},
	author = {M. Dell'Amico and M. Iori and D. Pretolani},
	title = {Shortest paths in piecewise continuous time-dependent networks},
	journal = {Operations Research Letters}
}