可减少条带数的矩形件二维下料算法  

Two-dimensional blanking algorithm reducing the number of strips for rectangular parts

作　　者：覃广荣 丘刚玮 王坤[2] 吕圣林 Qin Guangrong;Qiu Gangwei;Wang Kun;Lyu Shenglin(Department of Information and Electromechanical Engineering,Guangxi Agriculture Vocational and Technical University,Nanning 530007,China;Department of Information Engineering,Sichuan Institute of Information Technology,Guangyuan 628017,China)

机构地区：[1]广西农业职业技术大学信息与机电工程系,广西南宁530007 [2]四川信息职业技术学院信息工程系,四川广元628017

出　　处：《锻压技术》2022年第1期63-68,共6页Forging & Stamping Technology

基　　金：广西农业科技项目(YKJ1929,Z2019102);教育部新一代信息技术创新项目(2020ITA03027)。

摘　　要：从板材上切割矩形件的过程通常包含两个阶段:第1阶段用大型刀具将板材切成条带;第2阶段用小型刀具将条带切成所需要的矩形件。第1阶段的切割成本随着下料方案中条带数的增加而增加。针对矩形件二维下料问题,提出一种可减少条带数的下料算法,其优化目标是最小化材料成本和切割成本之和。首先,建立该问题的整数线性规划模型;然后,构造T型排样算法生成矩形件在单张板材上的排样方式;最后,采用列生成算法调用T型排样算法迭代构造下料方案。实验结果表明,该算法在维持较高板材利用率的同时,可大幅度减少下料方案的条带数。The process of cutting rectangular parts from sheets usually consists of two stages. In the first stage, the sheets are cut into strips by large cutter, and in the second stage, the strips are cut into rectangular parts needed by small cutter. However, the cutting cost of the first stage increases with the increasing of the number of strips in the cutting scheme. Therefore, for the two-dimensional blanking problem of rectangular parts, a blanking algorithm reducing the number of strips was proposed, and the optimization goal was to minimize the sum of material cost and blanking cost. Firstly, the integer linear programming model of the problem was established, and the T-shape layout algorithm was constructed to generate the layout method of rectangular parts on a single sheet. Finally, the blanking scheme was iteratively constructed by using the column generation algorithm to call the T-shape layout algorithm. The results of experiment show that the algorithm can greatly reduce the number of strips in the blanking scheme while maintaining a high utilization rate of sheet.

关 键 词：二维下料 T型排样算法 列生成算法 整数线性规划模型 矩形件 

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