期刊文献+

同直径圆形片条带剪切排样的递归算法 被引量:4

Recursive Algorithm for Generating Cutting Patterns of Equal Circles
下载PDF
导出
摘要 采用简单的多级排样方式和递归方法,提出一种新的解决同直径圆形片条带剪切排样问题的递归算法,并用该算法对251块相同的板材,取不同的毛坯直径进行计算机模拟实验。计算可得使用多级排样方式时平均计算时间为0.067s,平均下料利用率为72.84%,比用单一X向级排样方式提高1.23%,比用单一Y向级排样方式提高2.01%。该算法在计算时间和提高下料利用率方面都比较有效,可以用于指导生产实践。 This paper presents a recursive algorithm by means of the multi-section patterns that are simpler to cut,and it generates a strip cutting patterns of equal circular blanks.Using this algorithm we take a calculation diameter simulated experiment 251 plates which are different in diameter.The computational results indicate that the multi-section patterns have a material usage of 72.84% and the average computation time is 0.067s.Compared with X-direction layout,it increases by 1.23%,and for Y-direction layout by 2.01%.This algorithm is efficient both in material usage and in computation time,and can be used to guide practice.
出处 《广西科学院学报》 2007年第4期232-234,共3页 Journal of Guangxi Academy of Sciences
基金 国家自然科学基金项目(60763011) 广西科学基金项目(桂科自0728100)资助
关键词 两维切割 切割下料 圆形毛坯 递归算法 two-dimensional cutting,cutting stock,circular blanks,recursive algorithm
  • 相关文献

参考文献3

  • 1STOYAN Y G,YASKOV G N.Mathematical model and solution method of optimization problem of placement of rectangles and circles taking into account special constraints[J].International Transactions on Operational Research,1998(5):45-57.
  • 2CUI YAODONG.Generating optimal T-shape cutting patterns for circular blanks[J].Computers & Operations Research,2005(32):143-152.
  • 3RICHARD LORENTZ.Recursive algorithms[M].New Jersey:Ablex Publishing Corporation,1994.

同被引文献34

  • 1Cui Yao-dong,Huang Bai-xiong.A heuristic for constrained t-shape cutting patterns of circular items[J] .Engineering Optimization,2011,43(8):867-877.
  • 2Dowsland K A,Gilbert M,Kendall G.A local search approach to a circle cutting problem arising in the motor cycle industry[J] .Journal of the Operational Research Society,2007,58(4):429-438.
  • 3Ignacio Castillo,Frank J.Kampas,János D.Pintér.Solving circle packing problems by global optimization:numerical results and industrial applications[J] .Eur J Oper Res,2007,191(3):786-802.
  • 4Hifi M,M'hallah R.A literature review on circle and sphere packing problems:Models and methodologies[J] .Advances in Operations Research,2009.
  • 5Cui Y,Xu D.Strips minimization in two dimensional cutting stock of circularitems[J] .Computers&Operations Research,2010,37(4):621-629.
  • 6Cui Yao-dong,Wang Qiang.Exact and heuristic algorithms for the circle cutting problem in the manufacturing industry of electric motors[J] .Comb Optim,2007,14(1):35-44.
  • 7Cui Yao-dong,Gu Tian-long,Hu Wei.Recursive algorithms for the optimum cutting of equal rectangles[J] .International Journal of Computers and Applications,2011,33(2):103-107.
  • 8Cui Bin,Lin Dan,Tan Kian-Lee.Database Systems for Advanced Applications[M] .Springer Berlin Heidelberg,2005.
  • 9Paquay C,Schyns M,Limbourg S.A mixed integer programming formulation for the three-dimensional bin packing problem deriving from an air cargo application[J] .International Transactions in Operational Research,.
  • 10李尚芳,崔耀东,王晓庆.冲裁条带最优多段排样方式的动态规划算法[J].计算机工程与应用,2011,47(34):238-241. 被引量:10

引证文献4

二级引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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