Particle Swarm Optimization Algorithm with Adaptive Mutation

Considering the premature convergence problem of Particle Swarm Optimization(PSO),a new Adaptive Particle Swarm Optimization with Mutation(APSOwM) is presented based on the variance ratio of population’s fitness.During the running time,the inertia weight and the mutation probability are determined by two factors: the variance ratio of population’s fitness and the average distance of current population.The ability of APSOwM to break away from the local optimum and to find the global optimum is greatly improved by the adaptive mutation.Experimental results show that the new algorithm is with great advantage of convergence property over PSO,and also avoids the premature convergence problem effectively.

[1]  Russell C. Eberhart,et al.  Parameter Selection in Particle Swarm Optimization , 1998, Evolutionary Programming.

[2]  M. Clerc,et al.  The swarm and the queen: towards a deterministic and adaptive particle swarm optimization , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[3]  Zwe-Lee Gaing,et al.  A particle swarm optimization approach for optimum design of PID controller in AVR system , 2004 .