摘要
The rectangle knapsack packing problem is to pack a number of rectangles into a larger stock sheet such that the total value of packed rectangles is maximized. The paper first presents a fitness strategy, which is used to determine which rectangle is to be first packed into a given position. Based on this fitness strategy, a constructive heuristic algorithm is developed to generate a solution, i.e. a given sequence of rectangles for packing. Then, a greedy strategy is used to search a better solution. At last, a simulated annealing algorithm is introduced to jump out of the local optimal trap of the greedy strategy, to find a further improved solution. Computational results on 221 rectangular packing instances show that the presented algorithm outperforms some previous algorithms on average.
学科与关键词
- Improved metaheuristics for the two-dimensional strip packing problemRakotonirainy, Rosephine G.*; van Vuuren, Jan H.APPLIED SOFT COMPUTING, 2020, 92: 106268.被引 31
- 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
- An effective approach to the two-dimensional rectangular packing problem in the manufacturing industryFirat, Huseyin*; Alpaslan, NuhCOMPUTERS & INDUSTRIAL ENGINEERING, 2020, 148: 106687.被引 17
