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

  • Authors:

  • Edmund K. Burke;Matthew Hyde;Graham Kendall;John Woodward

  • Affiliations:

  • Automated Scheduling, Optimization and Planning Research Group, School of Computer Science, University of Nottingham, Nottingham, UK;Automated Scheduling, Optimization and Planning Research Group, School of Computer Science, University of Nottingham, Nottingham, UK;Automated Scheduling, Optimization and Planning Research Group, School of Computer Science, University of Nottingham, Nottingham, UK;School of Computer Science, University of Nottingham, Ningbo, China

  • Venue:
  • IEEE Transactions on Evolutionary Computation
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

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 hyperheuristic can be employed to automatically generate human competitive heuristics in a very-well studied problem domain.