基于非等值初始量蚁群算法的矩形优化排料  

Optimization of a rectangular layout based on a non-equivalent initial pheromone ant colony algorithm

作　　者：张娜 赵罘[1] ZHANG Na;ZHAO Fu(School of Materials Science and Mechanical Engineering,Beijing Technology and Business University,Beijing 100048,China)

机构地区：[1]北京工商大学材料与机械工程学院

出　　处：《北京化工大学学报（自然科学版）》2019年第6期72-77,共6页Journal of Beijing University of Chemical Technology(Natural Science Edition)

基　　金：北京市教委科研计划一般项目(KM201810011003)

摘　　要：为提高矩形排料的板材利用率并节约求解时间,提出了非等值初始量蚁群算法,并应用于矩形优化排料问题。在蚁群算法初始信息素量赋值过程中引入矩形面积和长宽比因素以增大各矩形初始信息素的差别,加快算法收敛速度;同时对传统蚁群算法的信息素更新规则作适当改变,以便于信息素快速更新,缩短求解时间。采用改进的最低水平线法作为排料方法,能充分利用已产生的闲置区域,减少板材浪费。对比实验的结果表明,与传统蚁群算法和其他几种典型算法相比,本文算法能进一步提高板材利用率,且求解时间较短。In order to improve the sheet utilization ratio and reduce the time required for solution,in this work we propose a non-equivalent initial pheromone ant colony algorithm and apply it in the rectangular layout optimization problem.The rectangular area and aspect ratio are introduced in the initial pheromone quantity process of the ant colony algorithm in order to increase the difference between the initial pheromone of each rectangle,thus speeding up the convergence of the algorithm.Changing the pheromone update rule of the traditional ant colony algorithm enables rapid updating of the pheromone and thus decreases the solution time.Furthermore,using the improved lowest horizontal line method as the layout method makes full use of the idle area that has been generated,thereby reducing wastage in the sheet.Results of comparative experiments prove that when compared with the traditional ant colony algorithm and several other typical algorithms,our new algorithm leads to improved utilization ratios of the sheets and reduced solution times.

关 键 词：矩形优化排料 蚁群算法 非等值初始量蚁群算法 改进的最低水平线法 

分 类 号：TH164[机械工程—机械制造及自动化]