A matheuristic for the asymmetric capacitated vehicle routing problem

DOI10.1016/j.dam.2016.03.019zbMath1382.90012OpenAlexW2345852648MaRDI QIDQ1686058

Valeria Leggieri, Mohamed Haouari

Publication date: 20 December 2017

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2016.03.019

zbMATH Keywords

matheuristicasymmetric capacitated vehicle routing problemcompact MILP formulations

Mathematics Subject Classification ID

Mixed integer programming (90C11) Linear programming (90C05) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

A POPMUSIC matheuristic for the capacitated vehicle routing problem ⋮ A matheuristic for tactical locomotive and driver scheduling for the swiss national railway company SBB Cargo AG

Uses Software

• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• Stronger multi-commodity flow formulations of the capacitated vehicle routing problem
• A hybrid algorithm for a class of vehicle routing problems
• Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints
• Models, relaxations and exact approaches for the capacitated vehicle routing problem
• The vehicle routing problem. Latest advances and new challenges.
• A result on projection for the vehicle routing problem
• A heuristic algorithm for the asymmetric capacitated vehicle routing problem
• Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
• A survey on matheuristics for routing problems
• A unified solution framework for multi-attribute vehicle routing problems
• Projection results for vehicle routing
• A new ILP-based refinement heuristic for vehicle routing problems
• Vehicle Routing
• Metaheuristics for the Vehicle Routing Problem and Its Extensions: A Categorized Bibliography
• Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems
• An Integer Programming Approach to the Vehicle Scheduling Problem
• A Branch-and-Bound Algorithm for the Capacitated Vehicle Routing Problem on Directed Graphs