Algorithms for minimum-cost paths in time-dependent networks with waiting policies

DOI10.1002/net.20013zbMath1103.90025OpenAlexW2169455356WikidataQ115150497 ScholiaQ115150497MaRDI QIDQ4812400

Brian C. Dean

Publication date: 20 August 2004

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20013

zbMATH Keywords

shortest pathstime-dependent networkswaitingtime-varying networks

Mathematics Subject Classification ID

Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Deterministic network models in operations research (90B10)

Related Items (8)

Distance oracles for time-dependent networks ⋮ Optimal routing for maximizing the travel time reliability ⋮ Time-Dependent Shortest Path Problems with Penalties and Limits on Waiting ⋮ A polynomial algorithm for minimizing travel time in consistent time‐dependent networks with waits ⋮ From theory to practice: maximizing revenues for on-line dial-a-ride ⋮ Determining time-dependent minimum cost paths under several objectives ⋮ Computation of the optimal value function in time-dependent networks ⋮ An axiomatic approach to time-dependent shortest path oracles

This page was built for publication: Algorithms for minimum-cost paths in time-dependent networks with waiting policies