冲裁条带剪切下料问题的一种求解算法  

An Algorithm for Solving the Cutting Stock Problem of Punched Strips

作　　者：车念[1] 张军[2] 潘立武[3] 

机构地区：[1]四川大学锦江学院,四川眉山620860 [2]郑州科技学院电气工程学院,河南郑州450064 [3]河南牧业经济学院自动化与控制系,河南郑州450011

出　　处：《机械设计与制造》2016年第2期37-40,共4页Machinery Design & Manufacture

基　　金：河南省科技厅科技攻关项目(152102210320);河南省高等学校重点科研项目(15B52000)

摘　　要：金属板材经常采用剪冲工艺分割出零件毛坯。首先在剪切阶段用剪床将板材剪切成条带,然后在冲压阶段用冲床将条带冲压出所需的毛坯。讨论条带最优剪切下料方案的设计问题。文中首先提出一个生成条带最优三块布局方式的递归算法;然后采用基于列生成的线性规划算法迭代调用上述布局方式生成算法,每次都根据生产成本最小的原则改善目标函数并确定各种毛坯的当前价值,按照当前价值生成一个新的布局方式,最后选择最优的一组布局方式组成下料方案。采用例题将文中下料算法与文献中T型下料算法进行比较,实验计算结果表明,文中下料算法板材利用率高于T型下料算法,并且计算时间合理。The shearing and punching process is often used in the processing of blanks made of metal sheet. First in the shearing stage the guillotine shear cuts the stock sheet into strips,then in the punching stage the stamping press punches out the blanks from the strips. It discusses the design problem for the optimal cutting stock plan of strips. Firstly,it proposes a recursive algorithm for generating optimal three block pattern of strips; then the linear programming algorithm which is based on column generation algorithm calls the above pattern generation algorithm,each time improves the objective function on the principle of minimum production cost and determines the current value of all kinds blanks,generating a new pattern according to the current value,finally chooses a group of optimal patterns to form the cutting plan. The algorithm is tested on examples and compared with the literature＇s T-shape algorithm,and the experimental results show that,the sheet utilization rate of the algorithm is higher than the T-shape algorithm,and the computation time is reasonable.

关 键 词：冲裁件 剪冲下料 递归算法 线性规划 

分 类 号：TH16[机械工程—机械制造及自动化]