An Exact Approach to the Strip-Packing Problem
INFORMS Journal on Computing
Exhaustive approaches to 2D rectangular perfect packings
Information Processing Letters
New heuristic and interactive approaches to 2D rectangular strip packing
Journal of Experimental Algorithmics (JEA)
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
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
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
Hyperheuristic encoding scheme for multi-objective guillotine cutting problems
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Hyperheuristic for the parameter tuning of a bio-inspired algorithm of query routing in p2p networks
MICAI'11 Proceedings of the 10th international conference on Artificial Intelligence: advances in Soft Computing - Volume Part II
A Flexible and Adaptive Hyper-heuristic Approach for (Dynamic) Capacitated Vehicle Routing Problems
Fundamenta Informaticae - Emergent Computing
A Reinforced Tabu Search Approach for 2D Strip Packing
International Journal of Applied Metaheuristic Computing
Hi-index | 0.00 |
In this paper we introduce a collaboration framework for hyperheuristics to solve hard strip packing problems. We have designed a genetic based hyperheuristic to cooperate with a hill-climbing based hyperheuristic. Both of them use the most recently proposed low-level heuristics in the literature. REVAC, which has recently been proposed for tuning [18], has been used to find the best operators parameter values. The results obtained are very encouraging and have improved the results from both the single heuristics and the single hyperheuristics' tests. Thus, we conclude that the collaboration among hyperheuristics is a good way to solve hard strip packing problems.