冲裁条带最优多段排样方式的动态规划算法  

Dynamic programming algorithm for optimal multiple-segment patterns of punched strips

作　　者：李尚芳[1] 崔耀东[2] 王晓庆[1] 

机构地区：[1]广西师范大学计算机科学与信息工程学院,广西桂林541004 [2]广西大学计算机与电子信息学院,南宁530004

出　　处：《计算机工程与应用》2011年第34期238-241,共4页Computer Engineering and Applications

基　　金：国家自然科学基金(No.60763011)~~

摘　　要：讨论冲裁件无约束剪冲排样问题,用动态规划算法生成冲裁条带多段排样方式。采用一组相互平行的分割线将板材分成多个段,每段含一组方向和长度都相同的条带。通过动态规划算法确定所有可能尺寸段的最优价值以及板材中段的最优组合,使整张板材价值达到最大。实验结果表明该算法能够提高材料利用率,计算时间能满足实际应用的需要。Focusing on the unconstrained two-dimensional cutting and punching problem of punched blanks,a dynamic programming algorithm is proposed for generating multiple-segment cutting patterns of punched strips.The stock sheet is divided into segments by dividing cuts which are perpendicular to each other.Each segment contains a group of strips which have the same orientation and length.The dynamic programming algorithm determines the optimal value of all the segments and the optimal combination of the segments included in the plate so as to maximize the value of the whole sheet.Computational results indicate that the algorithm can improve the material usage,and the computation time of the algorithm is reasonable for practical use.

关 键 词：冲裁件 剪冲下料 排样 二维切割 多段排样方式 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]