On the Effectiveness of Set Covering Formulations for the Vehicle Routing Problem with Time Windows

DOI10.1287/OPRE.45.2.295MaRDI QIDQ4367254zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

time windowscolumn generationvehicle routingset coveringbranch-and-boundlinear programming relaxation

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06)

Recommendations

• Vehicle Routing Problem with Time Windows
• A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
• Vehicle Routing with Time Windows
• Formulations and exact algorithms for the vehicle routing problem with time windows
• A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows

Cited in

(20)

• Models, relaxations and exact approaches for the capacitated vehicle routing problem
• Survey of research in the design and control of automated guided vehicle systems
• 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
• Pruning in column generation for service vehicle dispatching
• Covering Problems
• Chance-constrained set covering with Wasserstein ambiguity
• Flow-based integer linear programs to solve the weekly log-truck scheduling problem
• A LP-based heuristic for a time-constrained routing problem
• A dual ascent procedure for the set partitioning problem
• Linear temporal logic vehicle routing with applications to multi-UAV mission planning
• A route-neighborhood-based metaheuristic for vehicle routing problem with time windows
• Set covering in fuel-considered vehicle routing problems
• A model to optimize placement operations on dual-head placement machines
• Column-Generation in Integer Linear Programming
• A column generation approach to the heterogeneous fleet vehicle routing problem
• Combinatorial optimization: current successes and directions for the future
• Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs
• A multi-depot pickup and delivery problem with a single hub and heterogeneous vehicles
• Divide-and-price: a decomposition algorithm for solving large railway crew scheduling problems

This page was built for publication: On the Effectiveness of Set Covering Formulations for the Vehicle Routing Problem with Time Windows

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4367254)