锻压技术

多板材单一矩形件下料问题的一种求解算法

英文标题：An algorithm for solving problem of multiple plate single rectangle cutting stock

作者：潘卫平陈秋莲崔耀东李华

单位：广西大学

分类号：TP391

出版年,卷(期):页码：2014,39(11):6-10

摘要：

提出一种生成多板材单一矩形件下料方案的优化算法。该算法首先采用具有全容量特性的动态规划方法，一次性生成所有规格单张板材的排样方式；然后建立整数规划模型求解下料方案，并得到每种板材所用的张数，优化目标是在满足毛坯需求的前提下使所用的板材总面积最小。实验结果表明，对于板材张数无约束问题和有约束问题，多板材下料算法比文献中的单一板材下料算法下料利用率分别提高了2.09%和0.83%。

An optimal algorithm of generating multiple plate single rectangle part cutting process was put forward. Firstly, the dynamic programming method with the characteristic of full capacity was applied to generate all of the single plate patterns once. Then the integer programming model was established to solve the cutting process, and the number of each kind of plate used was obtained. The optimal goal was to minimize the total area of the plates used under the demand that blanks being satisfied. The experimental results show that,as for the plate number unconstrained problems and constrained problems, the material utilization rate with multiple plate algorithm is improved by 2.09% and 0.83% respectively more than that of single plate cutting algorithm cited in other articles.

基金项目：

国家自然科学基金资助项目(61363026，71371058)；广西大学科研基金资助项目（XGL090030）

潘卫平（1989-），男，硕士研究生陈秋莲（1974-），女，博士，副教授

参考文献：

［1］陈仕军, 曹炬. 一种 “一刀切” 式矩形件优化排样混合算法[J]. 锻压技术, 2009, 34(4): 143-147.Chen S J, Cao J. Hybird algorithm of guillotine rectangular cutting peoblem[J]. Forging & Stamping Technology, 2009, 34(4): 143-147.
［2］崔耀东, 张春玲, 赵谊. 同尺寸矩形毛坯排样的连分数分支定界算法[J]. 计算机辅助设计与图形学学报, 2004, 16(2): 252-256.Cui Y D, Zhang C L, Zhao Y.A continued fractions and branch-and-bound algorithm for generating cutting patterns with equal rectangles [J].Journal of Computer Aided Design & Computer Graphics, 2004, 16(2): 252-256.
［3］Cui Y D, Zhao Z G. Heuristic for the rectangular two-dimensional single stock size cutting stock problem with two-staged patterns[J]. European Journal of Operational Research, 2013, 231(2): 288-298.
［4］ Fabio F, Enrico M. Models for the two-dimensional two-stage cutting stock problem with multiple stock size[J]. Computers & Operations Research, 2013, 40:1953-1962.
［5］ Ignacio H，Lorena P, Víctor P. Board cutting from logs: Optimal and heuristic approaches for the problem of packing rectangles in a circle[J].International Journal of Production Economics, 2013, 145(2): 541-546.
［6］ Cui Y, Gu T, Hu W. Recursive algorithms for the optimum cutting of equal rectangles[J]. International Journal of Computers and Applications,2011, 33(2): 103-107.
［7］ Cui Y. Dynamic programming algorithms for the optimal cutting of equal rectangles[J]. Applied Mathematical Modelling,2005, 29 (11): 1040-1053.

服务与反馈：

【文章下载】【加入收藏】