Improved Enhanced Self-Tentative PSO algorithm for TSP

This paper proposes an Improved Enhanced Self-Tentative (IEST) particle swarm optimization (PSO) algorithm for solving TSP problem. The improved method can easily solve the cross problem for the tour, and greatly increased the chances to find the better solution in the evolutionary process. Time complexity of the improved method was analyzed, based on this the proper parameters was set to solve different benchmark TSP problems, numerical simulation results show the effectiveness and efficiency of the proposed method.