A polynomial algorithm for minimizing travel time in time-dependent networks with waits

Abstract : We consider a time-dependent shortest path problem with possible waiting at each node and a global bound W on the total waiting time. The goal is to minimize only the time travelled along the edges of the path, not including the waiting time. We prove that the problem can be solved in polynomial time when the travel time functions are piecewise linear and continuous. The algorithm relies on a recurrence relation characterized by a bound ω for the total waiting time, where 0 ≤ ω ≤ W. We show that only a small numbers of values ω 1 , ω 2 ,. .. , ω K need to be considered, which depends on the total number of breakpoints of all travel time functions.
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-02022618
Contributor : Jérémy Omer <>
Submitted on : Monday, February 18, 2019 - 10:04:24 AM
Last modification on : Wednesday, July 17, 2019 - 1:32:51 AM
Long-term archiving on : Sunday, May 19, 2019 - 2:08:12 PM

File

PublicationHAL.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02022618, version 1

Collections

Citation

Jérémy Omer, Michael Poss. A polynomial algorithm for minimizing travel time in time-dependent networks with waits. 2019. ⟨hal-02022618v1⟩

Share

Metrics

Record views

87

Files downloads

61