A simple randomized algorithm for two-dimensional strip packing

• Published in: Computers & operations research Vol. 40; no. 1; pp. 1 - 8
• Main Authors: Yang, Shuangyuan, Han, Shuihua, Ye, Weiguo
• Format: Journal Article
• Language: English
• Published: Kidlington Elsevier Ltd 01.01.2013; Elsevier; Pergamon Press Inc
• Subjects: Algorithms; Applied sciences; Benchmarking; Comparative analysis; Decision theory. Utility theory; Exact sciences and technology; Flows in networks. Combinatorial problems; Heuristic; Operational research and scientific management; Operational research. Management science; Operations research; Packing problem; Randomized algorithm; Randomized algorithms; Raw materials; Scoring; Strategy; Strip; Studies; Two dimensional; Randomized algorithm; Packing problem; Heuristic; Information measure; Randomized design; Hierarchical classification; Priority; Heuristic method; Problem solving; Bin packing problem; Height; Metamodel
• ISSN: 0305-0548; 1873-765X; 0305-0548
• DOI: 10.1016/j.cor.2012.05.001

Two-dimensional strip packing problem is to pack given rectangular pieces on a strip of stock sheet having fixed width and infinite height. Its aim is to minimize the height of the strip such that non-guillotinable and fix orientation constraints are meet. In this paper, an improved scoring rule is developed and the least waste priority strategy is introduced, and a randomized algorithm is presented for solving this problem. This algorithm is very simple and does not need to set any parameters. Computational results on a wide range of benchmark problem instances show that the proposed algorithm obtains a better or matching performance as compared to the most of the previously published meta-heuristics.