首页 | 本学科首页   官方微博 | 高级检索  
     

基于两阶段排样方式的卷材下料算法研究
引用本文:邓国斌,朱强,沈萍.基于两阶段排样方式的卷材下料算法研究[J].锻压技术,2017,42(5).
作者姓名:邓国斌  朱强  沈萍
作者单位:1. 广西职业技术学院 计算机与电子信息工程系,广西 南宁,530226;2. 中原工学院 信息商务学院,河南 郑州,450007
基金项目:广西自然科学基金资助项目,广西教育厅科研项目
摘    要:讨论矩形件卷材下料问题,采用切割工艺简单的两阶段排样方式采进行下料。这种排样方式采用一组平行于卷材宽度方向的剪切线将卷材切割成多个条带,然后将每个条带切割成所需要的矩形件。首先,构造一种有界背包算法确定矩形件在条带中的优化布局;然后,采用基于列生成的线性规划算法调用上述有界背包算法生成排样方式;最后,采用顺序启发式算法,用当前矩形件剩余需求量反复调用线性规划算法生成各个排样方式,直至每种矩形件剩余需求量均为零,组合各个排样方式形成下料方案。将本文算法与2种文献算法进行比较,计算结果表明,本文算法下料方案比2种文献算法分别节省1.97%和1.66%的卷材。

关 键 词:卷材下料问题  两阶段排样方式  线性规划算法  顺序启发式算法  下料算法

Research on coil cutting algorithm based on the two-stage cutting layout
Deng Guobin,Zhu Qiang,Shen Ping.Research on coil cutting algorithm based on the two-stage cutting layout[J].Forging & Stamping Technology,2017,42(5).
Authors:Deng Guobin  Zhu Qiang  Shen Ping
Abstract:The problem of rectangles coil cutting was discussed, and the cutting process was carried out by simple two-stage cutting layout.Through this cutting layout, the coil was cut into a variety of strips by a set of shearing lines which were paralleled to the coil width direction, then each strip was cut into desirable rectangles.Firstly, a bounded backpack algorithm was constructed to determine the optimal layout of the rectangles in the strip.Next, the cutting layout was generated by the linear programming algorithm to call the bounded backpack algorithm based on the column generation.Finally, a variety of cutting layout were generated by the sequential heuristic algorithm to repeat call the linear programming algorithm through the remaining demand of current rectangle until zero, and a cutting plan was formed by combining each cutting layout.The results of calculation comparisons between the proposed algorithm and the two literature algorithms show that the proposed algorithm can save 1.97% and 1.66% of the coil, respectively.
Keywords:coil cutting problem  two-stage cutting layout  linear programming algorithm  sequential heuristic algorithm  cutting algorithm
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号