贴片机贴装路径优化的改进遗传算法  

Application of Improved Genetic Algorithm in Optimization of Placement Path of Placement Machine

作　　者：董健腾 龙绪明[1] 曹宏耀[1] 吕文强[1] 胡少华[1] 朱舜文 曾驰鹤 

机构地区：[1]西南交通大学,四川成都610031

出　　处：《电子工业专用设备》2015年第12期17-21,46,共6页Equipment for Electronic Products Manufacturing

摘　　要：贴片机贴装顺序是影响设备生产效率的重要问题,针对此问题,已有各种优化算法提出,包括遗传算法。但是传统的遗传算法(GA)包括一些改进的遗传算法,在解决这个问题上还是存在全局性差、收敛速度慢和易陷入局部最优解的问题。在此基础上加入一个复合算子来优化种群,保证向最优解收敛的同时兼顾种群多样性。配合有效的交叉算子和变异算子,在优化结果上有了更大的改进,能更有效地提高贴装效率。The sequence of placement has a great influence to the efficiency of the placement machine.In view of this problem,there are various optimization algorithms,including genetic algorithm mentioned in this paper.But the traditional genetic algorithm（GA）,including some improved genetic algorithm,in the solution of the problem or the existence of the global poor,slow convergence speed and easy to fall into local optimal solution.In this paper,a composite operator is added to optimize the population,which is guaranteed to converge to the optimal solution.With the effective crossover operator and mutation operator,the optimization results and the efficiency of mounting have a greater improvement.

关 键 词：遗传算法 贴片机 元件贴装顺序优化 复合算子 

分 类 号：TN605[电子电信—电路与系统]