带剪刃长度约束的圆形片二维优化下料算法  

Optimal algorithm of two dimensional cutting stock for circular pieces with blade length constraint

作　　者：管卫利[1] 王祺 Guan Weili1,Wang Qi2(1. Information Engineering College, Nanning University, Nanning 530200, China; 2. Experimental Teaching Center, Hebei Finance University, Baoding 071051, Chin)

机构地区：[1]南宁学院信息工程学院,广西南宁530200 [2]河北金融学院实验教学中心,河北保定071051

出　　处：《锻压技术》2018年第3期176-180,共5页Forging & Stamping Technology

基　　金：广西科学研究与技术开发计划(桂科攻12118017-10A);广西高校科研项目(YB2014450)

摘　　要：钣金制造企业经常采用剪冲工艺将金属板材剪冲出圆形片,用以生产各种零件,优良的下料算法可以提高板材的下料利用率。现提出一种带剪刃长度约束的圆形片下料算法,这种算法将板材分为4个块,每个块中包含相同长度和方向的条带,每个条带中包含同种圆形片。首先运用递归技术构造4块布局方式的无约束生成算法和有约束生成算法;然后采用线性规划算法迭代调用无约束布局算法,生成第1部分下料方案,采用顺序启发式算法顺序调用有约束布局算法,生成第2部分下料方案;最后,组合两部分下料方案形成最终下料方案。数值模拟实验结果表明,采用该下料算法板材利用率高于文献算法。The shearing and punching processes are often applied in cutting sheet metal into circular pieces to produce various parts by sheet metal manufacturing enterprises,and the excellent cutting stock algorithm can improve the material utilization. Therefore,an algorithm of circular pieces cutting stock with blade length constraint was proposed. The plate was divided into four blocks by the algorithm,each block contained strips with the same length and direction,and each strip contained identical circular pieces. Firstly,unconstrained algorithm and constrained algorithm for the generation of four-block layout were constructed by the recursive technique,and the unconstrained layout algorithm was iteratively called by linear programming algorithm to generate a cutting plan of the first part. Then,constrained algorithm was orderly called by sequential heuristic algorithm to generate a cutting plan of the second part. Finally,the cutting plan of two parts were combined to form the final one. The results of numerical simulation experiments show that the sheet utilization rate of this algorithm is higher than that of the literature algorithm.

关 键 词：圆形片下料 4块布局方式 剪刃长度约束 下料算法 钣金制造 线性规划 

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