A Hybrid Improvement Heuristic for the One-Dimensional Bin Packing Problem.
Adriana C. F. AlvimCelso C. RibeiroFred W. GloverDario J. AloisePublished in: J. Heuristics (2004)
Keyphrases
- bin packing
- packing problem
- lower bound
- optimal solution
- simulated annealing and tabu search
- multi dimensional
- simulated annealing
- tabu search
- knapsack problem
- grasp with path relinking
- variable sized
- beam search
- constraint satisfaction
- search tree
- hybrid learning
- database
- exact algorithms
- branch and bound algorithm
- hybrid approaches
- parallel genetic algorithm
- evolutionary algorithm
- search engine
- genetic algorithm