Column Generation Heuristic for a Rich Arc Routing Problem.
Sébastien LannezChristian ArtiguesJean DamayMichel GendreauPublished in: ATMOS (2010)
Keyphrases
- column generation
- lagrangean relaxation
- lagrangian relaxation
- mixed integer programming
- integer linear programming
- optimal solution
- set covering problem
- set covering
- grasp with path relinking
- branch and bound
- linear programming
- linear programming relaxation
- dantzig wolfe
- linear program
- vehicle routing
- integer programming
- hybrid meta heuristic
- set partitioning
- integer program
- cutting plane
- constraint programming
- exact solution
- linear programming problems
- search algorithm
- complete search
- tabu search
- feasible solution
- tree search
- dantzig wolfe decomposition
- valid inequalities
- cutting plane algorithm
- vehicle routing problem with time windows
- simulated annealing
- objective function
- search strategies
- beam search
- lower bound
- search space
- combinatorial optimization
- relaxation algorithm
- constraint satisfaction
- linear relaxation
- upper bound
- metaheuristic