An Integer Linear Programming Local Search for Capacitated Vehicle Routing Problems

DOI10.1007/978-0-387-77778-8_13zbMath1190.90029OpenAlexW180429174MaRDI QIDQ3564361

Andrea Tramontani, Paolo Toth

Publication date: 2 June 2010

Published in: Operations Research/Computer Science Interfaces (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-0-387-77778-8_13

zbMATH Keywords

column generationlocal searchinteger linear programmingexponential neighborhooddistance constrained capacitated vehicle routing problem

Mathematics Subject Classification ID

Integer programming (90C10) Linear programming (90C05) Transportation, logistics and supply chain management (90B06)

Related Items

The time constrained maximal covering salesman problem, A hybrid algorithm for a class of vehicle routing problems, An effective matheuristic for the capacitated total quantity discount problem, Hybridizations of evolutionary algorithms with large neighborhood search, An ILP-based local search procedure for the VRP with pickups and deliveries, An integer linear programming based heuristic for the capacitated \(m\)-ring-star problem, Enhanced mixed integer programming techniques and routing problems, An integer programming-based local search for the covering salesman problem, An ILP improvement procedure for the open vehicle routing problem, Exact methods for mono-objective and bi-objective multi-vehicle covering tour problems, Heuristics for multi-attribute vehicle routing problems: a survey and synthesis

Uses Software

• VRP
• VRPLIB
• CVRPSP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A general heuristic for vehicle routing problems
• An efficient variable neighborhood search heuristic for very large scale vehicle routing problems
• Active-guided evolution strategies for large-scale capacitated vehicle routing problems
• On the capacitated vehicle routing problem
• D-Ants: Savings Based Ants divide and conquer the vehicle routing problem.
• Active guided evolution strategies for large-scale vehicle routing problems with time windows
• Solving the vehicle routing problem with adaptive memory programming methodology
• A simple and effective evolutionary algorithm for the vehicle routing problem
• A new branch-and-cut algorithm for the capacitated vehicle routing problem
• A new exact algorithm for the vehicle routing problem based on \(q\)-paths and \(k\)-shortest paths relaxations
• Probabilistic diversification and intensification in local search for vehicle routing
• Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
• Very large-scale vehicle routing: new test problems, algorithms, and results
• Robust branch-and-cut-and-price for the capacitated vehicle routing problem
• A new ILP-based refinement heuristic for vehicle routing problems
• The Vehicle Routing Problem
• The Granular Tabu Search and Its Application to the Vehicle-Routing Problem
• A reactive tabu search for the vehicle routing problem
• Parallel iterative search methods for vehicle routing problems
• A Network Flow-Based Tabu Search Heuristic for the Vehicle Routing Problem
• A new hybrid genetic algorithm for the capacitated vehicle routing problem
• A Tabu Search Heuristic for the Vehicle Routing Problem
• An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation