摘要
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.
学科与关键词
关键词
Packing problemHeuristicRandomized algorithm
- Improved metaheuristics for the two-dimensional strip packing problemRakotonirainy, Rosephine G.*; van Vuuren, Jan H.APPLIED SOFT COMPUTING, 2020, 92: 106268.被引 31
- A quasi-human algorithm for the two dimensional rectangular strip packing problem: in memory of Prof. Wenqi HuangWang, Lei*; Yin, AihuaJOURNAL OF COMBINATORIAL OPTIMIZATION, 2016, 32(2): 416-444.被引 4
- An Effective Corner Increment-Based Algorithm for the Two-Dimensional Strip Packing ProblemChen, Zhen; Chen, Jianli*IEEE Access, 2018, 6: 72906-72924.被引 9
