The University of Southampton
University of Southampton Institutional Repository

Construction heuristics for two-dimensional irregular shape bin packing with guillotine constraints

Construction heuristics for two-dimensional irregular shape bin packing with guillotine constraints
Construction heuristics for two-dimensional irregular shape bin packing with guillotine constraints
The paper examines a new problem in the irregular packing
literature that has existed in industry for decades;
two-dimensional irregular (convex) bin packing with guillotine
constraints. Due to the cutting process of certain materials, cuts
are restricted to extend from one edge of the stock-sheet to
another, called guillotine cutting. This constraint is common
place in glass cutting and is an important constraints in
two-dimensional cutting and packing problems. In the literature,
various exact and approximate algorithms exist for finding the two
dimensional cutting patterns that satisfy the guillotine cutting
constraint. However, to the best of our knowledge, all of the
algorithms are designed for solving rectangular cutting where cuts
are orthogonal with the edges of the stock-sheet. In order to
satisfy the guillotine cutting constraint using these approaches,
when the pieces are non-rectangular, practitioners implement a two
stage approach. First, pieces are enclosed within rectangle shapes
and then the rectangles are packed. Clearly, imposing this
condition is likely to lead to additional waste. This
paper aims to generate guillotine-cutting layouts of irregular
shapes using a number of strategies. The investigation compares
two two-stage approaches; one approximates pieces by rectangles,
the other approximates pairs of pieces by rectangles using
phi-functions for optimal clustering. Both these approaches use
state of the art rectangle bin packing with guillotine
constraints. Further, we design and implement a one-stage approach
using a self-adapted forest search algorithm. Experimental results
show the one-stage strategy to produce good solutions in less time
over the two-stage approach.
University of Southampton
Bennell, Julia A.
38d924bc-c870-4641-9448-1ac8dd663a30
Han, W.
a7746aa4-69d7-419e-afdf-bab77cb4be96
Zhao, X.
c32d0dd5-3ac6-4c9c-b41e-95baa08c7472
Song, X.
ff20e46a-8d2b-4540-9ca2-834f047a1e8d
Bennell, Julia A.
38d924bc-c870-4641-9448-1ac8dd663a30
Han, W.
a7746aa4-69d7-419e-afdf-bab77cb4be96
Zhao, X.
c32d0dd5-3ac6-4c9c-b41e-95baa08c7472
Song, X.
ff20e46a-8d2b-4540-9ca2-834f047a1e8d

Bennell, Julia A., Han, W., Zhao, X. and Song, X. (2012) Construction heuristics for two-dimensional irregular shape bin packing with guillotine constraints Southampton, GB. University of Southampton

Record type: Monograph (Working Paper)

Abstract

The paper examines a new problem in the irregular packing
literature that has existed in industry for decades;
two-dimensional irregular (convex) bin packing with guillotine
constraints. Due to the cutting process of certain materials, cuts
are restricted to extend from one edge of the stock-sheet to
another, called guillotine cutting. This constraint is common
place in glass cutting and is an important constraints in
two-dimensional cutting and packing problems. In the literature,
various exact and approximate algorithms exist for finding the two
dimensional cutting patterns that satisfy the guillotine cutting
constraint. However, to the best of our knowledge, all of the
algorithms are designed for solving rectangular cutting where cuts
are orthogonal with the edges of the stock-sheet. In order to
satisfy the guillotine cutting constraint using these approaches,
when the pieces are non-rectangular, practitioners implement a two
stage approach. First, pieces are enclosed within rectangle shapes
and then the rectangles are packed. Clearly, imposing this
condition is likely to lead to additional waste. This
paper aims to generate guillotine-cutting layouts of irregular
shapes using a number of strategies. The investigation compares
two two-stage approaches; one approximates pieces by rectangles,
the other approximates pairs of pieces by rectangles using
phi-functions for optimal clustering. Both these approaches use
state of the art rectangle bin packing with guillotine
constraints. Further, we design and implement a one-stage approach
using a self-adapted forest search algorithm. Experimental results
show the one-stage strategy to produce good solutions in less time
over the two-stage approach.

PDF
Irreg_guillotine_eprint.pdf - Other
Download (411kB)

More information

Submitted date: 1 January 2012
Organisations: Centre of Excellence for International Banking, Finance & Accounting

Identifiers

Local EPrints ID: 208137
URI: https://eprints.soton.ac.uk/id/eprint/208137
PURE UUID: d36518f2-3f4d-46bb-82ec-aa67c9526d43

Catalogue record

Date deposited: 19 Jan 2012 16:58
Last modified: 18 Jul 2017 10:49

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.

×