An improved best-first branch-and-bound algorithm for constrained two-dimensional guillotine cutting problems
- Authors
- Yoon, K. S.; Ahn, Suneung; Kang, Maing-kyu
- Issue Date
- Mar-2013
- Publisher
- Taylor & Francis
- Keywords
- cutting problem; optimisation; branch and bound; constrained two-dimensional cutting; guillotine cutting pattern
- Citation
- International Journal of Production Research, v.51, no.6, pp 1680 - 1693
- Pages
- 14
- Indexed
- SCI
SCIE
SCOPUS
- Journal Title
- International Journal of Production Research
- Volume
- 51
- Number
- 6
- Start Page
- 1680
- End Page
- 1693
- URI
- https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/28786
- DOI
- 10.1080/00207543.2012.693965
- ISSN
- 0020-7543
1366-588X
- Abstract
- The constrained two-dimensional cutting problem involves maximising the sum of the profits obtained from small rectangular pieces cut from a large rectangular plate where the number of each type of cut piece cannot exceed a prescribed quantity. This paper proposes a best-first branch-and-bound algorithm to find the optimal solution to the problem. The proposed algorithm uses an efficient method to remove the duplicate patterns, and it improves the existing upper bounds. It also prevents the construction of dominated patterns and introduces a new bounding strategy that can prune more than one node at a time. Computational results are compared with a well-known exact algorithm to demonstrate the efficiency of the proposed algorithm. The proposed algorithm is as fast as or faster than the existing algorithm and reduces the average computing time by up to 99% for benchmark problems. For some problems, it can also find optimal solutions that existing algorithms are not able to find.
- Files in This Item
-
Go to Link
- Appears in
Collections - COLLEGE OF ENGINEERING SCIENCES > DEPARTMENT OF INDUSTRIAL & MANAGEMENT ENGINEERING > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/28786)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.