Heuristics with Stochastic Neighborhood Structures for Two-Dimensional Bin Packing and Cutting Stock Problems.
T. M. ChanFilipe Pereira AlvelosElsa SilvaJosé M. Valério de CarvalhoPublished in: Asia Pac. J. Oper. Res. (2011)
Keyphrases
- bin packing
- cutting stock problems
- graph colouring
- hyper heuristics
- packing problem
- approximation schemes
- genetic programming
- evolutionary algorithm
- timetabling problem
- multiple objectives
- search tree
- search procedure
- constraint satisfaction problems
- difficult problems
- search algorithm
- multi dimensional
- metaheuristic
- heuristic methods
- genetic algorithm
- integer programming
- constraint satisfaction
- heuristic search
- fitness function
- search heuristics
- round robin
- low dimensional
- upper bound
- query processing