Determination of cutting layout of two-dimensional patterns by genetic algorithms

Abstract

A new method is proposed to determining the cutting layout of two-dimensional patterns in a sheet by genetic algorithms (GA) to attain the minimum required length of the sheet. In applying the GAs to two-dimentional problems, if genes are designed to represent two-dimentional positions as normally adopted, required search spaces become wide, thus resulting in large calculation time. In the proposed method, since it becomes possible to deal the problem as an one-dimentional order one by incorporating layout determining algorithms (LDA) into GAs, the saving of the required calculation time is attained. The LDAs arrange each pattern on the sheet without opening and overlapping according to the order given by the GAs and return the required sheet length to the GAs. On the other hand the GAs determine the order to make the length minimum. The results of simulation show good performance.