Solving the Travelling Salesman Problem Using the PSO Optimization

This article examines a potential solution to the well-known Travelling Salesman Problem (TSP), which is classified as an NP-hard problem. We also provide a theoretical synopsis of several approaches that have been employed to tackle this problem. A prominent example of a combinatorial problem is the traveling salesman problem (TSP). To address the fundamental PSO algorithm's premature convergence issue and stagnation behavior on TSP, a scout characteristic-based PSO algorithm is suggested.We address Particle Swarm Optimization (PSO), a member of the evolutionary methods class, and outline the methodology for applying PSO to the TSP. Among population-based metaheuristic optimization methods, Particle Swarm Optimization (PSO) is one of the most widely used. Scientific domains such as engineering, chemistry, medicine, advanced physics, and humanities have all effectively employed PSO. Numerous theoretical and empirical results on the convergence and parameterization of PSO versions have been produced as a result of the method's extensive investigation since its introduction in 1995. Hundreds of PSO versions have been developed. It is well recognized that population size has a significant impact on the effectiveness of metaheuristics; nevertheless, no comprehensive research has been done on the appropriate selection of PSO swarm size to date.Through the application of this approach, we examine the effects of various control settings. The ideal solution and the quality of the solution are contrasted.