Particle swarm optimization with mutation

The particle swarm optimization algorithms converges rapidly during the initial stages of a search, but often slows considerably and can get trapped in local optima. This paper examines the use of mutation to both speed up convergence and escape local minima. It compares the effectiveness of the basic particle swarm optimization scheme (BPSO) with each of BPSO with mutation, constriction particle swarm optimization (CPSO) with mutation, and CPSO without mutation. The four test functions used were the Sphere, Ackley, Rastrigin and Rosenbrock functions of dimensions 10, 20 and 30. The results show that mutation hinders the motion of the swarm on the sphere but the combination of CPSO with mutation provides a significant improvement in performance for the Rastrigin and Rosenbrock functions for all dimensions and the Ackley function for dimensions 20 and 30, with no improvement for the 10 dimensional case.