An integrated local-search/set-partitioning refinement heuristic for the capacitated vehicle routing problem
From MaRDI portal
Publication:2099500
DOI10.1007/s12532-022-00224-2zbMath1498.90184OpenAlexW4283782954MaRDI QIDQ2099500
Emilio Bendotti, Matteo Fischetti, Francesco Cavaliere
Publication date: 24 November 2022
Published in: Mathematical Programming Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12532-022-00224-2
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Uses Software
Cites Work
- Unnamed Item
- Optimization by Simulated Annealing
- A hybrid algorithm for a class of vehicle routing problems
- General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic
- Transforming asymmetric into symmetric traveling salesman problems: Erratum
- Large-step Markov chains for the TSP incorporating local search heuristics
- Efficiently solving very large-scale routing problems
- New benchmark instances for the capacitated vehicle routing problem
- Probabilistic diversification and intensification in local search for vehicle routing
- POPMUSIC for the travelling salesman problem
- A generic exact solver for vehicle routing and related problems
- A review of dynamic vehicle routing problems
- Improved branch-cut-and-price for capacitated vehicle routing
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem
- A new ILP-based refinement heuristic for vehicle routing problems
- A POPMUSIC matheuristic for the capacitated vehicle routing problem
- The Truck Dispatching Problem
- A Suggested Computation for Maximal Multi-Commodity Network Flows
- Chained Lin-Kernighan for Large Traveling Salesman Problems
- A Set-Covering-Based Heuristic Approach for Bin-Packing Problems
- An Evolutionary Algorithm for Polishing Mixed Integer Programming Solutions
- Vehicle Routing
- The Decomposition Algorithm for Linear Programs
- Handbook of Heuristics
- Optimal Routing under Capacity and Distance Restrictions
- Technical Note—An Improved Transformation of the Symmetric Multiple Traveling Salesman Problem
- An Integer Programming Approach to the Vehicle Scheduling Problem
- A Set-Partitioning-Based Heuristic for the Vehicle Routing Problem
- A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
- Data Structures for Traveling Salesmen
- A Heuristic Method for the Set Covering Problem
- Extensions of the Petal Method for Vehicle Routeing
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
