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 traveled 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

Cited literature [15 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02022618
Contributor : Jérémy Omer <>
Submitted on : Monday, July 15, 2019 - 11:03:06 AM
Last modification on : Thursday, July 18, 2019 - 1:19:00 AM

File

Networks-Submission.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02022618, version 2

Citation

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

Share

Metrics

Record views

21

Files downloads

27