A Better Nesting Algorithm for Rectangular Object Layout

Layout of rectangle parts has been widely used in various industries. During of cutting of two-dimensional(2-D) parts, a minimum wastage of materials is an important task. The research of optimizing cutting stock problem is to study how to generate cutting patters to improve material usage. On the basis of the Lowest Horizontal Ling-Search Algorithu(LHL-SA), an improved algorithm for rectangular packing problem is proposed in this paper. The proposed alaorithm can combine small waste areas that produced during the process of packing to large areas. And then use them, so it can improve the using ratio of material more efficiently. the size of each rectangle is compared with that of waste area, therefore better sequence and better location of each rectangle on the sheet can be obtained. The experimental results indicate that the improved algorithm is flexible and effective.