Filtered beam search algorithm for the two‐dimensional rectangular packing problem.
Saved in:
| Title: | Filtered beam search algorithm for the two‐dimensional rectangular packing problem. |
|---|---|
| Authors: | Chen, Mao1 (AUTHOR) chenmao@ccnu.edu.cn, Peng, Xicheng1 (AUTHOR) pxc417@126.com, Tang, Xiangyang1 (AUTHOR) 26385050@qq.com |
| Source: | International Transactions in Operational Research. Nov2025, Vol. 32 Issue 6, p3729-3755. 27p. |
| Subjects: | Search algorithms, Rectangles, Algorithms, Heuristic, Rotational motion |
| Abstract: | In this study, a filtered beam search (FBS) algorithm is proposed to address the two‐dimensional rectangle packing problem, whose objective is to minimize the height of a rectangular sheet of fixed width in which n rectangular items can be packed without overlapping. The corner‐occupying placement (COP) strategy is introduced in the packing process, which packs each rectangle into the sheet so that it occupies a corner position formed by the sheet's edges and the edges of already packed rectangles. Two evaluation criteria, namely, local evaluation and global evaluation, are proposed to evaluate the benefit of a candidate COP and are seamlessly integrated into the FBS framework in order to maintain a better balance between the solution quality and computation time. Extensive testing on four sets of 112 zero‐waste test instances indicated that the proposed method competes favourably with the state‐of‐the‐art reference methods. Furthermore, the proposed method is modified to handle a variant of the rectangle packing problem where item rotations are not allowed. The modified algorithm is competitive, compared with the existing top algorithms, according to computational results on widely used benchmarks. [ABSTRACT FROM AUTHOR] |
| Copyright of International Transactions in Operational Research is the property of Wiley-Blackwell and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
|
Full text is not displayed to guests.
Login for full access.
|
|
| Abstract: | In this study, a filtered beam search (FBS) algorithm is proposed to address the two‐dimensional rectangle packing problem, whose objective is to minimize the height of a rectangular sheet of fixed width in which n rectangular items can be packed without overlapping. The corner‐occupying placement (COP) strategy is introduced in the packing process, which packs each rectangle into the sheet so that it occupies a corner position formed by the sheet's edges and the edges of already packed rectangles. Two evaluation criteria, namely, local evaluation and global evaluation, are proposed to evaluate the benefit of a candidate COP and are seamlessly integrated into the FBS framework in order to maintain a better balance between the solution quality and computation time. Extensive testing on four sets of 112 zero‐waste test instances indicated that the proposed method competes favourably with the state‐of‐the‐art reference methods. Furthermore, the proposed method is modified to handle a variant of the rectangle packing problem where item rotations are not allowed. The modified algorithm is competitive, compared with the existing top algorithms, according to computational results on widely used benchmarks. [ABSTRACT FROM AUTHOR] |
|---|---|
| ISSN: | 09696016 |
| DOI: | 10.1111/itor.70010 |
