期刊文献+

复合条带三阶段排样方式的生成算法 被引量:8

A generating algorithm of three-stage nesting patterns for composite strip
在线阅读 下载PDF
导出
摘要 提出复合条带三阶段排样方式用以解决无约束二维剪切排样问题。该排样方式用3个阶段将板材切割成毛坯,首先用水平刀具将板材切成复合条带,然后用竖直刀具将复合条带切成初始毛坯,最后用水平刀具将初始毛坯切成具有精确尺寸的毛坯。采用背包算法生成该种排样方式,该算法求解两个背包模型分别生成条带在板材中的布局和毛坯在复合条带中的布局。采用文献中基准测题,将文中排样方式与文献中5种重要的排样方式进行比较。实验结果表明,文中复合条带三阶段排样方式平均排样价值高于以上5种排样方式,且切割工艺比较简单。 The three-stage nesting patterns for composite strip were proposed to solve the unconstrained two-dimensional nesting problem.Plate was cut into rectangular blanks through three stages. Firstly,the plate was cut into composite strips by the horizontal cutter,then it was cut into initial blanks by the vertical cutter. Finally,the initial blank was cut into exact size blank by the horizontal cutter. The threestage nesting patterns for composite strip were generated by Knapsack algorithm,which solved two knapsack models to generate the layout of strips in plate and blanks in strip. The patterns were tested through benchmark problems in literature,and compared with five important patterns in literature. The experimental results show that the average value of three-stage nesting patters for composite strip is higher than that of the above five patterns,and the cutting process is relatively simple.
作者 扈少华 潘立武 管卫利 Hu Shaohua Pan Liwu Guan Weili(Department of Automation and Control, Henan University of Animal Husbandry & Economy, Zhengzhou 450011, China Information Engineering College, Nanning University, Nanning 530200, China)
出处 《锻压技术》 CAS CSCD 北大核心 2016年第11期149-152,共4页 Forging & Stamping Technology
基金 河南省科技攻关计划项目(142102210607) 广西科学研究与技术开发计划(桂科攻11107006-13 桂科攻12118017-10A)
关键词 剪切排样 复合条带 三阶段排样方式 背包算法 板材切割 cutting nesting composite strip three-stage nesting patterns knapsack algorithm plate cutting
作者简介 扈少华(1978-),男,硕士,讲师E-mail:hshhnmy@163.com 通讯作者:管卫利(1979-),男,硕士,副教授E-mail:plgh2361@163.com
  • 相关文献

参考文献2

二级参考文献23

  • 1崔耀东.生成矩形毛坯最优T形排样方式的递归算法[J].计算机辅助设计与图形学学报,2006,18(1):125-127. 被引量:22
  • 2Wischer G,HauBner H,Schumann H.An improved typology of cutting and packing problems[J].European Journal of Operational Research,2007,183(3):1109-1130.
  • 3Cui Yaodong.Heuristic for the cutting and purchasing decisions of multiple metal coils[J].Omega,2014,46:117-125.
  • 4Furini F,Malaguti E.Models for the two-dimensional two-stage cutting stock problem with multiple stock size[J].Computers & Operations Research,2013,40(8):1953-1962.
  • 5Cui Yaodong.A new dynamic programming procedure for three-staged cutting patterns[J].Journal of Global Optimization,2013,55(2):349-357.
  • 6Wang Z,Li J,Cui Y.Exact and heuristic algorithms for staged cutting problems[J].Proceedings of the Institution of Mechanical Engineers,Part B:Journal of Engineering Manufacture,2005,219(2):201-207.
  • 7Alvarez-Valdés R,Parajón A,Tamarit J M.A tabu search algorithm for large-scale guillotine (un) constrained two-dimensional cutting problems[J].Computers & Operations Research,2002,29(7):925-947.
  • 8Cui Yaodong,He Dongli,Song Xiaoxia.Generating optimal two-section cutting patterns for rectangular blanks[J].Computers & Operations Research,2006,33(6):1505-1520.
  • 9Malaguti E, Medina Duren R, Toth P. Approaches to real world two-dimensional cutting problems [ J ]. Omega, 2014, (47) : 99 - 115.
  • 10Hifi M. Exact algorithms for large-scale unconstrained two and three staged cutting problems [ J ]. Computational Optimization and Applications, 2001, 18 (1) : 63 -88.

共引文献42

同被引文献36

引证文献8

二级引证文献29

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部