锻压技术

带剪刃长度约束的圆形片二维优化下料算法

英文标题：Optimal algorithm of two dimensional cutting stock for circular pieces with blade length constraint

作者：管卫利王祺

单位：南宁学院河北金融学院

分类号：TP391

出版年,卷(期):页码：2018,43(3):176-180

摘要：

钣金制造企业经常采用剪冲工艺将金属板材剪冲出圆形片，用以生产各种零件，优良的下料算法可以提高板材的下料利用率。现提出一种带剪刃长度约束的圆形片下料算法，这种算法将板材分为4个块，每个块中包含相同长度和方向的条带，每个条带中包含同种圆形片。首先运用递归技术构造4块布局方式的无约束生成算法和有约束生成算法；然后采用线性规划算法迭代调用无约束布局算法，生成第1部分下料方案，采用顺序启发式算法顺序调用有约束布局算法，生成第2部分下料方案；最后，组合两部分下料方案形成最终下料方案。数值模拟实验结果表明，采用该下料算法板材利用率高于文献算法。

The shearing and punching processes are often applied in cutting sheet metal into circular pieces to produce various parts by sheet metal manufacturing enterprises, and the excellent cutting stock algorithm can improve the material utilization. Therefore, an algorithm of circular pieces cutting stock with blade length constraint was proposed. The plate was divided into four blocks by the algorithm, each block contained strips with the same length and direction, and each strip contained identical circular pieces. Firstly, unconstrained algorithm and constrained algorithm for the generation of four-block layout were constructed by the recursive technique, and the unconstrained layout algorithm was iteratively called by linear programming algorithm to generate a cutting plan of the first part. Then, constrained algorithm was orderly called by sequential heuristic algorithm to generate a cutting plan of the second part. Finally, the cutting plan of two parts were combined to form the final one. The results of numerical simulation experiments show that the sheet utilization rate of this algorithm is higher than that of the literature algorithm.

基金项目：

广西科学研究与技术开发计划(桂科攻12118017-10A)；广西高校科研项目（YB2014450）

作者简介：管卫利（1977-），男，硕士，副教授 E-mail：gwlnn2001@126.com 通讯作者：王祺（1983-），男，硕士，工程师 E-mail：wqjr96@126.com

参考文献：

［1］〖ZK(#〗Cui Y D. Generating optimal T-shape cutting patterns for circular blanks
［J］. Computers & Operations Research, 2005, 32(1): 143-152.

［2］Macedo R, Alves C, De Carvalho J M V. Arc-flow model for the two-dimensional guillotine cutting stock problem
［J］. Computers & Operations Research, 2010, 37(6): 991-1001.〖ZK）〗

［3］朱强，薛峰，郑仕勇，等. 约束二维排样问题的一种求解算法
［J］. 锻压技术, 2016, 41(9):148-152.
Zhu Q, Xue F, Zhen S Y, et al. An algorithm of the constrained two-dimensional nesting
［J］.Forging & Stamping Technology, 2016, 41 (9):148-152.

［4］苏兰. 冲裁条带三块排样方式的动态规划算法
［J］. 河南师范大学学报：自然科学版, 2014, 42(6):142-147.
Su L. Dynamic programming algorithm for three-block cutting patterns of punched strip
［J］.Journal of Henan Normal University: Natural Science Edition，2014，42 (6): 142-147.

［5］〖JP3〗曾兆敏, 管卫利, 潘卫平,等. 冲裁件条料最优四块剪切下料方案的生成算法
［J］. 计算机工程与应用, 2016, 52(20):75-79.〖JP〗
〖JP2〗Zeng Z M, Guan W L, Pan W P, et al. Algorithm for generating optimal four-block cutting stock patterns of punched strips
［J］. Computer Engineering and Applications, 2016, 52(20): 75-79. 〖JP〗

［6］王峰, 张军, 胡钢. 圆形片剪冲下料问题的一种求解算法
［J］. 锻压技术, 2015, 40(10): 39-44.
Wang F, Zhang J, Hu G. An algorithm for solving the shearing problem of circular blanks
［J］. Forging & Stamping Technology, 2015, 40(10): 39-44.

［7］侯桂玉, 崔耀东, 黄少丽, 等. 一种求解圆形件下料问题的启发式算法
［J］. 计算机工程, 2010, 36(13): 227-229.
Hou G Y, Cui Y D, Huang S L, et al. Heuristic algorithm for cutting stock problem of circular item
［J］.Computer Engineering, 2010, 36(13): 227-229.

［8］陈燕, 谢琪琦, 刘咏, 等. 圆形件下料顺序分组启发式算法的设计与实现
［J］. 图学学报, 2017, 38(1): 5-9.
Chen Y, Xie Q Q, Liu Y, et al. The cutting stock problem of circular items based on sequential grouping heuristic algorithm
［J］. Journal of Graphics, 2017, 38(1): 5-9.

［9］ Gliozzi S, Castellazzo A, Fasano G. A Container Loading Problem MILP-based Heuristics Solved by CPLEX: An Experimental Analysis
［M］. Berlin: Springer International Publishing, 2015.

［10］季君. 基于同形块的剪切下料布局算法研究
［D］. 北京：北京交通大学, 2012.
〖JP4〗Ji J. Research on Guillotine Cutting Stock Packing Algorithm Based on Same-shape Block
［D］. Beijing: Beijing Jiaotong University，2012. 〖JP〗

［11］ Furini F, Malaguti E, Durán R M, et al. A column generation heuristic for the two-dimensional two-staged guillotine cutting stock problem with multiple stock size
［J］. European Journal of Operational Research, 2012, 218(1): 251-260.

服务与反馈：

【本网站尚未开通全文下载服务】【加入收藏】