Hybrid Ant Colony Algorithm Using Improved Circle Strategy for TSP Problem

Abstract

Based on the problems existing in the traditional ant colony algorithm in solving the traveling salesman problem, a hybrid ant colony algorithm combining the improved circle strategy and the ant colony algorithm is proposed. In the proposed hybrid ant colony algorithm, an improved circle strategy is used to optimize the solution obtained by the ant colony algorithm, so as to improve the search efficiency and search ability. At the same time, the uniform design method is used to find the optimal parameter combination of the algorithm. The improved circle strategy is based on the nearest neighbor strategy to optimize the solution obtained by the ant colony algorithm into a better solution. This paper uses 8 standard instances in the TSPLIB standard library to experimentally verify the algorithm. The experimental results show that the proposed hybrid ant colony algorithm can effectively improve the convergence ability of the algorithm, obtain higher quality solutions, and have better optimization ability and stability for solving TSP problems.