The University of Southampton
University of Southampton Institutional Repository

A beam search implementation for nesting problems

A beam search implementation for nesting problems
A beam search implementation for nesting problems
The paper will present a constructive approach for nesting problems that utilises beam search to guide the generation of efficient layouts. In order to design an effective constructive heuristic it is important to consider two key features; the placement rule and the intelligent search strategy. Many placement heuristics have been investigated by researchers with the majority favouring some variant of the left most strategy. In our implementation we base the placement rule on the TOPOS algorithm which permits the layout to grow from a floating origin rather than from left to right. We include some improvements in the scope of placements via a more powerful nofit polygon generator that can efficiently represent holes in the partial solution. The role of the intelligent search strategy is to determine the order in which the pieces should be placed. Searching a permutation has a natural tree search structure. However, the combinatorial nature of the problem prevents exhaustive search and reasonable bounds are difficult to define. As a result a beam search approach is proposed where the beam width can constrain the number of branches searched. Empirical results are presented.
irregular cutting stock, local search, TOPOS
Bennell, Julia A.
38d924bc-c870-4641-9448-1ac8dd663a30
Song, X.
ff20e46a-8d2b-4540-9ca2-834f047a1e8d
Bennell, Julia A.
38d924bc-c870-4641-9448-1ac8dd663a30
Song, X.
ff20e46a-8d2b-4540-9ca2-834f047a1e8d

Bennell, Julia A. and Song, X. (2006) A beam search implementation for nesting problems. 3rd ESICUP Meeting: The EURO Special Interest Group on Cutting and Packing. 16 - 18 Mar 2006.

Record type: Conference or Workshop Item (Paper)

Abstract

The paper will present a constructive approach for nesting problems that utilises beam search to guide the generation of efficient layouts. In order to design an effective constructive heuristic it is important to consider two key features; the placement rule and the intelligent search strategy. Many placement heuristics have been investigated by researchers with the majority favouring some variant of the left most strategy. In our implementation we base the placement rule on the TOPOS algorithm which permits the layout to grow from a floating origin rather than from left to right. We include some improvements in the scope of placements via a more powerful nofit polygon generator that can efficiently represent holes in the partial solution. The role of the intelligent search strategy is to determine the order in which the pieces should be placed. Searching a permutation has a natural tree search structure. However, the combinatorial nature of the problem prevents exhaustive search and reasonable bounds are difficult to define. As a result a beam search approach is proposed where the beam width can constrain the number of branches searched. Empirical results are presented.

Full text not available from this repository.

More information

Published date: 2006
Additional Information: ESICUP is a working group of EURO (The Association of European Operational Research Societies)
Venue - Dates: 3rd ESICUP Meeting: The EURO Special Interest Group on Cutting and Packing, 2006-03-16 - 2006-03-18
Keywords: irregular cutting stock, local search, TOPOS
Organisations: Management

Identifiers

Local EPrints ID: 37483
URI: http://eprints.soton.ac.uk/id/eprint/37483
PURE UUID: 0b865c40-7ac4-4bdc-8c90-e60e71eaeacc

Catalogue record

Date deposited: 23 May 2006
Last modified: 17 Jul 2017 15:42

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 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.

×