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

发布时间：2018-06-15 00:54

本文选题：矩形优化排样 + 同质块　；参考：《锻压技术》2017年07期

【摘要】：为有效解决企业实际生产中的矩形优化排样问题,对矩形优化算法进行研究,提出基于最优同质块的分段式矩形优化排样算法,有效解决了企业实际生产中的剪切排样问题。该算法首先使用剪床将板材剪成不同长度的子段,然后在子段上基于最优同质块进行优化排样。算法将板材的分段问题以及最优同质块在子段上的最优排样问题均转化为背包问题,并基于动态规划算法求解;使用枚举法求解最优同质块排样。将板材分成若干个子段使算法可以有效解决长板排样问题,使用最优同质块对子段进行优化排样使算法的优化性能得到提高。两组实例应用表明本文算法优于文献中的其他算法。
[Abstract]:In order to effectively solve the problem of rectangular optimal layout in actual production of enterprises, the rectangular optimization algorithm is studied, and a segmented rectangular optimal layout algorithm based on optimal homogeneous blocks is proposed, which effectively solves the problem of shearing and layout in the actual production of enterprises. The algorithm first uses the shearing machine to cut the plate into sub-segments of different lengths, and then optimizes the layout on the subsegments based on the optimal homogeneous blocks. The algorithm transforms the piecewise problem of plate and the optimal layout problem of the optimal homogeneous block on the sub-segment into the knapsack problem and solves it based on the dynamic programming algorithm. The enumeration method is used to solve the optimal homogenous block layout problem. The algorithm can effectively solve the problem of long plate layout by dividing the plate into several sub-segments, and the optimization performance of the algorithm can be improved by using the optimal homogeneous block to optimize the layout of the sub-segment. Two groups of examples show that the proposed algorithm is superior to other algorithms in the literature.
【作者单位】：海南师范大学信息网络与数据中心;
【基金】：国家自然科学基金资助项目(71361008)
【分类号】：O224

【相似文献】