基于蚁群信息素的遗传操作算法  

The Genetic Operating Based on the Pheromone of Ant Colony in the Genetic Algorithm

作　　者：张应辉[1] 王志伟[1] 曾庆华[1] 

机构地区：[1]成都东软信息技术学院,成都611844

出　　处：《计算机科学》2007年第6期170-173,共4页Computer Science

摘　　要：在遗传操作算法中通常是随机选择交叉和变异的基因位置。基于蚁群信息素和选择基因的概率,本文提出了一种选择基因的方法以提升局部最优化的性能和加速算法的收敛。通过求解旅行商问题(TSP)的仿真实验,表明了这种方法的有效性。It is a normal way to randomly select crossover and mutation gene locus in genetic operating. In this paper, based on the pheromone of Ant Colony and the probability of selecting gene, a method to select gene is presented to raise the performance of local optimization and the speed of the algorithm convergence. The efficiency of the method has been shown by simulative experiments solving the Traveling Salesman Problems （TSP）.

关 键 词：遗传算法 蚁群算法 全局最优化 信息表 旅行商问题(TSP) 

分 类 号：TP311.13[自动化与计算机技术—计算机软件与理论]