减少切割成本的圆形件下料优化算法  

Optimization algorithm of blanking for circular part with reduced cutting costs

作　　者：王珂 胡小春[2] 陈燕[1,3] 农英雄[4] 蒋志一 Wang Ke;Hu Xiaochun;Chen Yan;Nong Yingxiong;Jiang Zhiyi(School of Computer,Electronics and Information,Guangxi University,Nanning 530004,China;School of Information and Statistics,Guangxi University of Finance and Economics,Nanning 530007,China;Guangxi Key Laboratory of Multimedia Communications Network Technology(Guangxi University),Nanning 530004,China;China Tobacco Guangxi Industrial Co.,Ltd.,Nanning 530001,China)

机构地区：[1]广西大学计算机与电子信息学院,广西南宁530004 [2]广西财经学院信息与统计学院,广西南宁530007 [3]广西多媒体通信与网络技术重点实验室(广西大学),广西南宁530004 [4]广西中烟工业有限责任公司,广西南宁530001

出　　处：《锻压技术》2021年第1期50-55,共6页Forging & Stamping Technology

基　　金：国家自然科学基金资助项目(713710586);广西自然科学基金资助项目(2020GXNSFAA159090);广西中烟工业有限责任公司科研项目(201945000030054)。

摘　　要：针对圆形件下料问题,从减少条带数量的角度考虑降低下料总成本,提出一种基于顺序价值修正的启发式下料算法。一个下料方案由一个或多个排样方式组成,每个排样方式均采用T形结构布局。T形结构用一条分界线将板材为两段,同一段中所有条带的方向相同、长度相等。首先,根据所需的不同圆形件直径确定所有的断点长度,再将其代入排样方式生成函数,分别采用动态规划算法和递推算法确定T形排样方式两段中的条带最优组合和最佳断点长度,最后,采用顺序价值修正启发式算法得到最终的下料方案。实验计算结果表明,此优化算法可有效地减少下料方案的条带数量,从而减少企业下料的切割成本。For the blanking issue of circular parts,a heuristic blanking algorithm based on sequential value correction was presented for reducing the total cost of blanking from the perspective of reducing the number of strips.Then,a blanking plan consisted of one or more layout methods,each of which used a T-shaped structure layout.Meanwhile,the T-shaped structure was that using a dividing line divided the plate into two sections,and all the strips in the same section were set to the same direction and the same length.First,all the breakpoint lengths were determined according to the required circular part with different diameters,and then they were substituted into the generate function of layout method.Next,the optimal combination of strips and the optimal breakpoint length in the two sections of T-shape layout method were determined by the dynamic programming algorithm and the recursive algorithm respectively.Finally,the final blanking plan was obtained by the sequential value correction heuristic algorithm.The experimental calculation results show that the optimization algorithm effectively reduces the number of strips for the blanking plan to reduce the blanking cost of enterprise.

关 键 词：条带数量 T形结构 圆形件 下料 动态规划 顺序价值修正 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]