A column generation based heuristic for the capacitated vehicle routing problem with three-dimensional loading constraints.
Batoul MahvashAnjali AwasthiSatyaveer Singh ChauhanPublished in: Int. J. Prod. Res. (2017)
Keyphrases
- column generation
- vehicle routing
- lagrangean relaxation
- integer program
- dantzig wolfe
- linear programming problems
- constraint programming
- mixed integer programming
- lagrangian relaxation
- integer linear programming
- optimal solution
- vehicle routing problem with time windows
- set covering problem
- set covering
- vehicle routing problem
- linear programming
- linear program
- branch and bound
- linear programming relaxation
- grasp with path relinking
- dual variables
- exact solution
- metaheuristic
- set partitioning
- constraint satisfaction
- cutting plane
- valid inequalities
- hybrid meta heuristic
- integer programming
- linear relaxation
- routing problem
- complete search
- dantzig wolfe decomposition
- mixed integer
- memetic algorithm
- global constraints
- combinatorial optimization
- tabu search algorithm
- search algorithm
- exact algorithms
- test instances
- search strategies
- ant colony optimization
- tabu search
- constraint satisfaction problems
- linear constraints
- benchmark problems
- branch and bound algorithm
- feasible solution