On the Effectiveness of Set Covering Formulations for the Vehicle Routing Problem with Time Windows
From MaRDI portal
Publication:4367254
DOI10.1287/OPRE.45.2.295zbMath0890.90054OpenAlexW1966891017MaRDI QIDQ4367254
Julien Bramel, David Simchi-Levi
Publication date: 25 November 1997
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.45.2.295
column generationvehicle routingbranch-and-boundset coveringtime windowslinear programming relaxation
Related Items (19)
Linear temporal logic vehicle routing with applications to multi-UAV mission planning ⋮ A column generation approach to the heterogeneous fleet vehicle routing problem ⋮ Optimization of gas metering maintenance services: A multiobjective vehicle routing problem with a set of predefined overlapping time windows ⋮ A modeling framework for incorporating DEA efficiency into set covering, packing, and partitioning formulations ⋮ Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs ⋮ Chance-constrained set covering with Wasserstein ambiguity ⋮ Divide-and-price: a decomposition algorithm for solving large railway crew scheduling problems ⋮ Pruning in column generation for service vehicle dispatching ⋮ A model to optimize placement operations on dual-head placement machines ⋮ A dual ascent procedure for the set partitioning problem ⋮ Models, relaxations and exact approaches for the capacitated vehicle routing problem ⋮ A LP-based heuristic for a time-constrained routing problem ⋮ A route-neighborhood-based metaheuristic for vehicle routing problem with time windows ⋮ Column-Generation in Integer Linear Programming ⋮ Flow-based integer linear programs to solve the weekly log-truck scheduling problem ⋮ A multi-depot pickup and delivery problem with a single hub and heterogeneous vehicles ⋮ Covering Problems ⋮ Survey of research in the design and control of automated guided vehicle systems ⋮ Combinatorial optimization: current successes and directions for the future
This page was built for publication: On the Effectiveness of Set Covering Formulations for the Vehicle Routing Problem with Time Windows
