<?xml version='1.0' encoding='utf-8'?>
<resource xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' xmlns='http://datacite.org/schema/kernel-3' xsi:schemaLocation='http://datacite.org/schema/kernel-3 http://schema.datacite.org/meta/kernel-3/metadata.xsd'>
<creators>
<creator>
<creatorName>Kotov, V.M.</creatorName>
<affiliation>Institutul de Matematică şi Informatică al AŞM, Moldova, Republica</affiliation>
</creator>
<creator>
<creatorName>Cao, D.</creatorName>
</creator>
</creators>
<titles>
<title xml:lang='en'>A heuristic algorithm for the two-dimensional single large bin packing problem</title>
</titles>
<publisher>Instrumentul Bibliometric National</publisher>
<publicationYear>2010</publicationYear>
<relatedIdentifier relatedIdentifierType='ISSN' relationType='IsPartOf'>1024-7696</relatedIdentifier>
<subjects>
<subject>Rectangular packing</subject>
<subject>heuristic</subject>
<subject>best-fit</subject>
<subject>concave corner</subject>
<subject>fitness value</subject>
</subjects>
<dates>
<date dateType='Issued'>2010-12-01</date>
</dates>
<resourceType resourceTypeGeneral='Text'>Journal article</resourceType>
<descriptions>
<description xml:lang='en' descriptionType='Abstract'>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.</description>
</descriptions>
<formats>
<format>application/pdf</format>
</formats>
</resource>