期刊文献+

考虑余料生成及利用的圆片下料算法 被引量:8

An algorithm of circular piece cutting stock considering generation and utilization of margin
原文传递
导出
摘要 针对圆片下料问题,从简化切割工艺的角度来考虑提高下料利用率,提出一种考虑余料生成及利用的圆片下料算法,并以企业长期消耗的板材总面积最小为目标进行优化。该算法采用考虑主动生成余料的直切布局图组成下料方案,产生的余料库存应用于计划期内的连续生产当中。首先,运用动态规划与枚举结合的方法生成布局图,在生成布局图时可以主动生成规范的余料,并通过上限约束保持合理的余料库存量;然后,采用顺序价值修正启发式算法得到最终的下料方案。长期生产的实验结果表明,该算法时间合理,与文献方法相比,应用本文下料算法可较明显地降低生产成本。 For the problem of circular piece cutting stock,considering the improvement of cutting efficiency from the perspective of simplifying the cutting process,a circular piece cutting stock algorithm considering the generation and utilization of margin was proposed,and the optimization with the target of minimizing the total area of sheets used by the enterprise for long term production was conducted.The algorithm adopted a cutting stock scheme of one-pass layout pattern which took into account the active generation of margin,and the generated margin inventory was used in the continuous production during the planning period.Firstly,the dynamic programming and the enumeration method were combined to generate the layout pattern.When generating the layout pattern,the normative margin could be actively generated,and the reasonable margin inventory was maintained by the upper bound constraint.Then,the final cutting stock scheme was obtained by the sequential value correction heuristic algorithm.The experimental results of long term production show that the algorithm is reasonable in time,and compared with the literature method,the application of the above cutting stock algorithm can significantly reduce the production cost.
作者 王婷婷 崔耀东 陈燕 王睿 Wang Tingting;Cui Yaodong;Chen Yan;Wang Rui(School of Computer,Electronics and Information,Guangxi University,Nanning 530004,China;School of Business Administration,South China University of Technology,Guangzhou 510640,China)
出处 《锻压技术》 CAS CSCD 北大核心 2019年第4期40-47,共8页 Forging & Stamping Technology
基金 国家自然科学基金资助项目(71371058 61363026)
关键词 圆片下料 余料 库存 布局图 动态规划 顺序价值修正 circular piece cutting stock margin inventory layout pattern dynamic programming sequential value correction
  • 相关文献

参考文献8

二级参考文献46

  • 1崔耀东,黄健民,张显全.矩形毛料无约束二维剪切排样的递归算法[J].计算机辅助设计与图形学学报,2006,18(7):948-951. 被引量:15
  • 2Cui Yaodong.Generating Optimal T-shape Cutting Patterns for Circular Blanks[J].Computers & Operations Research,2005,32(1):143-152.
  • 3Gilmore P C,Geomory R E.The Theory and Computation of Knapsack Functions[J].Operations Research,1966,14(5):849-859.
  • 4Cui Yaodong.Generating Optimal T-shape Cutting Patterns for Circular Btanks[J].Computers & Operations Research,2005,32(1):143-152.
  • 5Cui Yaodong.Generating Optimal Multi-segment Cutting Patterns for Circular Blanks in the Manufacturing of Electric Motors[J].European Journal of Operational Research,2006,169(1):30-40.
  • 6Cui Yaodong,Wang Qiang.Exact and Heuristic Algorithms for the Circle-cutting Problem in the Manufacturing Industry of Electric Motors[J].Journal of Combinatorial Optimization,2007,14(1):35-44.
  • 7Haessler R W.Controlling Cutting Pattern Changes in Onedimensional Trim Problems[J].Operations Research,1975,23(3):483-493.
  • 8Mukhacheva E A,Zalgaller V A.Linear Programming for Cutting Problems[J].International Journal of Software Engineering and Knowledge Engineering,1993,3(4):463-477.
  • 9Belov G,Scheithauer G.Setup and Open Stacks Minimization in One-dimensional Stock Cutting[J].INFORMS Journal on Computing,2007,19(1):27-35.
  • 10Cui Yao-dong,Wang Qiang.Exact and heuristic algorithms for the circle cutting problem in the manufacturing industry of elec-tric motors[J].Journal of Combinatorial Optimization,2007,14(1):35-44.

共引文献31

同被引文献48

引证文献8

二级引证文献9

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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