Geodesic
A heuristic algorithm for the non-oriented 2D rectangular strip packing problem
Buletinul Academiei de Ştiinţe a Republicii Moldova. Matematica, no. 2 (2011), pp. 81-88

Voir la notice de l'article provenant de la source Math-Net.Ru

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. 
@article{BASM_2011_2_a6,
     author = {V. M. Kotov and Dayong Cao},
     title = {A heuristic algorithm for the non-oriented {2D} rectangular strip packing problem},
     journal = {Buletinul Academiei de \c{S}tiin\c{t}e a Republicii Moldova. Matematica},
     pages = {81--88},
     publisher = {mathdoc},
     number = {2},
     year = {2011},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/BASM_2011_2_a6/}
}
TY  - JOUR
AU  - V. M. Kotov
AU  - Dayong Cao
TI  - A heuristic algorithm for the non-oriented 2D rectangular strip packing problem
JO  - Buletinul Academiei de Ştiinţe a Republicii Moldova. Matematica
PY  - 2011
SP  - 81
EP  - 88
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/BASM_2011_2_a6/
LA  - en
ID  - BASM_2011_2_a6
ER  - 
%0 Journal Article
%A V. M. Kotov
%A Dayong Cao
%T A heuristic algorithm for the non-oriented 2D rectangular strip packing problem
%J Buletinul Academiei de Ştiinţe a Republicii Moldova. Matematica
%D 2011
%P 81-88
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/BASM_2011_2_a6/
%G en
%F BASM_2011_2_a6
V. M. Kotov; Dayong Cao. A heuristic algorithm for the non-oriented 2D rectangular strip packing problem. Buletinul Academiei de Ştiinţe a Republicii Moldova. Matematica, no. 2 (2011), pp. 81-88. http://geodesic.mathdoc.fr/item/BASM_2011_2_a6/