Skip to main content

A tutorial in irregular shape packing problems

Buy Article:

$43.00 plus tax (Refund Policy)


Cutting and packing problems have been a core area of research for many decades. Irregular shape packing is one of the most recent variants to be widely researched and its history extends over 40 years. The evolution of solution approaches to this problem can be attributed to increased computer power and advances in geometric techniques as well as more sophisticated and insightful algorithm design. In this paper we will focus on the latter. Our aim is not to give a chronological account or an exhaustive review, but to draw on the literature to describe and evaluate the core approaches. Irregular packing is combinatorial and as a result solution methods are heuristic, save a few notable exceptions. We will explore different ways of representing the problem and mechanisms for moving between solutions. We will also propose where we see the future challenges for researchers in this area.Journal of the Operational Research Society (2009) 60, S93–S105. doi:10.1057/jors.2008.169 Published online 4 February 2009

Document Type: Research Article


Affiliations: 1: University of Southampton, Southampton, UK 2: Universidade do Porto, Porto, Portugal

Publication date: 2009-05-01

  • Access Key
  • Free content
  • Partial Free content
  • New content
  • Open access content
  • Partial Open access content
  • Subscribed content
  • Partial Subscribed content
  • Free trial content
Cookie Policy
Cookie Policy
Ingenta Connect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more