Dealing with Nonregular Shapes Packing

Abstract EN

This paper addresses the irregular strip packing problem, a particular two-dimensional cutting and packing problem in which convex/nonconvex shapes (polygons) have to be packed onto a single rectangular object.

We propose an approach that prescribes the integration of a metaheuristic engine (i.e., genetic algorithm) and a placement rule (i.e., greedy bottom-left).

Moreover, a shrinking algorithm is encapsulated into the metaheuristic engine to improve good quality solutions.

To accomplish this task, we propose a no-fit polygon based heuristic that shifts polygons closer to each other.

Computational experiments performed on standard benchmark problems, as well as practical case studies developed in the ambit of a large textile industry, are also reported and discussed here in order to testify the potentialities of proposed approach.