This paper presents a modified PSO algorithm, called the PSO with C-Pg mutation, or PSOWC-Pg, the algorithm adopts C-Pg mutation, the idea is to replace global optimal point gBest with disturbing point C and gBest alternately in the original formulae, the probability of using C is R. There are two methods for selecting C: stochastic method and the worst fitness method. The stochastic method selects some particle’s current position x or pBest as C stochastically in each iteration loop, the worst fitness method selects the worst particle’s x or the pBest of some particle with the worst fitness value as C. So, when R is small enough, the distance between C and gBest will tend towards 0, particle swarm will converge slowly and irregularly. The results of experiments show that PSOWC-Pg exhibit excellent performance for test functions.
[1]
R. Eberhart,et al.
Comparing inertia weights and constriction factors in particle swarm optimization
,
2000,
Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).
[2]
James Kennedy,et al.
Particle swarm optimization
,
2002,
Proceedings of ICNN'95 - International Conference on Neural Networks.
[3]
Maurice Clerc,et al.
The particle swarm - explosion, stability, and convergence in a multidimensional complex space
,
2002,
IEEE Trans. Evol. Comput..
[4]
José Neves,et al.
The fully informed particle swarm: simpler, maybe better
,
2004,
IEEE Transactions on Evolutionary Computation.