网站首页期刊简介编委会过刊目录投稿指南广告合作征订与发行联系我们English
减少切割成本的圆形件下料优化算法
英文标题:Optimization algorithm of blanking for circular part with reduced cutting costs
作者:王珂 胡小春 陈燕 农英雄 蒋志一 
单位:广西大学 广西财经学院 广西多媒体通信与网络技术重点实验室(广西大学) 
关键词:条带数量 T形结构 圆形件 下料 动态规划 顺序价值修正 
分类号:TP391
出版年,卷(期):页码:2021,46(1):50-55
摘要:

 针对圆形件下料问题,从减少条带数量的角度考虑降低下料总成本,提出一种基于顺序价值修正的启发式下料算法。一个下料方案由一个或多个排样方式组成,每个排样方式均采用T形结构布局。T形结构用一条分界线将板材为两段,同一段中所有条带的方向相同、长度相等。首先,根据所需的不同圆形件直径确定所有的断点长度,再将其代入排样方式生成函数,分别采用动态规划算法和递推算法确定T形排样方式两段中的条带最优组合和最佳断点长度,最后,采用顺序价值修正启发式算法得到最终的下料方案。实验计算结果表明,此优化算法可有效地减少下料方案的条带数量,从而减少企业下料的切割成本。

 For the blanking issue of circular parts, a heuristic blanking algorithm based on sequential value correction was presented for reducing the total cost of blanking from the perspective of reducing the number of strips. Then, a blanking plan consisted of one or more layout methods, each of which used a T-shaped structure layout. Meanwhile, the T-shaped structure was that using a dividing line divided the plate into two sections, and all the strips in the same section were set to the same direction and the same length. First, all the breakpoint lengths were determined according to the required circular part with different diameters, and then they were substituted into the generate function of layout method. Next, the optimal combination of strips and the optimal breakpoint length in the two sections of T-shape layout method were determined by the dynamic programming algorithm and the recursive algorithm respectively. Finally, the final blanking plan was obtained by the sequential value correction heuristic algorithm. The experimental calculation results show that the optimization algorithm effectively reduces the number of strips for the blanking plan to reduce the blanking cost of enterprise.

 
基金项目:
基金项目:国家自然科学基金资助项目(713710586);广西自然科学基金资助项目(2020GXNSFAA159090);广西中烟工业有限责任公司科研项目(201945000030054)
作者简介:
作者简介:王珂(1994-),男,硕士 E-mail:wangke123@st.gxu.edu.cn 通讯作者:陈燕(1975-),女,博士,教授 E-mail:cy@gxu.edu.cn
参考文献:

 [1]崔耀东. 计算机排样技术及其应用[M]. 北京:机械工业出版社, 2004. 


Cui Y D. Computer Layout Technology and Its Application[M]. Beijing: China Machine Press, 2004.

[2]An L L, Xue Q. Lowcarbon economy and ecodesign of commodity packing[J]. Computer Aided Drafting, Design and Manufacturing, 2011, 21(1): 52-55. 

[3]王婷婷, 崔耀东, 陈燕,等. 考虑余料生成及利用的圆片下料算法[J]. 锻压技术, 2019, 44(4): 40-47. 

Wang T T, Cui Y D, Chen Y, et al. An algorithm of circular piece cutting stock considering generation and utilization of margin[J]. Forging & Stamping Technology, 2019, 44(4): 40-47. 

[4]Cui Y, Xu D Y. Strips minimization in twodimensional cutting stock of circular items [J]. Computers & Operations Research, 2010, 37(4): 621-629.

[5]陈燕, 谢琪琦, 刘咏,等. 圆形件下料顺序分组启发式算法的设计与实现[J]. 图学学报, 2017, 38(1): 5-9. 

Chen Y, Xie Q Q, Liu Y, et al. The cutting sock problem of circular items based on sequential crouping heuristic algorithm [J]. Journal of Graphics, 2017, 38(1): 5-9.

[6]许雁杰, 陈秋莲, 陈燕, 等. 二维下料问题的顺序按叠分组启发式算法[J]. 锻压技术, 2020, 45(9): 45-50.

Xu Y J, Chen Q L, Chen Y, et al. Optimized cutting method of coil for processability. [J]. Forging & Stamping Technology, 2020, 45(9): 45-50.

[7]王岩, 潘卫平, 张俊晖. 多板材单一圆片剪冲下料的一种优化算法[J]. 机械设计与制造, 2015,(6): 42-44,48. 

Wang Y, Pan W P, Zhang J H. An algorithm for the cutting stock problem of make multiple plate into single wafer[J]. Machinery Design & Manufacture, 2015,(6): 42-44,48.

[8]侯桂玉, 崔耀东, 黄少丽,等. 一种求解圆形件下料问题的启发式算法[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.

[9]李秋蓉, 崔耀东, 罗丹. 考虑切割刀数的T形排样算法研究[J]. 计算机应用与软件, 2013, 30(3): 28-29,138. 

Li Q R, Cui Y D, Luo D. Research on the algorithm of Tshape cutting patterns with cuts number consideration[J]. Computer Applications and Software, 2013, 30(3): 28-29,138. 

[10]黎凤洁, 崔耀东, 陈秋莲. 面向可加工性的卷材优化下料方法[J]. 锻压技术, 2020, 45(2): 67-72.

Li F J,Cui Y D,Chen Q L. Optimized cutting method of coil for processability. [J]. Forging & Stamping Technology, 2020, 45(2): 67-72.

[11]崔耀东. 生成矩形毛坯最优T形排样方式的递归算法[J]. 计算机辅助设计与图形学学报, 2006, (1): 125-127. 

Cui Y D. Recursive algorithm for generating optimal Tshape cutting patterns of rectangular blanks[J]. Journal of ComputerAided Design & Computer Graphics, 2006,(1): 125-127. 

[12]Cui Y P, Cui Y D, Tang T B. Sequential heuristic for the twodimensional binpacking problem [J]. European Journal of Operational Research, 2015, 240(1): 43-53. 

[13]陈燕. 考虑可用余料的下料问题解法研究[D]. 广州:华南理工大学, 2019. 

Chen Y. Research on the Solution Methods of the Cutting Stock Problems with Usable Leftovers [D]. Guangzhou: South China University of Technology, 2019. 
服务与反馈:
本网站尚未开通全文下载服务】【加入收藏
《锻压技术》编辑部版权所有

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