Solving Traveling Salesman Problem by Genetic Ant Colony Optimization Algorithm
By use of the properties of ant colony algorithm and genetic algorithm,a hybrid algorithm is proposed to solve the traveling salesman problems.First,it adopts genetic algorithm to give information pheromone to distribute.Second,it makes use of the ant colony algorithm to get several solutions through information pheromone accumulation and renewal.Finally,by using across and mutation operation of genetic algorithm,the effective solutions are obtained.Compare with the simulated annealing algorithm,the standard genetic algorithm,the standard ant colony algorithm,and statistics initial ant colony algorithm all the 16 hybrid algorithms are proved effective.Especially the hybrid algorithm with across strategy B and mutation strategy B is a simple and effective better algorithm than others.
Ant Colony Algorithm Genetic Algorithm Traveling Salesman Problem Simulated Annealing Algorithm
Shang Gao
School of electronics and information,Jiangsu University of Science and Technology,Zhenjiang,Jiangsu 212003,China State Key Laboratory of CAD & CG,Zhejiang University,Hangzhou,Zhejiang ,310027,China
国际会议
大连
英文
597-602
2008-07-27（万方平台首次上网日期，不代表论文的发表时间）