The Shortest Path Problem with Time Windows and Linear Waiting Costs

DOI10.1287/trsc.34.3.312.12298zbMath0991.90560OpenAlexW2172237755MaRDI QIDQ2783892

Daniel Villeneuve, Guy Desaulniers

Publication date: 2 September 2002

Published in: Transportation Science (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/4b8622fa3e0695836260d8683fdd08799c63044c

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (7)

Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints ⋮ Resource extension functions: properties, inversion, and generalization to segments ⋮ An asymmetric TSP with time windows and with time-dependent travel times and costs: an exact solution through a graph transformation ⋮ Nodal aggregation of resource constraints in a shortest path problem ⋮ An assignment-based heuristic for vehicle routing with time windows ⋮ Multi-depot vehicle scheduling problems with time windows and waiting costs ⋮ Fast local search algorithms for the handicapped persons transportation problem

This page was built for publication: The Shortest Path Problem with Time Windows and Linear Waiting Costs