| Conţinutul numărului revistei |
| Articolul precedent |
| Articolul urmator |
 |
 751 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 |
||||||
|
Google Scholar Export
<meta name="citation_title" content="A heuristic algorithm for the two-dimensional single large bin packing problem"> <meta name="citation_author" content="Kotov Vladimir"> <meta name="citation_author" content="Cao Dayong"> <meta name="citation_publication_date" content="2010/12/01"> <meta name="citation_journal_title" content="Buletinul Academiei de Ştiinţe a Republicii Moldova. Matematica"> <meta name="citation_volume" content="64"> <meta name="citation_issue" content="3"> <meta name="citation_firstpage" content="23"> <meta name="citation_lastpage" content="28"> <meta name="citation_pdf_url" content="https://ibn.idsi.md/sites/default/files/imag_file/A%20heuristic%20algorithm%20for%20the%20two_dimensional%20single%20large%20bin%20packing%20problem%2023_28.pdf">
|
|
|
