A column generation and a post optimization VNS heuristic for the vehicle routing problem with multiple time windows.
Eduardo Theodoro BogueHuggo Silva FerreiraThiago F. NoronhaChristian PrinsPublished in: Optim. Lett. (2022)
Keyphrases
- cutting plane
- column generation
- vehicle routing
- lagrangean relaxation
- vehicle routing problem
- optimal solution
- mixed integer programming
- branch and bound
- lagrangian relaxation
- integer programming
- integer program
- variable neighborhood search
- linear programming
- tabu search
- linear programming relaxation
- linear program
- vehicle routing problem with time windows
- metaheuristic
- search algorithm
- solution quality
- multi depot
- set partitioning
- dantzig wolfe
- exact solution
- constraint programming
- np hard
- combinatorial optimization
- benchmark instances
- branch and bound algorithm
- hybrid metaheuristic
- knapsack problem
- neighborhood search
- lower bound
- special case
- optimization problems
- test instances
- heuristic methods
- benchmark problems
- scheduling problem
- particle swarm optimization
- combinatorial optimization problems
- routing problem
- computational complexity
- hybrid method
- feasible solution