Bennell, JA orcid.org/0000-0002-5338-2247, Cabo, M and Martínez-Sykora, A (2018) A beam search approach to solve the convex irregular bin packing problem with guillotine cuts. European Journal of Operational Research, 270 (1). pp. 89-102. ISSN 0377-2217
Abstract
This paper presents a two dimensional convex irregular bin packing problem with guillotine cuts. The problem combines the challenges of tackling the complexity of packing irregular pieces, guaranteeing guillotine cuts that are not always orthogonal to the edges of the bin, and allocating pieces to bins that are not necessarily of the same size. This problem is known as a two-dimensional multi bin size bin packing problem with convex irregular pieces and guillotine cuts. Since pieces are separated by means of guillotine cuts, our study is restricted to convex pieces.A beam search algorithm is described, which is successfully applied to both the multi and single bin size instances. The algorithm is competitive with the results reported in the literature for the single bin size problem and provides the first results for the multi bin size problem.
Metadata
Item Type: | Article |
---|---|
Authors/Creators: |
|
Copyright, Publisher and Additional Information: | © 2018 Elsevier B.V. This is an author produced version of a paper published in European Journal of Operational Research. Uploaded in accordance with the publisher's self-archiving policy. |
Keywords: | Cutting; Packing; Heuristics; Beam search; Guillotine cuts |
Dates: |
|
Institution: | The University of Leeds |
Academic Units: | The University of Leeds > Faculty of Business (Leeds) > Faculty Office (LUBS) (Leeds) > Deans Office and Facilities (LUBS) (Leeds) |
Depositing User: | Symplectic Publications |
Date Deposited: | 17 Aug 2018 09:10 |
Last Modified: | 30 Mar 2020 00:40 |
Status: | Published |
Publisher: | Elsevier |
Identification Number: | 10.1016/j.ejor.2018.03.029 |
Related URLs: | |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:134687 |