Meta-heuristic Algorithms for Nesting Problem of Rectangular Pieces

Nesting problems consist of placing multiple items onto larger shapes finding a good arrangement. The goal of the nesting process is to minimize the waste of material. It is common to assume, as in the present work, that the stock sheet has fixed width and infinite height, since in the real world a company may have to cut pieces from a roll of material.The complexity of such problems is often faced with a two-stage approach, so-called “hybrid algorithm”, combining a placement routine and a meta-heuristic algorithm. Starting from a given positioning sequence, the placement routine generates a non-overlapping configuration. The encoded solution is manipulated and modified by the meta-heuristic algorithm to generate a new sequence that brings to a better value of the objective function (in this case the height of the strip).The proposed method consists in placing the rectangles inside a strip and in combining the meta-heuristic algorithms with the No Fit Polygon algorithm. The software has been developed in Python language using proper libraries to solve the meta-heuristic techniques (Inspyred) and the geometric problems (Polygon).The results show the effectiveness of the proposed method; moreover, with regard to problems reported in literature employed as benchmark of the nesting algorithms, the degree of occupation values (Efficiency Ratio, ER) are shown to be higher than 90%.