Abstract
In this paper the two-dimensional non-convex polygon packing problem is concerned. This problem is to place two-dimensional items into a larger bin. First, we propose a placement algorithm based on the BL (Bottom Left) algorithm. Next, we construct hybrid algorithms that search the placement order and directions by meta heuristics and determine the item placement by the proposed placement algorithm. Then, these are extended to the problems with item rotations permitted. Computational experiments show that our algorithms can obtain better solutions than the existing algorithms for a benchmark problem.
