| Conţinutul numărului revistei |
| Articolul precedent |
| Articolul urmator |
 |
 748 3 |
| Ultima descărcare din IBN: 2022-01-04 23:10 |
 SM ISO690:2012KOTOV, 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 |
||||||
|
Dublin Core Export
<?xml version='1.0' encoding='utf-8'?> <oai_dc:dc xmlns:dc='http://purl.org/dc/elements/1.1/' xmlns:oai_dc='http://www.openarchives.org/OAI/2.0/oai_dc/' xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' xsi:schemaLocation='http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd'> <dc:creator>Kotov, V.M.</dc:creator> <dc:creator>Cao, D.</dc:creator> <dc:date>2010-12-01</dc:date> <dc:description xml:lang='en'>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.</dc:description> <dc:source>Buletinul Academiei de Ştiinţe a Republicii Moldova. Matematica 64 (3) 23-28</dc:source> <dc:subject>Rectangular packing</dc:subject> <dc:subject>heuristic</dc:subject> <dc:subject>best-fit</dc:subject> <dc:subject>concave corner</dc:subject> <dc:subject>fitness value</dc:subject> <dc:title>A heuristic algorithm for the two-dimensional single large bin packing problem</dc:title> <dc:type>info:eu-repo/semantics/article</dc:type> </oai_dc:dc>
|
|
|
