采用三块排样方式,基于背包问题和动态规划算法,用两条成T形的剪切线将板材分成三个矩形区域,每个区域中包含一个由同尺寸毛坯组成的规范块。实验计算表明,所述算法时间效率合理,能够有效提高材料利用率和简化切割下料过程。
lit presents an algorithm for the two-dime nsional, rectangular placement problem. The algorithm is based on knapsack problem and dynamic programming techniques. It divides the plate into three regions. Each region contains a normal block consisting of items of the same type. The computational results indicate that the algorithm is efficient in both computation time and material utilization,and is able to simplify the cutting process.