An improved ?-PSO algorithm with mutation
Zhong Weimin · 2007
In our previous work, a new PSO algorithm called θ-PSO based on phase angle was put forward, which has better optimization performance than standard PSO algorithm when dealing with some simple benchmark functions.But this algorithm may easily stick in the local minima when handling some complex or multimode functions.In this paper, an improved θ-PSO with mutation operator is studied.And this improved algorithm has better optimization performance when solving some complex benchmark functions.Benchmark testing shows that this improved θ-PSO algorithm can overcome the local minima and achieve the goal of global minimum in limited iterations.