Probabilistic Analyses and Practical Algorithms for the Vehicle Routing Problem with Time Windows

From MaRDI portal
Revision as of 04:35, 7 March 2024 by Import240305080351 (talk | contribs) (Created automatically from import240305080351)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5689797

DOI10.1287/opre.44.3.501zbMath0864.90040OpenAlexW2069480138MaRDI QIDQ5689797

Julien Bramel, David Simchi-Levi

Publication date: 22 June 1997

Published in: Operations Research (Search for Journal in Brave)

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


zbMATH Keywords

vehicle routingtime windowsasymptotic optimal solutionfleet of vehicles of limited capacity


Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06)


Related Items (18)

Three-stage approaches for optimizing some variations of the resource constrained shortest-path sub-problem in a column generation context ⋮ A multi-start local search algorithm for the vehicle routing problem with time windows ⋮ REAL-LIFE VEHICLE ROUTING WITH TIME WINDOWS FOR VISUAL ATTRACTIVENESS AND OPERATIONAL ROBUSTNESS ⋮ On properties of geometric random problems in the plane ⋮ Routing problems: A bibliography ⋮ Travel time reliability in vehicle routing and scheduling with time windows ⋮ Analyses of advanced iterated tour partitioning heuristics for generalized vehicle routing problems ⋮ Probabilistic Analysis of a Vehicle Routing Problem with Time Windows ⋮ Shipping problems with body clock constraints. ⋮ Finding the first \(K\) shortest paths in a time-window network. ⋮ Recent progress of local search in handling the time window constraints of the vehicle routing problem ⋮ Recent progress of local search in handling the time window constraints of the vehicle routing problem ⋮ Active guided evolution strategies for large-scale vehicle routing problems with time windows ⋮ Finding \(K\) shortest looping paths with waiting time in a time--window network ⋮ A survey on matheuristics for routing problems ⋮ A route-neighborhood-based metaheuristic for vehicle routing problem with time windows ⋮ Minimization of travel time and weighted number of stops in a traffic-light network ⋮ A heuristic for cumulative vehicle routing using column generation




This page was built for publication: Probabilistic Analyses and Practical Algorithms for the Vehicle Routing Problem with Time Windows

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5689797&oldid=30410109"
Powered by MediaWiki