Authors: V.M.Kotov, Dayong Cao
Keywords: Rectangular packing, heuristic, best-fit, concave corner,
fitness value.
Abstract
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 prob-
lems, the algorithm could get satisfied results more quickly than other approaches in
literature.
Fulltext
–
0.12 Mb