Solving Traveling Salesman Problem by Ant Colony Optimization Genetic Hybrid Algorithm

By use of the properties of ant colony algorithm and genetic algorithm,a hybrid algorithm,whose framework of hybrid algorithm is genetic algorithm,is proposed to solve the traveling salesman problems. Four mutation strategies are put forward using the characteristic of traveling salesman problems. The hybrid algorithm with 2-Opt local search can effectively find better minimum beyond premature convergence. Ants choose several tours based on trail ,and these tours will replace the worse solution. Compare with the simulated annealing algorithm,the standard genetic algorithm and the standard 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.