Speeding Up Logic-Based Benders' Decomposition by a Metaheuristic for a Bi-Level Capacitated Vehicle Routing Problem.
Günther R. RaidlThomas BaumhauerBin HuPublished in: Hybrid Metaheuristics (2014)
Keyphrases
- bi level
- metaheuristic
- benders decomposition
- mixed integer
- exact algorithms
- network design problem
- tabu search
- optimal solution
- combinatorial optimization
- ant colony optimization
- combinatorial problems
- combinatorial optimization problems
- gray scale
- simulated annealing
- scatter search
- vehicle routing problem
- optimization problems
- feasible solution
- search space
- genetic algorithm
- particle swarm optimization
- memetic algorithm
- knapsack problem
- network design
- guided local search
- exact solution
- lp relaxation
- approximation algorithms
- vehicle routing problem with time windows
- max sat
- branch and bound
- benchmark problems
- markov random field
- solution quality