一个矩形件排样的较优算法

矩形件排样在工业上有广泛的应用,目标是使下料过程中的切割损失减少到最小,使得原材料的利用率最高.在矩形件排放算法——“基于最低水平线的搜索算法”的基础上,提出了一种改进的矩形优化排样算法,改进算法能够将小的空闲区域合并,然后加以利用,因此能够在一定程度上提高卷材的利用率.通过比较要排放矩形件的长宽与空闲区域的尺寸大小,最终确定矩形件的较优排放次序及矩形件在卷材上的确切排放位置.试验结果表明,改进算法在提高材料利用率方面具有可行性和有效性特征.

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.