网站首页期刊简介编委会过刊目录投稿指南广告合作征订与发行联系我们English
基于顺序价值修正算法的矩形件二维优化下料
英文标题:Two-dimensional optimum blanking of rectangular parts based on sequential value correction algorithm
作者:李荣科 王佳 
单位:广西职业技术学院 河北金融学院 
关键词:二维下料问题 四块排样方式 顺序价值修正 矩形件 递归算法 
分类号:TP391
出版年,卷(期):页码:2018,43(2):0-0
摘要:

 针对矩形件二维下料问题,提出一种顺序价值修正下料算法。构造了四块排样算法,生成矩形件数量有上界约束的四块排样方式;这种排样方式将板材划分为4个块,每个块包含方向相同的条带,每条条带包含同种矩形件。采用顺序启发式算法调用上述四块排样算法逐个生成排样方式,按照不产生多余矩形件原则,确定每个排样方式的最大使用次数;在生成每个排样方式后修正该种排样方式中矩形件的价值。将上述顺序启发式算法迭代执行多次,生成多个下料方案,选择板材使用张数最小的一个作为最终解。采用文献例题进行计算比较,数值实验结果表明本文算法比文献算法更能节省板材。

 For the problem of two-dimensional blanking of rectangular part, a sequential value correction blanking algorithm was proposed. Then, four-block nesting algorithm was constructed, and four-block nesting mode with upper bound on the number of rectangular parts was generated. Based on this pattern, the plate was divided into four blocks with each block contained strips of the same direction and each strip contained identical rectangular parts. Therefore, the four-block nesting algorithm was applied by the sequential heuristic algorithm to generate the nesting one by one. Under the condition of avoiding redundant rectangular parts,the maximum using times of each nesting mode were determined, and the value of rectangle in this nesting method was corrected after each nesting method was generated. Furthermore, the above sequential heuristic algorithm was iteratively executed multiple times to generate multiple blanking schemes, and the one with the least number of blanks was chosen as the final solution. Compared with the literature example, the results of numerical experiments show that the above algorithm saves blanks more than the literature algorithms.

基金项目:
广西高校中青年教师基础能力提升资助项目(2017KY0980,KY2016LX495,KY2016YB610)
作者简介:
作者简介:李荣科(1977-),男,硕士,高级工程师 E-mail:rkgx2009@163.com
参考文献:

 
[1]Wuttke D A, Heese H S. Two-dimensional cutting stock problem with sequence dependent setup times
[J]. European Journal of Operational Research, 2018, 265(1): 303-315.


 


[2]Andrade R, Birgin E G, Morabito R. Two-stage two-dimensional guillotine cutting stock problems with usable leftover
[J]. International Transactions in Operational Research, 2016, 23(1-2): 121-145.

 


[3]扈少华, 潘立武, 管卫利. 复合条带三阶段排样方式的生成算法
[J]. 锻压技术, 2016, 41(11): 149-152.

 

Hu S H,Pan L W,Guan W L. A generating algorithm of three-stage nesting patterns for composite strip
[J].Forging & Stamping Technology, 2016, 41(11): 149-152.

 


[4]Cui Y. Generating optimal T-shape cutting patterns for rectangular blanks
[J]. Proceedings of the Institution of Mechanical Engineers, Part B: Journal of Engineering Manufacture, 2004, 218(8): 857-866.

 


[5]易向阳, 仝青山, 潘卫平. 矩形件二维下料问题的一种求解方法
[J]. 锻压技术, 2015, 40(6): 150-154.

 

Yi X Y, Tong Q S, Pan W P. A solving method of two-dimensional cutting for the rectangular blanks
[J].Forging & Stamping Technology, 2015, 40(6):150-154.

 


[6]黄少丽, 杨剑, 侯桂玉,等. 解决二维下料问题的顺序启发式算法
[J]. 计算机工程与应用, 2011, 47(13):234-237.

 

Huang S L,Yang J,Hou G Y,et al. Sequential heuristic algorithm for two-dimensional cutting stock problem
[J].Computer Engineering and Applications,2011, 47(13):234-237.

 


[7]朱强, 薛峰, 郑仕勇,等. 约束二维排样问题的一种求解算法
[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.

 


[8]Cui Y P, Cui Y, Tang T, et al. Heuristic for constrained two-dimensional three-staged patterns
[J]. Journal of the Operational Research Society, 2015, 66(4): 647-656.

 


[9]Belov G, Scheithauer G. Setup and open-stacks minimization in one-dimensional stock cutting
[J]. Informs Journal on Computing, 2007, 19(1): 27-35.

 


[10]Belov G, Scheithauer G, Mukhacheva E A. One-dimensional heuristics adapted for two-dimensional rectangular strip packing
[J]. Journal of the Operational Research Society, 2008, 59(6): 823-832.
服务与反馈:
本网站尚未开通全文下载服务】【加入收藏
《锻压技术》编辑部版权所有

中国机械工业联合会主管  中国机械总院集团北京机电研究所有限公司 中国机械工程学会主办
联系地址:北京市海淀区学清路18号 邮编:100083
电话:+86-010-82415085 传真:+86-010-62920652
E-mail: fst@263.net(稿件) dyjsjournal@163.com(广告)
京ICP备07007000号-9