锻压技术

面向可加工性的卷材优化下料方法

英文标题：Optimized cutting method of coil for processability

作者：黎凤洁崔耀东陈秋莲

单位：广西大学

分类号：TP391

出版年,卷(期):页码：2020,45(2):67-72

摘要：

针对成品为矩形件的卷材优化下料问题，综合考虑材料利用率高和便于加工，将顺序价值修正算法与剪切排样方式生成算法结合，确定下料方案。第1阶段，将卷材纵剪为长条带（子卷），每根条带含同一种矩形件；第2阶段，将条带冲剪出矩形件。剪切排样方式生成算法通过递推生成排样方式。每次生成排样方式后，均对矩形件进行一次价值修正，使其价值接近理想值。每个排样方式满足部分矩形件需求，重复此过程，直到满足所有矩形件需求为止。通过迭代生成不同下料方案，选择材料利用率最高的作为解。与文献算法比较，可知该算法在有效提高材料利用率的同时，可以简化切割加工工艺。

For the problem of coil optimized cutting for rectangular piece, the high material utilization rate and the convenience of processing were taken into comprehensive consideration, the cutting plan was determined by combining the sequential value correction algorithm with the cutting layout generation algorithm. In the first stage, the coil was cut into long strips (sub-coils), and each strip contained the same rectangular pieces. Then, the sub-coils were cut into rectangular pieces in the second stage. Furthermore, the cutting layout generation algorithm determined the layout through recursion, and the values of the rectangular pieces were corrected after the generation of each layout to close to ideal value. Each layout met the requirement of some rectangular pieces, and this process was repeated untill all the rectangular pieces were satisfied. In the addition, the different cutting plans were obtained through iteration, and the plan with the maximum material utilization rate was selected as the solution. Compared with published algorithms, the proposed algorithm indicates that it can improve the material utilization rate and simplify the cutting process.

基金项目：

国家自然科学基金资助项目（71371058,61363026）

黎凤洁（1993-），女，硕士研究生，E-mail：786631935@qq.com；通讯作者：陈秋莲（1974-），女，副教授，硕士生导师，E-mail：474822562@qq.com

参考文献：

[1]赵新芳, 崔耀东,杨莹,等.矩形件带排样的一种遗传算法[J].计算机辅助设计与图形学学报,2008,20（4）：540-544.
Zhao X F, Cui Y D, Yang Y, et al. A genetic algorithm for the rectangular strip packing problem[J].Journal of Computer-Aided Design & Computer Graphics,2008,20(4):540-544.
[2]姚怡,吴金春,赖朝安.采用分层搜索填充策略的启发式带排样算法[J].武汉大学学报:工学报,2014,47（6）：854-858.
Yao Y, Wu J C, Lai C A. Heuristics for rectangular strip packing problem based on hierarchical search filled strategy[J]. Engineering Journal of Wuhan University,2014,47（6）：854-858.
[3]李霞, 陈弦. 一种启发式矩形毛坯带排样算法研究[J].山西大学学报:自然科学版,2011,34（2）：215-218.
Li X, Chen X. Heuristic algorithm for the rectangular strip packing problem[J]. Journal of Shanxi University: Natural Science Edition, 2011,34(2):215-218.
[4]朱强,薛峰,李碧青.硅钢卷材二维剪切下料问题的一种求解算法[J].变压器,2018,55（3）：18-20.
Zhu Q, Xue F, Li B Q. An algorithm for 2D guillotine cutting stock problem of silicon steel coil[J].Transformer,2018,55(3):18-20.
[5]Cui Y D.Heuristic for the cutting and purchasing decisions of multiple metal coils[J].Omega，2014,46（3）：117-125.
[6]Horacio Hideki Yanasse, Marcelo Saraiva Limeira. A hybrid heuristic to reduce the number of different patterns in cutting stock problems[J].Computers & Operations Research，2006,33（9）：2744-2756.
[7]Cintra G F, Miyazawa F K, Wakabayashi Y, et al. Algorithms for the two-dimensional cutting stock and strip packing problems using dynamic programming and column generation[J]. European Journal of Operational Research, 2008，191 (1):61-85.
[8]阎春平,宋天峰,刘飞.面向可加工性的复杂状态下一维优化下料[J].计算机集成制造系统,2010,16（1）：195-201.
Yan C P, Song T F, Liu F. Manufacturability-oriented one-dimensional cutting-stock problem under complex constraints status[J].Computer Integrated Manufacturing Systems,2010,16(1):195-201.
[9]吴电建,阎春平,李俊,等.面向可加工性的矩形件优化下料方法[J].计算机集成制造系统,2018,24（6）：1374-1382.
Wu D J, Yan C P, Li J, et al. Manufacturability-oriented rectangular parts cutting stock method[J].Computer Integrated Manufacturing Systems,2018,24(6):1374-1382.
[10]Cui Y D, Song X X. Applying parallelogrammic strips for cutting circles from stainless steel rolls[J]. Journal of Materials Processing Technology，2008, (205):138-145.
[11]青巧,吴红乐，管卫利.圆形件卷材排样问题的启发式优化算法[J].锻压技术,2018,43（4）：175-179.
Qing Q,Wu H L,Guan W L.Heuristic optimization algorithms of coiled material layout for circular parts[J].Forging & Stamping Technology,2018,43(4):175-179.
[12]Belov G. Setup and open-stacks minimization in one-dimensional stock cutting[J]. Informs Journal on Computing, 2007, 19(1): 27-35.
[13]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.

服务与反馈：

【文章下载】【加入收藏】