摘要
This paper presents a two-stage intelligent search algorithm for a two-dimensional strip packing problem without guillotine constraint. In the first stage, a heuristic algorithm is proposed, which is based on a simple scoring rule that selects one rectangle from all rectangles to be packed, for a given space. In the second stage, a local search and a simulated annealing algorithm are combined to improve solutions of the problem. In particular, a multi-start strategy is designed to enhance the search capability of the simulated annealing algorithm. Extensive computational experiments on a wide range of benchmark problems from zero-waste to non-zero-waste instances are implemented. Computational results obtained in less than 60 seconds of computation time show that the proposed algorithm outperforms the supposedly excellent algorithms reported recently, on average. It performs particularly better for large instances.
学科与关键词
- 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
