A genetic programming hyper-heuristic approach for evolving 2-D strip packing heuristics

Burke, Edmund K. and Hyde, Matthew and Kendall, Graham and Woodward, John (2010) A genetic programming hyper-heuristic approach for evolving 2-D strip packing heuristics. IEEE Transactions on Evolutionary Computation, 14 (6). pp. 942-958. ISSN 1089-778X

[img]
Preview
PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
Download (981kB) | Preview

Abstract

We present a genetic programming (GP) system to evolve reusable heuristics for the 2-D strip packing problem. The evolved heuristics are constructive, and decide both which piece to pack next and where to place that piece, given the current partial solution. This paper contributes to a growing research area that represents a paradigm shift in search methodologies. Instead of using evolutionary computation to search a space of solutions, we employ it to search a space of heuristics for the problem. A key motivation is to investigate methods to automate the heuristic design process. It has been stated in the literature that humans are very good at identifying good building blocks for solution methods. However, the task of intelligently searching through all of the potential combinations of these components is better suited to a computer. With such tools at their disposal, heuristic designers are then free to commit more of their time to the creative process of determining good components, while the computer takes on some of the design process by intelligently combining these components. This paper shows that a GP hyper-heuristic can be employed to automatically generate human competitive heuristics in a very-well studied problem domain.

Item Type: Article
Additional Information: © 2010 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
Keywords: 2-D stock cutting; genetic programming; hyper-heuristics
Schools/Departments: University of Nottingham Ningbo China > Faculty of Science and Engineering > School of Computer Science
University of Nottingham, UK > Faculty of Science > School of Computer Science
Identification Number: 10.1109/tevc.2010.2041061
Depositing User: LIN, Zhiren
Date Deposited: 02 Nov 2017 08:35
Last Modified: 03 Nov 2017 09:59
URI: http://eprints.nottingham.ac.uk/id/eprint/47471

Actions (Archive Staff Only)

Edit View Edit View