论文部分内容阅读
为了有效解决企业实际生产中的长板矩形优化排样问题,对矩形优化排样算法进行了研究,给出了一个基于两阶分块式长板矩形优化排样算法,该算法在第一阶段完成长板的最佳分段,第二阶段完成矩形在子段上的最优排样。对于两个阶段分别通过问题转化,将二维矩形优化排样问题转化为背包问题,并建立相应的数学模型。根据所建立的数学模型并基于分支定界的动态规划算法开发的应用系统,解决了企业实际生产中的长板矩形优化排样问题。企业实际应用表明,该算法为求解长板矩形优化排样问题的有效方法。
In order to effectively solve the problem of long rectangular reusable nesting in actual production, the rectangular optimal nesting algorithm is studied, and a rectangular optimization nesting algorithm based on two-stage longboard slab is proposed. In the first stage Complete the best segment of the long board, the second stage to complete the rectangular sub-section of the optimal layout. For the two stages, the problems of two-dimensional rectangular layout are converted into knapsack problem through the problem transformation, and the corresponding mathematical model is established. According to the established mathematical model and based on the branch and bound dynamic programming algorithm developed application system to solve the actual production of long rectangular plate layout problems. The practical application shows that this algorithm is an effective method to solve the problem of rectangular plate layout optimization.