基于最优同质块的分段式矩形优化排样

为有效解决企业实际生产中的矩形优化排样问题,对矩形优化算法进行研究,提出基于最优同质块的分段式矩形优化排样算法,有效解决了企业实际生产中的剪切排样问题。该算法首先使用剪床将板材剪成不同长度的子段,然后在子段上基于最优同质块进行优化排样。算法将板材的分段问题以及最优同质块在子段上的最优排样问题均转化为背包问题,并基于动态规划算法求解;使用枚举法求解最优同质块排样。将板材分成若干个子段使算法可以有效解决长板排样问题,使用最优同质块对子段进行优化排样使算法的优化性能得到提高。两组实例应用表明本文算法优于文献中的其他算法。

Rectangular optimal layout based on segments filled with optimal homogeneous blocks

To solve the problems of rectangles optimal layout effectively in practical production, the rectangular optimal algorithms were studied, and a rectangular optimal layout algorithm based on segments filled with optimal homogeneous blocks was proposed.So the problem of shear layout in practical production was solved effectively.Firstly, the sheet was cut into different sub-segments by the shearing machine, and then the sub-segments were nested by the optimal homogeneous blocks.Then, both the segmentation problem and the problem of optimal layout of optimal homogeneous blocks on sub-segments were translated into knapsack problems by the algorithm.Based on dynamic programming algorithm, the optimal layout of optimal homogeneous blocks was solved by enumeration algorithm.Therefore, the problems of long board layout were solved by the algorithm dividing the sheet into sub-segments, and the optimization performances of the algorithm were improved by optimizing the sub-segments layout based on optimal homogeneous blocks.Finally, two sets of application examples show that this algorithm is superior to other algorithms in the literature.