Particle swarm optimization with simulated annealing for TSP

Abstract

Abstract:-Aiming at the shortcoming of basic PSO algorithm, that is, easily trapping into local minimum, we propose an advanced PSO algorithm with SA and apply this new algorithm for solving TSP problem. The core of algorithm is based on the PSO algorithm. SA method is used to slow down the degeneration of the PSO swarm and increase the swarm’s diversity. The comparative experiments were made between PSO-SA, basic GA, basic SA and basic ACA on solving TSP problem. Results show PSO-SA is more superior to other methods. Key-Words:- particle swarm optimization; simulating annealing algorithm; TSP; GA 1