An adaptive mutation operator for particle swarm optimization.

Particle swarm optimization (PSO) is an e cient tool for optimization and search problems. However, it is easy to be trapped into local optima due to its information sharing mechanism. Many research works have shown that mutation operators can help PSO prevent premature convergence. In this paper, several mutation operators that are based on the global best particle are investigated and compared for PSO. An adaptive mutation operator is designed. Experimental results show that these mutation operators can greatly enhance the performanceof PSO. The adaptive mutation operator shows great advantages over non-adaptive mutation operators on a set of benchmark test problems