An adaptive meta-heuristic approach using partial optimization to non-convex polygons allocation problem

We consider a two-dimensional packing problem of non-convex polygons of different shapes on a sheet. The problem is thus how to determine positions for placing objects such that the waste is minimized. In order to solve this problem, we propose an adaptive meta-heuristics using partial optimization. This partial optimization algorithm makes subgroups of objects. Moreover, theses groups and non-grouped objects are allocated using adaptive meta-heuristics. This partial optimization algorithm determines the groups dynamically; therefore meta-heuristic search efficiency is improved. The performance of the proposed method is tested using simulation experiments. The result shows that this method is superior to the case when adaptive meta-heuristics alone are used.