摘要
The 2-D strip packing problem is an NP-hard combinatorial optimization problem. Given a strip with fixed width and infinite height, the aim of strip packing is to pack a set of rectangles with known widths and heights into the strip such that the used height of the strip is minimized. In this paper, we address the 2-D strip packing problem without guillotine constraint and present an effective corner increment-based algorithm. First, a corner increment-based rectangle selection strategy is adopted in a constructive heuristic way. Second, by using the AVL tree and the segment tree, the constructive heuristic is efficiently implemented. Finally, a multi-start random local search is combined to improve the solution. Experimental results on a wide range of benchmark instances show that the proposed algorithm is effective, especially for large instances.
学科与关键词
- A simple randomized algorithm for two-dimensional strip packingYang, Shuangyuan*; Han, Shuihua; Ye, WeiguoCOMPUTERS & OPERATIONS RESEARCH, 2013, 40(1): 1-8.被引 23
- A two-stage intelligent search algorithm for the two-dimensional strip packing problemLeung, Stephen C. H.; Zhang, Defu*; Sim, Kwang MongEUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2011, 215(1): 57-69.被引 68
- 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
