A column generation-based heuristic for the three-dimensional bin packing problem with rotation.
Batoul MahvashAnjali AwasthiSatyaveer Singh ChauhanPublished in: J. Oper. Res. Soc. (2018)
Keyphrases
- column generation
- lagrangean relaxation
- three dimensional
- optimal solution
- integer linear programming
- lagrangian relaxation
- mixed integer programming
- set covering problem
- branch and bound
- lower bound
- set covering
- bin packing
- packing problem
- grasp with path relinking
- integer programming
- linear programming
- linear programming relaxation
- hybrid meta heuristic
- dantzig wolfe
- exact solution
- vehicle routing
- integer program
- linear program
- knapsack problem
- constraint programming
- set partitioning
- cutting plane
- linear programming problems
- feasible solution
- search algorithm
- vehicle routing problem with time windows
- branch and bound algorithm
- combinatorial optimization
- dantzig wolfe decomposition
- cutting plane algorithm
- search strategies
- heuristic methods
- lower and upper bounds
- upper bound
- complete search
- beam search
- exact algorithms
- genetic algorithm
- dynamic programming