基于同质段矩形优化排样问题求解

为有效解决企业实际生产中的矩形优化排样问题,对矩形优化排样算法进行研究,给出基于同质段矩形优化排样问题的求解算法,该算法可同时有效解决企业实际生产中矩形优化排样的单一排样和套裁排样问题。算法首先基于隐式枚举法求出所有同质条带的最优排样及备选同质段,对备选同质段进行规范化处理求出所有的候选同质段,使用候选同质段将板材分成若干个子段,并将矩形优化排样问题转化为完全背包问题,最后基于动态规划算法进行求解。两组应用实例验证了本文算法的有效性。

Solution on rectangular optimal layout based on the homogeneous segments

In order to solve the problems of rectangular optimal layout effectively in practical production, the rectangular optimal layout algorithms were studied, and the solution algorithm was given based on the homogeneous segments.The above algorithm could effectively solve the single rectangular layout problem and suit cut layout in practical production.Firstly, based on the implicit enumeration method, the optimal layout of all homogeneous strips and the alternative homogeneous segments were calculated.Secondly, all the alternative homogeneous segments were normalized for the candidate homogeneous segments.After the sheet was divided into several subsections with the candidate homogeneous segments, the rectangular optimal layout problem was converted to the complete knapsack problem.Finally, a solution was obtained based on the dynamic programming algorithm.Furthermore, two sets of application examples validated the effectiveness of the algorithm.