Optimized solution of Chinese traveler problem based on genetic algorithm
Kun Yang, Kui Jiang · 2023
The Traveler's Problem (TSP) can be specifically described as follows: Suppose a traveling businessman wants to visit n cities, and he has to choose the path he wants to take, with the restriction that he can visit each city only once and has to go back to the city from which he originally started at the end. The goal of path selection is to minimize the distance traveled among all the paths. In this paper, we use genetic algorithm to solve this TSP problem based on the latitude and longitude data of 34provincial capitals in China. The experimental results show that the algorithm has some advantages in convergence speed and solution accuracy on the TSP problem, and has good global optimization ability and global convergence ability.