Genetic Algorithms for the Nesting Problem in the Packing Industry

— The problem of parts nesting in plane areas is found in several industries, with restrictions and different objectives. Among these industries having this process they are packings and clothes industries, which use irregulars parts as concave and convex ones. A peculiarity of the packing industry is the frequent use of an only part type for each nesting process. This article uses genetic algorithms (GA) and heuristical rules to solve the nesting problem. The results are also presented and discussed.

• Type: Conference
• Year: 2007
• Where: IMECS
• Authors: Roberto Selow, Flavio Neves Junior, Heitor S. Lopes
• Keywords: Clothes Industries, IMECS 2007, Nesting Process, Plane Areas, Theoretical Computer Science