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

Kotov Vladimir; Cao Dayong

Conţinutul numărului revistei

Articolul precedent

Articolul urmator

747

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

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

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

Cerif XML Export

<?xml version='1.0' encoding='utf-8'?>
<CERIF xmlns='urn:xmlns:org:eurocris:cerif-1.5-1' xsi:schemaLocation='urn:xmlns:org:eurocris:cerif-1.5-1 http://www.eurocris.org/Uploads/Web%20pages/CERIF-1.5/CERIF_1.5_1.xsd' xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' release='1.5' date='2012-10-07' sourceDatabase='Output Profile'>
<cfResPubl>
<cfResPublId>ibn-ResPubl-9092</cfResPublId>
<cfResPublDate>2010-12-01</cfResPublDate>
<cfVol>64</cfVol>
<cfIssue>3</cfIssue>
<cfStartPage>23</cfStartPage>
<cfISSN>1024-7696</cfISSN>
<cfURI>https://ibn.idsi.md/ro/vizualizare_articol/9092</cfURI>
<cfTitle cfLangCode='EN' cfTrans='o'>A heuristic algorithm for the two-dimensional single large bin packing problem</cfTitle>
<cfKeyw cfLangCode='EN' cfTrans='o'>Rectangular packing; heuristic; best-fit; concave corner; fitness value</cfKeyw>
<cfAbstr cfLangCode='EN' cfTrans='o'>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.</cfAbstr>
<cfResPubl_Class>
<cfClassId>eda2d9e9-34c5-11e1-b86c-0800200c9a66</cfClassId>
<cfClassSchemeId>759af938-34ae-11e1-b86c-0800200c9a66</cfClassSchemeId>
<cfStartDate>2010-12-01T24:00:00</cfStartDate>
</cfResPubl_Class>
<cfResPubl_Class>
<cfClassId>e601872f-4b7e-4d88-929f-7df027b226c9</cfClassId>
<cfClassSchemeId>40e90e2f-446d-460a-98e5-5dce57550c48</cfClassSchemeId>
<cfStartDate>2010-12-01T24:00:00</cfStartDate>
</cfResPubl_Class>
<cfPers_ResPubl>
<cfPersId>ibn-person-33414</cfPersId>
<cfClassId>49815870-1cfe-11e1-8bc2-0800200c9a66</cfClassId>
<cfClassSchemeId>b7135ad0-1d00-11e1-8bc2-0800200c9a66</cfClassSchemeId>
<cfStartDate>2010-12-01T24:00:00</cfStartDate>
</cfPers_ResPubl>
<cfPers_ResPubl>
<cfPersId>ibn-person-33455</cfPersId>
<cfClassId>49815870-1cfe-11e1-8bc2-0800200c9a66</cfClassId>
<cfClassSchemeId>b7135ad0-1d00-11e1-8bc2-0800200c9a66</cfClassSchemeId>
<cfStartDate>2010-12-01T24:00:00</cfStartDate>
</cfPers_ResPubl>
</cfResPubl>
<cfPers>
<cfPersId>ibn-Pers-33414</cfPersId>
<cfPersName_Pers>
<cfPersNameId>ibn-PersName-33414-3</cfPersNameId>
<cfClassId>55f90543-d631-42eb-8d47-d8d9266cbb26</cfClassId>
<cfClassSchemeId>7375609d-cfa6-45ce-a803-75de69abe21f</cfClassSchemeId>
<cfStartDate>2010-12-01T24:00:00</cfStartDate>
<cfFamilyNames>Kotov</cfFamilyNames>
<cfFirstNames>Vladimir</cfFirstNames>
</cfPersName_Pers>
</cfPers>
<cfPers>
<cfPersId>ibn-Pers-33455</cfPersId>
<cfPersName_Pers>
<cfPersNameId>ibn-PersName-33455-3</cfPersNameId>
<cfClassId>55f90543-d631-42eb-8d47-d8d9266cbb26</cfClassId>
<cfClassSchemeId>7375609d-cfa6-45ce-a803-75de69abe21f</cfClassSchemeId>
<cfStartDate>2010-12-01T24:00:00</cfStartDate>
<cfFamilyNames>Cao</cfFamilyNames>
<cfFirstNames>Dayong</cfFirstNames>
</cfPersName_Pers>
</cfPers>
</CERIF>