Bul. Acad. Ştiinţe Repub. Mold. Mat., 2010, Number 3, Pages 23–28
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.
Keywords and phrases:
rectangular packing, heuristic, best-fit, concave corner, fitness value.
PDF file (118 kB)
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
Citation in format AMSBIB
\by V.~M.~Kotov, Dayong~Cao
\paper A heuristic algorithm for the two-dimensional single large bin packing problem
\jour Bul. Acad. \c Stiin\c te Repub. Mold. Mat.
Citing articles on Google Scholar:
Related articles on Google Scholar:
|Number of views:|