Particle Swarm Optimization with Comprehensive Learning Self-adaptive Mutation

摘要

As a representative method of swarm intelligence, Particle Swarm Optimization (PSO) is an algorithm for searching the global optimum in the complex space through cooperation and competition among the individuals in a population of particle. But the basic PSO has some demerits, such as relapsing into local optimum solution, slowing convergence velocity in the late evolutionary. To solve those problems, an particle swarm optimization with comprehensive learning & self-adaptive mutation(MLAMPSO) was proposed. The improved algorithm made adaptive mutation on population of particles in the iteration process, at the same time, the weight and learning factors were updated adaptively. It could enhance the ability of PSO to jump out of local optimal solution. The experiment results of some classic benchmark functions show that the improved PSO obviously improves the global search ability and can effectively avoid the problem of premature convergence.