Research on an Improved Ant Colony Optimization Algorithm for Solving Traveling Salesmen Problem

Abstract

In order to improve the search result and low evolution speed, and avoid the tendency towards stagnation and falling into the local optimum of ant colony optimization(ACO) in solving the complex function, the traditional ant colony optimization algorithm is analyzed in detail, an improved ant colony optimization(IWSMACO) algorithm based on information weight factor and supervisory mechanism is proposed in this paper. In the proposed IWSMACO algorithm, the information weight factor is added to the path selection and pheromone adjustment mechanisms in order to dynamically adjust path selection probability and randomly select the behavior rules for further intelligentializing the ant colony. The supervisory mechanism added the dynamic convergence criterion of supervisory distance and used the optimal pheromone update strategy to self-adaptively select the excellent ants for updating the pheromone trails, and improve the solution qualities of each iteration, better guide the later ants for learning. Finally, the proposed IWSMACO algorithm is carried out by 12 TSP instances. The simulation experiment results show that the proposed IWSMACO algorithm can not only avoid falling into the local optimum, but also enhance the convergence speed. And it takes on remarkable optimized ability and higher search accuracy.