Packing of Polygons Using Genetic Simulated Annealing Algorithm

A heuristic approach to packing multiple shaped parts in an irregular sheet without orientation limitation is presented.The algorithm also provides a new way to represent the sheet and part geometry,that the irregularity of shape does not affect the computational complexity of problem. The proposed approach automatically looks for the best sequence of the shaped parts and each part’s optimum rotation by the genetic simulated annealing algorithm,and completes packing by the heuristic algorithm with the bottom-left-condition.The algorithm is discussed in detail.