A polynomial algorithm for minimizing travel time in time-dependent networks with waits - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2019

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

Résumé

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.
Fichier principal
Vignette du fichier
Networks-Submission.pdf (303.4 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02022618 , version 1 (18-02-2019)
hal-02022618 , version 2 (15-07-2019)
hal-02022618 , version 3 (18-01-2021)

Identifiants

  • HAL Id : hal-02022618 , version 2

Citer

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

Partager

Gmail Facebook X LinkedIn More