考虑切割刀数的T形排样算法研究  

RESEARCH ON THE ALGORITHM OF T-SHAPE CUTTING PATTERNS WITH CUTS NUMBER CONSIDERATION

作　　者：李秋蓉[1] 崔耀东[1] 罗丹[1] 

机构地区：[1]广西大学计算机与电子信息学院,广西南宁530004

出　　处：《计算机应用与软件》2013年第3期28-29,138,共3页Computer Applications and Software

基　　金：国家自然科学基金项目(61063031)

摘　　要：讨论无约束二维板材切割问题,采用T形排样方式以简化切割工艺。优化目标是使排样方式的价值最大,而排样方式的价值等于其中所含毛坯的总价值与切割成本之差。假定切割成本与切割刀数成正比,采用基于动态规划的算法生成排样方式。实验结果表明该算法可有效地减少切割刀数,计算时间合理。This paper discusses the unconstrained two dimension plate cutting problem,T-shape cutting patterns is used to simplify the cutting process.The optimisation objective is to maximise the pattern value of which it is the difference between the total value of the roughcasts included and the cutting cost.An algorithm based on dynamic programming is employed to generate cutting patterns,where it is assumed that the cutting cost is in proportion to the number of cuts.Experimental results show that the algorithm can effectively reduce the number of cuts and the computation time is reasonable.

关 键 词：二维切割 T形排样方式 动态规划 刀数减少 

分 类 号：TH164[机械工程—机械制造及自动化] TP301.6[自动化与计算机技术—计算机系统结构]