Research on Ant Colony Optimization Tabu Search and Genetic Fusion Algorithm

Swarm intelligence inspired algorithms have so many profound natural advantages in solving large-scale and distributed problems. In this paper, based on ant colony optimization(ACO) or genetic algorithm(GA), the fusion algorithm is obtained by two kinds of fusion strategies to solve traveling salesman problem(TSP). One is to initialize the ant colony algorithm by using the solution of genetic algorithm. The second is to improve the iterative process of ant colony algorithm by using the large crossover and mutation operator of genetic algorithm. It is proved by simulation that the two fusion algorithms are more accurate than the single algorithm.