A Hybrid Particle Swarm Algorithm with Cauchy Mutation
Hui Wang, Changhe Li, Yong Liu, Sanyou Y. Zeng · 2007
Particle swarm optimization (PSO) has shown its fast search speed in many complicated optimization and search problems. However, PSO could often easily fall into local optima because the particles could quickly get closer to the best particle. At such situations, the best particle could hardly be improved. This paper proposes a new hybrid PSO (HPSO) to solve this problem by adding a Cauchy mutation on the best particle so that the mutated best particle could lead all the rest of particles to the better positions. Experimental results on many well-known benchmark optimization problems have shown that HPSO could successfully deal with those difficult multimodal functions while maintaining fast search speed on those simple unimodal functions in the function optimization