Hybrid algorithm combining ant colony optimization algorithm with simulated annealing algorithm optimization

By use of the properties of ant colony algorithm and simulated annealing algorithm,a hybrid algorithm is proposed to solve the traveling salesman problems.First,it adopts simulated annealing 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 searching a solution of neighborhood of simulated annealing algorithm,the effective solutions are obtained.Comparing with the simulated annealing algorithm,the standard genetic algorithm,the standard ant colony algorithm,and statistics initial ant colony algorithm,all the 4 hybrid algorithms are proved effective.Especially the hybrid algorithm with strategy D is a simple and effective better algorithm than others.