|Appears in Collections:||Computing Science and Mathematics Conference Papers and Proceedings|
|Peer Review Status:||Refereed|
|Title:||A hyper-heuristic approach to strip packing problems|
|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 (ed.) Parallel Problem Solving from Nature, PPSN XI: 11th International Conference, Kraków, Poland, September 11-15, 2010, Proceedings, Part I, Heidelberg: Springer. 11th International Conference on Parallel Problem Solving from Nature, PPSN XI, 11.9.2010 - 15.9.2010, Kraków, Poland, pp. 465-474.|
|Series/Report no.:||Lecture Notes in Computer Science, 6238|
|Conference Name:||11th International Conference on Parallel Problem Solving from Nature, PPSN XI|
|Conference Location:||Kraków, Poland|
|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.|
|Status:||Book Chapter: publisher version|
|Rights:||The publisher does not allow this work to be made publicly available in this Repository. Please use the Request a Copy feature at the foot of the Repository record to request a copy directly from the author. You can only request a copy if you wish to use this work for your own research or private study.|
|A hyper-heuristic approach to strip packing problems.pdf||170.92 kB||Adobe PDF||Under Permanent Embargo Request a copy|
Note: If any of the files in this item are currently embargoed, you can request a copy directly from the author by clicking the padlock icon above. However, this facility is dependent on the depositor still being contactable at their original email address.
This item is protected by original copyright
Items in the Repository are protected by copyright, with all rights reserved, unless otherwise indicated.
If you believe that any material held in STORRE infringes copyright, please contact firstname.lastname@example.org providing details and we will remove the Work from public display in STORRE and investigate your claim.