Solving the one-dimensional bin packing problem with a weight annealing heuristic.
Kok-Hua LohBruce L. GoldenEdward A. WasilPublished in: Comput. Oper. Res. (2008)
Keyphrases
- simulated annealing
- bin packing
- packing problem
- combinatorial optimization
- variable neighbourhood search
- finding an optimal solution
- multi dimensional
- metaheuristic
- timetabling problem
- search heuristics
- dynamic programming algorithms
- lower bound
- branch and bound search
- variable ordering
- mip solver
- neural network
- sliding tile
- beam search
- search space
- search algorithm
- admissible heuristics
- solution quality
- traveling salesman problem
- monte carlo
- dynamic programming
- optimal solution