计算机工程与应用2011，Vol.47Issue(34)：238-241,4.DOI:10.3778/j.issn.1002-8331.2011.34.066
冲裁条带最优多段排样方式的动态规划算法
Dynamic programming algorithm for optimal multiple-segment patterns of punched strips
摘要
Abstract
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.关键词
冲裁件/剪冲下料/排样/二维切割/多段排样方式Key words
punched blanks/cutting and punching/nesting/two-dimensional cutting/multiple-segment pattern分类
信息技术与安全科学引用本文复制引用
李尚芳,崔耀东,王晓庆..冲裁条带最优多段排样方式的动态规划算法[J].计算机工程与应用,2011,47(34):238-241,4.基金项目
国家自然科学基金(the National Natural Science Foundation of China under Grant No.60763011). （the National Natural Science Foundation of China under Grant No.60763011）
