|
Buletinul Academiei de Ştiinţe a Republicii Moldova. Matematica, 2010, номер 3, страницы 23–28
(Mi basm266)
|
|
|
|
Research articles
A heuristic algorithm for the two-dimensional single large bin packing problem
V. M. Kotova, Dayong Caob a Department of Applied Mathematics and Computer Science, Belarusian State University, Minsk, Belarus
b Department of Applied Mathematics, Harbin University of Science and Technology, Harbin, China
Аннотация:
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 literature. 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.
Ключевые слова и фразы:
rectangular packing, heuristic, best-fit, concave corner, fitness value.
Поступила в редакцию: 01.03.2010
Образец цитирования:
V. M. Kotov, Dayong Cao, “A heuristic algorithm for the two-dimensional single large bin packing problem”, Bul. Acad. Ştiinţe Repub. Mold. Mat., 2010, no. 3, 23–28
Образцы ссылок на эту страницу:
https://www.mathnet.ru/rus/basm266 https://www.mathnet.ru/rus/basm/y2010/i3/p23
|
|