冲裁条带三块排样方式的动态规划算法

Dynamic Programming Algorithm for Three-Block Cutting Patterns of Punched Strips

讨论冲裁件无约束两维剪冲排样问题.采用三块排样方式,简化切割工艺.排样时用2根呈T型的分界线将板材分成三块,同一块中所有冲裁条带的方向和长度均相同.采用动态规划法确定所有可能尺寸的块里面条带的最优组合,采用枚举法确定2根分界线最优位置,目标是使排样方式的价值达到最高.使用文献中的例题对该文算法进行了测试,将算法与著名的T型排样算法和两段排样算法进行了比较.实验结果表明,该算法得到的排样方式的价值高于以上两种著名算法,而且计算时间合理.

This paper discussed the unconstrained two-dimensional cutting and punching problem of punched blanks.It used the three block patterns,the cutting process is relatively simple.At the process of packing it used T-shape to line divide the sheet into three blocks,each of which contains strips of the same direction and length.Using dynamic programming method to determine the optimal combination of strips in all possible blocks,using enumeration method to determine the optimal position of 2branch line,the goal is to make the value of pattern reached the highest.Using the literature example to test the proposed algorithm,and make the algorithm compared with T-shape algorithm and two-segment algorithm.The experimental results show that,the algorithm can get a higher value than the above two well-known algorithms,but also reasonable computation time.