An integrated local-search/set-partitioning refinement heuristic for the Capacitated Vehicle Routing Problem.
Francesco CavaliereEmilio BendottiMatteo FischettiPublished in: Math. Program. Comput. (2022)
Keyphrases
- set partitioning
- memetic algorithm
- tabu search
- column generation
- routing problem
- vehicle routing problem with time windows
- optimal solution
- combinatorial optimization
- metaheuristic
- vehicle routing problem
- search procedures
- search algorithm
- simulated annealing
- exact algorithms
- branch and bound
- dantzig wolfe decomposition
- timetabling problem
- mixed integer programming
- integer programming
- vehicle routing
- linear programming relaxation
- search procedure
- genetic algorithm
- search strategies
- feasible solution
- hill climbing
- heuristic methods
- lagrangian relaxation
- tree search
- search heuristics
- traveling salesman problem
- linear programming
- knapsack problem
- dynamic programming
- valid inequalities
- optimization problems
- search space
- lower bound
- ant colony optimization
- heuristic search
- cutting plane
- lp relaxation
- particle swarm optimization
- hyper heuristics
- exact solution