An integration of Lagrangian split and VNS: the case of the capacitated vehicle routing problem
DOI10.1016/j.cor.2016.02.009zbMath1391.90648OpenAlexW2280737772MaRDI QIDQ1652121
Mouaouia Cherif Bouzid, Hacène Ait Haddadene, Said Salhi
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://kar.kent.ac.uk/55070/7/Bouzid%2528Revision-final%20sent-dec2015%2529.pdf
Lagrangian relaxationsubgradient methodrouting problemsvariable neighbourhood searchhybridisationroute-first cluster-second
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A GRASP with evolutionary path relinking for the truck and trailer routing problem
- Variable neighbourhood search: methods and applications
- A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem
- The fleet size and mix problem for capacitated arc routing
- The fleet size and mix vehicle routing problem
- The traveling salesman problem: An overview of exact and approximate algorithms
- A multi-level composite heuristic for the multi-depot vehicle fleet mix problem
- Variable neighborhood search
- Improvement heuristics for the vehicle routing problem based on simulated annealing
- New benchmark instances for the capacitated vehicle routing problem
- A simple and effective evolutionary algorithm for the vehicle routing problem
- A cooperative parallel metaheuristic for the capacitated vehicle routing problem
- A unified solution framework for multi-attribute vehicle routing problems
- Splitting a giant tour using integer linear programming
- A Parallel Algorithm for the Vehicle Routing Problem
- Vehicle Routing
- Edge assembly-based memetic algorithm for the capacitated vehicle routing problem
- Lagrangian Relaxation for Integer Programming
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- An Optimization Algorithm for the Vehicle Routing Problem with Time Windows Based on Lagrangian Relaxation
- A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
- A guide to vehicle routing heuristics
- A Method for Solving Traveling-Salesman Problems
