The University of Southampton
University of Southampton Institutional Repository

A beam search implementation for the irregular shape packing problem

A beam search implementation for the irregular shape packing problem
A beam search implementation for the irregular shape packing problem
This paper investigates the irregular shape packing problem. We represent the problem as an ordered list of pieces to be packed where the order is decoded by a placement heuristic. A placement heuristic from the literature is presented and modified with a more powerful nofit polygon generator and new evaluation criteria. We implement a beam search algorithm to search over the packing order. Using this approach many parallel partial solutions can be generated and compared. Computational results for benchmark problems show that the algorithm generates highly competitive solutions in significantly less time than the best results currently in the literature.
cutting and packing, nesting problems, irregular shape, beam search
1381-1231
167-188
Bennell, Julia A.
38d924bc-c870-4641-9448-1ac8dd663a30
Song, Xiang
28fc03d0-9077-49f5-bc94-a4f92fa76565
Bennell, Julia A.
38d924bc-c870-4641-9448-1ac8dd663a30
Song, Xiang
28fc03d0-9077-49f5-bc94-a4f92fa76565

Bennell, Julia A. and Song, Xiang (2010) A beam search implementation for the irregular shape packing problem. Journal of Heuristics, 16 (2), 167-188. (doi:10.1007/s10732-008-9095-x).

Record type: Article

Abstract

This paper investigates the irregular shape packing problem. We represent the problem as an ordered list of pieces to be packed where the order is decoded by a placement heuristic. A placement heuristic from the literature is presented and modified with a more powerful nofit polygon generator and new evaluation criteria. We implement a beam search algorithm to search over the packing order. Using this approach many parallel partial solutions can be generated and compared. Computational results for benchmark problems show that the algorithm generates highly competitive solutions in significantly less time than the best results currently in the literature.

This record has no associated files available for download.

More information

Published date: April 2010
Keywords: cutting and packing, nesting problems, irregular shape, beam search
Organisations: Management

Identifiers

Local EPrints ID: 154605
URI: http://eprints.soton.ac.uk/id/eprint/154605
ISSN: 1381-1231
PURE UUID: d162d8be-a8dc-4657-9e84-dd0163e1c785

Catalogue record

Date deposited: 25 May 2010 15:09
Last modified: 14 Mar 2024 01:34

Export record

Altmetrics

Contributors

Author: Julia A. Bennell
Author: Xiang Song

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 http://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.

×