The University of Southampton
University of Southampton Institutional Repository

50 years of irregular shape packing problems: a tutorial

50 years of irregular shape packing problems: a tutorial
50 years of irregular shape packing problems: a tutorial
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.
CORMSIS-08-14
University of Southampton
Bennell, J.A.
38d924bc-c870-4641-9448-1ac8dd663a30
Oliveria, J.F.
ab64d0e8-1d29-4600-9a66-52f066296acf
Bennell, J.A.
38d924bc-c870-4641-9448-1ac8dd663a30
Oliveria, J.F.
ab64d0e8-1d29-4600-9a66-52f066296acf

Bennell, J.A. and Oliveria, J.F. (2008) 50 years of irregular shape packing problems: a tutorial (Discussion Papers in Centre for Operational Research, Management Science and Information Systems, CORMSIS-08-14) Southampton, UK. University of Southampton

Record type: Monograph (Discussion Paper)

Abstract

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.

Full text not available from this repository.

More information

Published date: 2008

Identifiers

Local EPrints ID: 63406
URI: https://eprints.soton.ac.uk/id/eprint/63406
PURE UUID: 435f4821-aa1a-4046-8159-119cdaeafb36

Catalogue record

Date deposited: 28 Oct 2008
Last modified: 13 Mar 2019 20:25

Export record

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of https://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×