A heuristic algorithm for the two-dimensional single large bin packing problem
Închide
Conţinutul numărului revistei
Articolul precedent
Articolul urmator
314 2
Ultima descărcare din IBN:
2019-02-22 14:27
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 Moldovei. Matematica. 2010, nr. 3(64), pp. 23-28. ISSN 1024-7696.
EXPORT metadate:
Google Scholar
Crossref
CERIF
BibTeX
DataCite
Dublin Core
Buletinul Academiei de Ştiinţe a Moldovei. Matematica
Numărul 3(64) / 2010 / ISSN 1024-7696

A heuristic algorithm for the two-dimensional single large bin packing problem

Pag. 23-28

Kotov Vladimir, Cao Dayong
 
Institute of Mathematics and Computer Science ASM
 
Disponibil în IBN: 7 decembrie 2013


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