Pheromone-Based Heuristic Column Generation for Vehicle Routing Problems with Black Box Feasibility.
Florence MassenYves DevillePascal Van HentenryckPublished in: CPAIOR (2012)
Keyphrases
- black box
- column generation
- vehicle routing problem with time windows
- multi depot
- lagrangean relaxation
- vehicle routing problem
- optimal solution
- vehicle routing
- guided local search
- mixed integer programming
- integer linear programming
- lagrangian relaxation
- branch and bound
- tabu search
- metaheuristic
- set partitioning
- benchmark instances
- linear programming
- integer programming
- integer program
- exact algorithms
- ant colony optimization
- linear programming relaxation
- dantzig wolfe
- linear program
- exact solution
- constraint programming
- combinatorial optimization
- routing problem
- variable neighborhood search
- search algorithm
- valid inequalities
- cutting plane
- test instances
- simulated annealing
- test cases
- solution quality
- dantzig wolfe decomposition
- np hard
- knapsack problem
- search strategies
- upper bound
- greedy randomized adaptive search procedure
- memetic algorithm
- benchmark problems
- hyper heuristics
- dynamic programming
- lower bound