An efficient algorithm for irregular pattern nesting based on genetic algorithm and greedy strategy

Within various industrial settings, such as shipping, aeronautics, woodworking, and footwear, there exists a significant challenge: optimizing the extraction of sections from material sheets, a process known as “nesting”, to minimize wasted surface area. This paper investigates efficient solutions to complex nesting problems, emphasizing rapid computation over ultimate precision. We introduce a dual-approach methodology that couples both a greedy technique and a genetic algorithm. The genetic algorithm is instrumental in determining the optimal sequence for placing sections, ensuring each is located in its current best position. A specialized representation system is devised for both the sections and the material sheet, promoting streamlined computation and tangible results. By balancing speed and accuracy, this study offers robust solutions for real-world nesting challenges within a reduced computational timeframe.