Abstract
Particle Swarm Optimization has succeeded in many continuous problems, but research about discrete problems especially routing problems has been done little. In this paper, an improved Particle Swarm Optimization (PSO) algorithm to solve Traveling Salesman Problem was proposed. Fuzzy Matrix was used to represent the position and velocity of the particles in PSO and the operators in the original PSO formulas were redefined. Then the algorithm was tested with several concrete examples from TSPLIB, experiment shows that the algorithm can achieve good results.
| Translated title of the contribution | Fuzzy Discrete Particle Swarm Optimization for Solving Travel Salesman Problem |
|---|---|
| Original language | Chinese |
| Pages (from-to) | 1331-1334 |
| Number of pages | 4 |
| Journal | Journal of Chinese Computer Systems |
| Volume | 26 |
| Issue number | 8 |
| Publication status | Published - 2005 |
Keywords
- particle
- swarm
- optimization
- traveling salesman problem
- fuzzy matrix