%0 Journal Article
%T The Genetic Operating Based on the Pheromone of Ant Colony in the Genetic Algorithm<br>基于蚁群信息素的遗传操作算法
%A ZHANG Ying-Hui
%A WANG Zhi-Wei
%A ZENG Qing-Hua
%A <br>张应辉
%A 王志伟
%A 曾庆华
%J 计算机科学
%D 2007
%I 
%X 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).
%K Genetic algorithms
%K Ant colony algorithm
%K Global optimization
%K Pheromone
%K Traveling salesman problems (TSP)<br>遗传算法
%K 蚁群算法
%K 全局最优化
%K 信息表
%K 旅行商问题（TSP）
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=64A12D73428C8B8DBFB978D04DFEB3C1&aid=F7108C7BC0C8E8E806B8FD65E8F0D5E5&yid=A732AF04DDA03BB3&vid=339D79302DF62549&iid=B31275AF3241DB2D&sid=C5F8B8CB20F1B3D8&eid=DABEF202280E7EF1&journal_id=1002-137X&journal_name=计算机科学&referenced_num=0&reference_num=9