Hybrid Algorithm for Solving Traveling Salesman Problem

Abstract

Abstract The basic genetic algorithm has the disadvantages of falling into local optimum and slow convergence. To solve this problem, a hybrid algorithm combining simulated annealing strategy is proposed. The cooling process in simulated annealing is used to complete the iterative process in the hybrid algorithm. The algorithm is used to solve the traveling salesman problem. The results show that the convergence speed and accuracy of the hybrid algorithm is significantly better than the basic genetic algorithm.