基于最优子段的矩形优化排样

为有效解决企业实际生产中的矩形优化排样问题，对矩形优化排样算法进行研究， 给出基于最优子段的矩形优化排样算法，有效解决了企业实际生产中的长板矩形优化排样问题。 首先基于动态规划算法求出所有小于剪床刀刃长度的最优子段的最佳排样方式，然后以所求的最 优子段作为可用子段在长板上进行优化排样，并将矩形优化排样问题转化为完全背包问题。最后 基于分支定界技术的整数规划算法对其进行求解。企业应用实例表明该算法在解决长板矩形优化 问题方面优于其他算法。

Rectangular Optimal Layout Based on Best Sub Segments

To effectively solve the long board rectangular optimal layout problems which is often encountered in the actual production of enterprises, rectangular optimal layout algorithms were studied and a rectangular optimal layout algorithm based on the best sub segments was proposed, which effectively solve long board rectangular optimal layout problems in actual production. Firstly based on dynamic programming algorithm all sub optimal layout modes were solved which is less than the shear blade length. Secondly with the best sub segments as layout parts, these segments were optimized on the long board and the rectangular optimal layout problems were converted to knapsack problems completely. Finally the integer programming algorithm based on branch and bound technique was used to solve the long board rectangular optimal layout problems. Enterprise’s practical application showed that the algorithm in solving the long board rectangular optimization problems is better than other algorithms.