Swarm Intelligence for Traveling Salesman Problems
Fangguo He · International Conference on Electronics, Communications and Control · 2012
As a swarm intelligence algorithm, particle swarm optimization (PSO) has received increasing attention and wide applications in a variety of fields. This paper investigates the application of PSO algorithm to the traveling salesman problem (TSP). Proposing the concepts of swap operator and swap sequence, we present a discrete PSO algorithm by redefinition of the equation for the particle's velocity. A computational experiment is reported. The results show that the method proposed in this paper can achieve good results.