An Exact Approach to the Strip-Packing Problem
INFORMS Journal on Computing
Exhaustive approaches to 2D rectangular perfect packings
Information Processing Letters
New Large Benchmark Instances for the Two-Dimensional Strip Packing Problem with Rectangular Pieces
HICSS '06 Proceedings of the 39th Annual Hawaii International Conference on System Sciences - Volume 02
A new heuristic recursive algorithm for the strip rectangular packing problem
Computers and Operations Research
A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
Operations Research
An investigation of a hyperheuristic genetic algorithm applied to a trainer scheduling problem
CEC '02 Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02
The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation
IEEE Transactions on Computers
Relevance estimation and value calibration of evolutionary algorithm parameters
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
BubbleSearch: A simple heuristic for improving priority-based greedy algorithms
Information Processing Letters
| Hi-index | 0.00 |
In this paper we introduce an evolutionary hyperheuristic approach to solve difficult strip packing problems. We have designed a genetic based hyperheuristic using the most recently proposed low-level heuristics in the literature. Two versions for tuning parameters have also been evaluated. The results obtained are very encouraging showing that our approach outperforms the single heuristics and others well-known techniques.