The Traveling Salesman Problem (TSP) is a well-known combinatorial optimization problem that aims to find the shortest possible route that visits each city exactly once and returns to the starting point. This paper explores the application of Particle Swarm Optimization (PSO), a population-based optimization algorithm, to solve TSP. Although PSO was originally designed for continuous optimization problems, this work adapts PSO for the discrete nature of TSP by treating the order of cities as a permutation. A local search strategy, including 2-opt and 3-opt techniques, is applied to improve the solution after updating the particle positions. The performance of the proposed PSO algorithm is evaluated using benchmark TSP instances and compared to other popular optimization algorithms, such as Genetic Algorithms (GA) and Simulated Annealing (SA). Results show that PSO performs well for small to medium-sized problems, though its performance diminishes for larger instances due to difficulties in escaping local optima. This paper concludes that PSO is a promising approach for solving TSP, with potential for further improvement through hybridization with other optimization techniques.

翻译：旅行商问题是一个著名的组合优化问题，旨在寻找一条访问每个城市恰好一次并返回起点的最短可能路径。本文探讨了基于种群的优化算法——粒子群优化算法在求解旅行商问题中的应用。尽管PSO最初是为连续优化问题设计的，但本研究通过将城市顺序视为排列，使PSO适应了旅行商问题的离散特性。在更新粒子位置后，采用包含2-opt和3-opt技术的局部搜索策略来改进解。使用基准旅行商问题实例评估了所提出的PSO算法的性能，并与遗传算法、模拟退火等其他流行优化算法进行了比较。结果表明，PSO在中小规模问题上表现良好，但在大规模实例中，由于难以跳出局部最优，其性能有所下降。本文得出结论：PSO是求解旅行商问题的一种有前景的方法，通过与其他优化技术混合使用，具有进一步改进的潜力。