Limited memory rank-1 cuts for vehicle routing problems

DOI10.1016/j.orl.2017.02.006zbMath1409.90231OpenAlexW2590357187MaRDI QIDQ1728212

Marcus Poggi, Artur Alves Pessoa, Diego Pecin, Eduardo Uchoa, Haroldo Gambini Santos

Publication date: 22 February 2019

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

Full work available at URL: https://doi.org/10.1016/j.orl.2017.02.006

zbMATH Keywords

polyhedral combinatoricsset partitioningbranch-cut-and-price algorithms

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)

Related Items (14)

Enhanced branch-cut-and-price algorithm for heterogeneous fleet vehicle routing problems ⋮ The joint network vehicle routing game with optional customers ⋮ A POPMUSIC matheuristic for the capacitated vehicle routing problem ⋮ On the complete set packing and set partitioning polytopes: properties and rank 1 facets ⋮ On the exact solution of vehicle routing problems with backhauls ⋮ Estimating the marginal cost to deliver to individual customers ⋮ A generic exact solver for vehicle routing and related problems ⋮ New Enhancements for the Exact Solution of the Vehicle Routing Problem with Time Windows ⋮ A branch-cut-and-price algorithm for the cumulative capacitated vehicle routing problem ⋮ Solving vehicle routing problems with intermediate stops using VRPSolver models ⋮ Solving bin packing problems using VRPSolver models ⋮ Branch-Cut-and-Price for the Robust Capacitated Vehicle Routing Problem with Knapsack Uncertainty ⋮ An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem ⋮ A unified exact approach for clustered and generalized vehicle routing problems

Uses Software

• PORTA

Cites Work

• Optimizing over the first Chvátal closure
• A problem-reduction evolutionary algorithm for solving the capacitated vehicle routing problem
• On the separation of maximally violated mod-\(k\) cuts
• A cooperative parallel metaheuristic for the capacitated vehicle routing problem
• A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints
• Robust branch-and-cut-and-price for the capacitated vehicle routing problem
• Lagrangian duality applied to the vehicle routing problem with time windows
• Edmonds polytopes and a hierarchy of combinatorial problems
• 2-Path Cuts for the Vehicle Routing Problem with Time Windows
• A survey of resource constrained shortest path problems: Exact solution approaches
• New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
• A Parallel Algorithm for the Vehicle Routing Problem
• Subset-Row Inequalities Applied to 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
• Set Partitioning: A survey
• A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
• Clique Inequalities Applied to the Vehicle Routing Problem with Time Windows

This page was built for publication: Limited memory rank-1 cuts for vehicle routing problems