Conţinutul numărului revistei |
Articolul precedent |
Articolul urmator |
728 3 |
Ultima descărcare din IBN: 2022-01-04 23:10 |
SM ISO690:2012 KOTOV, Vladimir, CAO, Dayong. A heuristic algorithm for the two-dimensional single large bin packing problem. In: Buletinul Academiei de Ştiinţe a Republicii Moldova. Matematica, 2010, nr. 3(64), pp. 23-28. ISSN 1024-7696. |
EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
Buletinul Academiei de Ştiinţe a Republicii Moldova. Matematica | |||||
Numărul 3(64) / 2010 / ISSN 1024-7696 /ISSNe 2587-4322 | |||||
|
|||||
Pag. 23-28 | |||||
|
|||||
Descarcă PDF | |||||
Rezumat | |||||
In this paper, we propose a heuristic algorithm based on concave corner (BCC) for the two-dimensional rectangular single large packing problem (2D-SLBPP),
and compare it against some heuristic and metaheuristic algorithms from the lite-
rature. The experiments show that our algorithm is highly competitive and could
be considered as a viable alternative, for 2D-SLBPP. Especially for large test problems, the algorithm could get satisfied results more quickly than other approaches in literature. |
|||||
Cuvinte-cheie Rectangular packing, best-fit, concave corner, fitness value, heuristic |
|||||
|