首页 | 官方网站   微博 | 高级检索  
     

基于同质条带的两段式有约束矩形优化排样
引用本文:姜永亮,张亚敏.基于同质条带的两段式有约束矩形优化排样[J].锻压技术,2016(2):138-143.
作者姓名:姜永亮  张亚敏
作者单位:1. 海南师范大学 校园网络中心,海南 海口,571158;2. 漯河医学高等专科学校 计算机教研室,河南 漯河,462002
基金项目:国家自然科学基金资助项目,海南省重点科技基金资助项目,海南省自然科学基金资助项目,河南省基础与前沿技术研究计划资助项目
摘    要:为了有效解决企业生产中的有约束矩形优化排样问题,对矩形优化排样算法进行研究,在综合考虑原材料利用率及切割工艺复杂度的情况下,给出基于同质条带的两段式有约束矩形优化排样算法。算法首先通过问题转换,将有约束矩形优化排样问题转化成多重背包问题,然后再基于动态规划算法对其进行求解,最后基于动态规划算法开发了一应用系统,有效地解决了企业实际生产中的有约束矩形优化排样问题。实例应用表明,该算法在求解有约束矩形优化排样问题方面优于其他算法。

关 键 词:同质条带  两段式排样  动态规划算法  多重背包问题

Optimal layout of constrained rectangle based on two-segment homogeneous strips
Abstract:To effectively solve the optimal layout problem of constrained rectangle in the actual production, the rectangular optimal layout algorithms were studied. A constrained rectangle layout algorithm was put forward based on two-segment homogeneous strips and under the consideration of the utilization rate of raw materials and the cutting process complexity. Firstly, the algorithm was transferred from the con-strained rectangular optimal layout problem into the multiple knapsack problems. Then it was solved by dynamic programming algorithm, and a set of application system was developed finally. Therefore, the problem of constrained rectangle layout was solved in the actual pro-duction effectively. The application examples show that the algorithm is superior to other algorithms in solving the problem of constrained rectangle optimal layout.
Keywords:homogeneous strip  two-segment layout  dynamic programming algorithm  multiple knapsack problems
本文献已被 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号