Reachability cuts for the vehicle routing problem with time windows

DOI10.1016/J.EJOR.2005.04.022MaRDI QIDQ2432846zbMATHOpenAlexFDO

Authors Jens Lysgaard

Publication date 25 October 2006

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2005.04.022

zbMATH Keywords

time windowsroutingprecedence constraints

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Traffic problems in operations research (90B20) Discrete location and assignment (90B80)

Recommendations

• Lifted and local reachability cuts for the vehicle routing problem with time windows
• 2-path cuts for the vehicle routing problem with time windows
• A Branch-and-Cut Procedure for the Vehicle Routing Problem with Time Windows
• Chvàtal-Gomory rank-1 cuts used in a Dantzig-Wolfe decomposition of the vehicle routing problem with time windows
• Path inequalities for the vehicle routing problem with time windows

Cites work

• 2-path cuts for the vehicle routing problem with time windows
• A Branch-and-Cut Procedure for the Vehicle Routing Problem with Time Windows
• A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
• A Polyhedral Approach to Simplified Crew Scheduling and Vehicle Scheduling Problems
• A new branch-and-cut algorithm for the capacitated vehicle routing problem
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• An exact algorithm for the maximum clique problem
• Computational investigations of maximum flow algorithms
• Network flows. Theory, algorithms, and applications.
• Projection results for vehicle routing
• Solving the asymmetric travelling salesman problem with time windows by branch-and-cut
• The precedence-constrained asymmetric traveling salesman polytope

Cited in

(16)

• New cutting-planes for the time- and/or precedence-constrained ATSP and directed VRP
• A 2-stage method for a field service routing problem with stochastic travel and service times
• Pricing routines for vehicle routing with time windows on road networks
• Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems
• Chvàtal-Gomory rank-1 cuts used in a Dantzig-Wolfe decomposition of the vehicle routing problem with time windows
• Recent models and algorithms for one-to-one pickup and delivery problems
• Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems
• 2-path cuts for the vehicle routing problem with time windows
• The dial-a-ride problem with private fleet and common carrier
• Multi-commodity location-routing: flow intercepting formulation and branch-and-cut algorithm
• A branch-and-cut algorithm for the inventory routing problem with pickups and deliveries
• The vehicle routing problem with release dates and flexible time windows
• A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks
• Strong cuts from compatibility relations for the dial-a-ride problem
• Lifted and local reachability cuts for the vehicle routing problem with time windows
• Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints

Describes a project that uses

Uses Software

• VRP
• CVRPSEP
• CVRPSP

This page was built for publication: Reachability cuts 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 Q2432846)