|
Buletinul Academiei de Ştiinţe a Republicii Moldova. Matematica, 2011, Number 2, Pages 81–88
(Mi basm290)
|
|
|
|
A heuristic algorithm for the non-oriented 2D rectangular strip packing problem
V. M. Kotova, Dayong Caob a Department of Applied Mathematics and Computer Science, Belarusian State University, Minsk, Belarus
b Department of Applied Mathematics, Harbin University of Science and Technology, Harbin, China
Abstract:
In this paper, we construct best fit based on concave corner strategy ($BF_{BCC}$) for the two-dimensional rectangular strip packing problem (2D-RSPP), and compare it with some heuristic and metaheuristic algorithms from the literature. The experimental results show that $BF_{BCC}$ could produce satisfied packing layouts, especially for the large problem of 50 pieces or more, $BF_{BCC}$ could get better results in shorter time.
Keywords and phrases:
rectangular strip packing, heuristic, best-fit, concave corner.
Received: 06.09.2010
Citation:
V. M. Kotov, Dayong Cao, “A heuristic algorithm for the non-oriented 2D rectangular strip packing problem”, Bul. Acad. Ştiinţe Repub. Mold. Mat., 2011, no. 2, 81–88
Linking options:
https://www.mathnet.ru/eng/basm290 https://www.mathnet.ru/eng/basm/y2011/i2/p81
|
Statistics & downloads: |
Abstract page: | 249 | Full-text PDF : | 72 | References: | 41 | First page: | 1 |
|