Lifted and local reachability cuts for the vehicle routing problem with time windows

DOI10.1016/J.COR.2013.03.008MaRDI QIDQ336427zbMATH OpenOpenAlexFDO

Authors Pasquale Avella, Maurizio Boccia, Igor' Leonidovich Vasilyev

Publication date 10 November 2016

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2013.03.008

zbMATH Keywords

mixed integer programmingvehicle routing problem with time windowsbranch and cut

Mathematics Subject Classification ID

Applications of graph theory (05C90) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06)

Recommendations

• Reachability cuts for the vehicle routing problem with time windows
• 2-path cuts for the vehicle routing problem with time windows
• New enhancements for the exact solution of the vehicle routing problem with time windows
• Path inequalities for the vehicle routing problem with time windows
• A Branch-and-Cut Procedure 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 general heuristic for vehicle routing problems
• A polyhedral study of the asymmetric traveling salesman problem with time windows
• An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
• Chvàtal-Gomory rank-1 cuts used in a Dantzig-Wolfe decomposition of the vehicle routing problem with time windows
• Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems
• Lagrangian duality applied to the vehicle routing problem with time windows
• Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
• New dynamic programming algorithms for the resource constrained elementary shortest path problem
• New route relaxation and pricing strategies for the vehicle routing problem
• On the capacitated vehicle routing problem
• Optimizing over the first Chvátal closure
• Path inequalities for the vehicle routing problem with time windows
• Reachability cuts for the vehicle routing problem with time windows
• Shortest Path Problems with Resource Constraints
• Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
• The shortest-path problem with resource constraints and \(k\)-cycle elimination for \(k\geq 3\)
• Vehicle routing problem with elementary shortest path based column generation

Cited in

(10)

• Reachability cuts for the vehicle routing problem with time windows
• New enhancements for the exact solution of the vehicle routing problem with time windows
• Multi-commodity location-routing: flow intercepting formulation and branch-and-cut algorithm
• Path inequalities for the vehicle routing problem with time windows
• A branch-and-cut algorithm for the inventory routing problem with pickups and deliveries
• A framework for solving routing problems for small and medium size companies
• Strong cuts from compatibility relations for the dial-a-ride problem
• A branch and cut heuristic for a runway scheduling problem
• 2-path cuts 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

Describes a project that uses

Uses Software

• CVRPSEP

This page was built for publication: Lifted and local 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 Q336427)