Using tree search bounds to enhance a genetic algorithm approach to two rectangle packing problems.
Kathryn A. DowslandEdward A. HerbertGraham KendallEdmund K. BurkePublished in: Eur. J. Oper. Res. (2006)
Keyphrases
- tree search
- packing problem
- genetic algorithm
- branch and bound
- bin packing
- lower bound
- search tree
- upper bound
- search algorithm
- constraint propagation
- game tree search
- iterative deepening
- mathematical programming
- cutting stock
- tree search algorithm
- search space
- integer programming
- fitness function
- state space
- branch and bound algorithm
- simulated annealing
- metaheuristic
- tabu search
- path finding
- multi objective
- evolutionary algorithm
- monte carlo
- learning algorithm
- dc programming
- benchmark problems
- database management systems
- particle swarm optimization
- np hard
- neural network