Logo
ScienceStack
Table of Contents
Fetching ...
Sign In

PSO and the Traveling Salesman Problem: An Intelligent Optimization Approach

Kael Silva Araújo, Francisco Márcio Barboza

TL;DR

The paper addresses the Traveling Salesman Problem (TSP), an NP-hard combinatorial optimization task that seeks to minimize the tour length $L$ over $n$ cities. It investigates applying Particle Swarm Optimization (PSO), originally designed for continuous spaces, by encoding the city order as a permutation and incorporating a discrete adaptation with a local search step. Key contributions include adapting PSO for discrete TSP, benchmarking against GA and SA on benchmark instances, and providing pseudocode and practical guidance for implementation. Results show PSO delivers competitive solutions for small- to medium-sized TSPs with reasonable runtimes, and the authors highlight hybridization with local search or other heuristics as a promising path to scale to larger problems.

Abstract

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 and the Traveling Salesman Problem: An Intelligent Optimization Approach

TL;DR

The paper addresses the Traveling Salesman Problem (TSP), an NP-hard combinatorial optimization task that seeks to minimize the tour length over cities. It investigates applying Particle Swarm Optimization (PSO), originally designed for continuous spaces, by encoding the city order as a permutation and incorporating a discrete adaptation with a local search step. Key contributions include adapting PSO for discrete TSP, benchmarking against GA and SA on benchmark instances, and providing pseudocode and practical guidance for implementation. Results show PSO delivers competitive solutions for small- to medium-sized TSPs with reasonable runtimes, and the authors highlight hybridization with local search or other heuristics as a promising path to scale to larger problems.

Abstract

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.
Paper Structure (13 sections, 3 equations, 1 figure, 3 tables, 1 algorithm)

This paper contains 13 sections, 3 equations, 1 figure, 3 tables, 1 algorithm.

Table of Contents

  1. Introduction
  2. The Particle Swarm Optimization (PSO) Algorithm
  3. Advantages and Disadvantages of PSO
  4. The Traveling Salesman Problem (TSP)
  5. Mathematical Formulation of TSP
  6. PSO Adaptation for TSP
  7. Handling the Discreteness of the Problem
  8. Performance Evaluation
  9. Pseudocode for Solving the TSP using PSO
  10. Results and Discussions
  11. Experiment Configurations
  12. Results
  13. Conclusion

Figures (1)

  • Figure 1: Graph representing the Traveling Salesman Problem with 5 cities.