基于改进蚁群算法的垂直旋转式贴片机贴装顺序优化  

Mounting Sequence Optimization for Vertical Rotary Chip Mounter Based on Improved Ant Colony Algorithm

作　　者：付永忠[1] 潘云峰[1] 

机构地区：[1]江苏大学机械工程学院,江苏镇江212013

出　　处：《计算机与现代化》2017年第8期17-21,共5页Computer and Modernization

摘　　要：以垂直旋转式贴片机为研究对象,在供料器位置确定的情况下,研究其贴装顺序优化问题。在贴片机贴装数学模型的基础上提出改进蚁群算法,将贴装过程分成拾取-贴放循环和各循环之间连接2个子问题。改进蚁群算法在搜索最优解过程中引入精英蚂蚁,并采用全局和局部相组合的信息素更新策略。实验结果表明,改进算法在求解贴片机最优路径时具有较好的求解精度、全局搜索能力以及较快的收敛速度,相比基本蚁群算法,其求得的最优路径使得贴装效率提高了11%左右。The mounting sequence optimization problem of the vertical rotary chip mounter is studied under the condition that the feeder allocations are confirmed. An improved ant colony algorithm is proposed based on the mathematical model. The mount process is divided into collect/posted cycles and each cycle connection. It also introduces elite ant and the pheromone updating strategy based on global and local combination. The experimental results show that the improved algorithm has better precision,global search ability and faster convergence rate. Compared with the basic ant colony algorithm,the efficiency of the optimal solution is increased by about 11%.

关 键 词：贴片机 贴装顺序优化 改进蚁群算法 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]