| Conţinutul numărului revistei |
| Articolul precedent |
| Articolul urmator |
 |
 752 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 |
||||||
|
Crossref XML Export
<?xml version='1.0' encoding='utf-8'?> <doi_batch version='4.3.7' xmlns='http://www.crossref.org/schema/4.3.7' xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' xsi:schemaLocation='http://www.crossref.org/schema/4.3.7 http://www.crossref.org/schema/deposit/crossref4.3.7.xsd'> <head> <doi_batch_id>ibn-9092</doi_batch_id> <timestamp>1714252462</timestamp> <depositor> <depositor_name>Information Society Development Instiute, Republic of Moldova</depositor_name> <email_address>idsi@asm.md</email_address> </depositor> <registrant>Institutul de Matematică şi Informatică al AŞM</registrant> </head> <body> <journal> <journal_metadata> <full_title>Buletinul Academiei de Ştiinţe a Republicii Moldova. Matematica</full_title> <issn media_type='print'>10247696</issn> </journal_metadata> <journal_issue> <publication_date media_type='print'> <year>2010</year> </publication_date> <issue>3(64)</issue> </journal_issue> <journal_article publication_type='full_text'><titles> <title>A heuristic algorithm for the two-dimensional single large bin packing problem</title> </titles> <contributors> <person_name sequence='first' contributor_role='author'> <given_name>Vladimir</given_name> <surname>Kotov</surname> </person_name> <person_name sequence='additional' contributor_role='author'> <given_name>Dayong</given_name> <surname>Cao</surname> </person_name> </contributors> <publication_date media_type='print'> <year>2010</year> </publication_date> <pages> <first_page>23</first_page> <last_page>28</last_page> </pages> </journal_article> </journal> </body> </doi_batch>
|
|
|
