期刊文献+

矩形毛坯匀质条带排样方式及其生成算法 被引量:5

Algorithm for Generating Normal Patterns of Homogenous Strips of Rectangular Items
在线阅读 下载PDF
导出
摘要 提出了匀质条带规范排样方式及其动态规划生成算法:从边界开始,逐段递推寻找优化排样方式。这种算法假定每一刀都从板材上切下1根水平或竖直的匀质条带,每根匀质条带中只含尺寸相同的毛坯,从而简化下料工艺。实验计算结果表明,和其他常见排样方式相比,使用匀质条带规范排样方式可提高材料利用率,计算时间能够满足实际应用需要。 This paper focuses on the unconstrained two-dimensional cutting discussion of rectangular items and shows how to make good use of material where the blank demand is unconstrained.Normal patterns of homogenous strips are proposed with the dynamic programming algorithm.Each cut made on the plate produces a homogenous strip either horizontal or vertical.A homogenous strip contains only items of the same type so as to simplify the cutting process.The computational results indicate that normal patterns of homogenous strips can yield better material utilization than that of other common pattern types,and the computation time is reasonable.
作者 黄玲 崔耀东
出处 《桂林理工大学学报》 CAS 北大核心 2010年第2期292-295,共4页 Journal of Guilin University of Technology
基金 国家自然科学基金项目(60763011) 广西科学基金项目(桂科自0728100)
关键词 两维切割 动态规划 匀质条带 CAD two-dimensional cutting dynamic programming algorithm homogenous strips CAD
  • 相关文献

参考文献10

  • 1崔耀东.生成矩形毛坯最优T形排样方式的递归算法[J].计算机辅助设计与图形学学报,2006,18(1):125-127. 被引量:22
  • 2廖元秀,崔耀东.对Agrawal单一矩形排样算法的改进与扩展[J].广西师范大学学报(自然科学版),2004,22(3):49-53. 被引量:6
  • 3Andrea Lodi,Michele Monaci.Integer linear programming models for 2-staged two-dimensional Knapsack problems[J]. Mathematical Programming . 2003 (2-3)
  • 4Mhand Hifi.Exact Algorithms for Large-Scale Unconstrained Two and Three Staged Cutting Problems[J]. Computational Optimization and Applications . 2001 (1)
  • 5Cui Y.Generating optimal T-shape cutting patterns for rectan-gular blanks. Journal of Engineering . 2004
  • 6Fayard D,Zissimopoulos V.An approximation algorithm forsolving unconstrained two-dimensional knapsack problems. European Journal of Operational Research . 1995
  • 7Cui Y,Huang L,He D.Generating optimal multiple-seg-ment cutting patterns for rectangular blanks. Proceedingsof the Institution of Mechanical Engineers,Part B:Journal ofEngineering Manufacture . 2004
  • 8Fayard D,Hifi M,Zissimopoulos V.An efficient approach for large-scale two-dimensional guillotine cutting stock problems. Journal of the Operational Research Society . 1998
  • 9Cui Y,He D,Song X.Generating optimal two-sectioncutting patterns for rectangular blanks. Computers&Op-erations Research . 2006
  • 10Cu i Y,W ang Z,L i J.Exact and heuristic a lgorithm sfor staged cu tting prob lem s. P roceed ings of theInstitu tion ofM echan ica l Eng ineers,Part B:Journa lof Eng ineering M anu facture . 2005

二级参考文献14

  • 1陶永根.改进开料工艺 提高钢材利用率[J].电机技术,1990(2):47-47. 被引量:1
  • 2Cheng C H,Feiring B R. Cutting stock problem-a survey[J]. International Journal of Production Economics, 1994,36(3) :291-305.
  • 3Ann Van Der Wilt. An algorithm for two-stage unconstrained guillotine cutting[J]. European Journal of Operational Research, 1995,84 (2): 494-498.
  • 4Scheithauer G ,Terno J. The G4-heuristic for the pallet loading problem[J]. Journal of the Operational Research Society, 1996,47 (4): 511-522.
  • 5Agrawal P K. Minimizing trim loss in cutting rectangular blanks of a single size form a rectangular sheet using ort hogonal guillotine cuts [J]. European Journal of Operational Research, 1993,64 (3): 410-422.
  • 6G Y-G, Kang M-K. A new upper bound for unconstrained two-dimensional cutting and packing [J]. Journal of the Operational Research Society, 2002, 53(5): 587-591.
  • 7Andonov R, Poirrez V, Rajopadhye S. Unbounded knapsack problem: Dynamic programming revisited [J], European Journal of Operational Research, 2000, 123(2): 394-407.
  • 8Valerio C J M. LP models for bin packing and cutting stock problems [J]. European Journal of Operational Research, 2002,141(2): 253-273.
  • 9崔耀东,周儒荣.单一尺寸矩形毛坯排样时长板的最优分割[J].计算机辅助设计与图形学学报,2001,13(5):434-437. 被引量:17
  • 10崔耀东,周儒荣,等.冲裁件有约束最优剪切方式的设计[J].数学的实践与认识,2001,31(2):177-184. 被引量:4

共引文献26

同被引文献42

  • 1曹炬,周济,余俊.矩形件排样优化的背包算法[J].中国机械工程,1994,5(2):11-12. 被引量:33
  • 2曹炬,周济.矩形件排样优化的一种近似算法[J].计算机辅助设计与图形学学报,1995,7(3):190-195. 被引量:57
  • 3崔耀东.生成矩形毛坯最优T形排样方式的递归算法[J].计算机辅助设计与图形学学报,2006,18(1):125-127. 被引量:22
  • 4Valerio D C J M. LP models for bin packing and cutting stock problems [J]. European Journal of Operational Research, 2002, 14:253 - 273.
  • 5Haessler R W. A note on computational modification to the Gilmore- Gomory cutting stock algorithm [J]. Operational Research, 1980, 28 (4) : 1001 -1005.
  • 6Cui Yo Heuristic and exact algorithms for generating homoge- nous constrained three-staged cutting patterns [J]. Computers Operations Research, 2008, 35 (1): 212-225.
  • 7Cui Y. Uniform block patterns for constrained guillotine cutting of rectangular items [J]. International Journal of Information and ManagementSeiences, 2009, 20 (1): 89-101.
  • 8Cui Y, Yang Yo A recursive branch-an&bound algorithm for constrained homogenous t-shape cutting patterns [J].Mathe- matical and Computer Modeling, 2011, 54 (5-6): 1320-1333.
  • 9Cui Y, Liu Z. T-shape homogenous block patterns for the two- dimensional cutting problem [J]. Journal of Global Optimiza- tion, 2008, 41 (2): 267-281.
  • 10崔耀东.计算机排样技术及其应用[M]北京:机械工业出版社,2004.

引证文献5

二级引证文献14

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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