Conference Proceeding

A hyper-heuristic approach to strip packing problems

Details

Citation

Burke E, Guo Q & Kendall G (2010) A hyper-heuristic approach to strip packing problems. In: Schaefer R, Cotta C, Kolodziej J & Rudolph G (eds.) Parallel Problem Solving from Nature, PPSN XI: 11th International Conference, Kraków, Poland, September 11-15, 2010, Proceedings, Part I. Lecture Notes in Computer Science, 6238. 11th International Conference on Parallel Problem Solving from Nature, PPSN XI, Kraków, Poland, 11.09.2010-15.09.2010. Heidelberg: Springer, pp. 465-474. http://link.springer.com/chapter/10.1007/978-3-642-15844-5_47#

Abstract
In this paper we propose a genetic algorithm based hyper-heuristic for producing good quality solutions to strip packing problems. Instead of using just a single decoding heuristic, we employ a set of heuristics. This enables us to search a larger solution space without loss of efficiency. Empirical studies are presented on two-dimensional orthogonal strip packing problems which demonstrate that the algorithm operates well across a wide range of problem instances.

Keywords
Hyper-heuristic; Strip Packing

StatusPublished
Title of seriesLecture Notes in Computer Science
Number in series6238
Publication date31/12/2010
Publication date online30/09/2010
URLhttp://hdl.handle.net/1893/15746
PublisherSpringer
Publisher URLhttp://link.springer.com/…-642-15844-5_47#
Place of publicationHeidelberg
ISSN of series0302-9743
ISBN978-3-642-15843-8
Conference11th International Conference on Parallel Problem Solving from Nature, PPSN XI
Conference locationKraków, Poland
Dates