| Conţinutul numărului revistei |
| Articolul precedent |
| Articolul urmator |
 |
 889 5 |
| Ultima descărcare din IBN: 2023-12-06 05:52 |
 SM ISO690:2012KOTOV, Vladimir, CAO, Dayong. A heuristic algorithm for the non-oriented 2D rectangular strip packing problem. In: Buletinul Academiei de Ştiinţe a Republicii Moldova. Matematica, 2011, nr. 2(66), pp. 81-88. ISSN 1024-7696. |
| EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
 Buletinul Academiei de Ştiinţe a Republicii Moldova. Matematica |
||||||
| Numărul 2(66) / 2011 / ISSN 1024-7696 /ISSNe 2587-4322 | ||||||
|
||||||
| Pag. 81-88 | ||||||
|
||||||
 Descarcă PDF |
||||||
| Rezumat | ||||||
In this paper, we construct best fit based on concave corner strategy (BFBCC) 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 BFBCC could produce satisfied packing layouts, especially for the large problem of 50 pieces or more, BFBCC could get better results in shorter time. |
||||||
| Cuvinte-cheie Rectangular strip packing, best-fit, Concave corner, heuristic |
||||||
|
|
|
|
