Immune Particle Swarm Optimization Based on Sharing Mechanism

Sharing mechanism is introduced into particle swarm optimization. Fitness values of particles are updated to sharing fitness values. Particles with higher sharing fitness value are punished and particles with smaller sharing fitness value are remained as memory particles. Particles are updated with memory particles and clone selection when global best have not changed in some continuous generations. Population diversity is increased by this way. At the same time the particle with the best fitness value is saved. The modified algorithm can avoid the local optimization and has better search performance to multi-peak functions. The experimental results show the modified algorithm has better convergence performance than standard particle swarm optimization algorithm.

[1]  Yue Shi,et al.  A modified particle swarm optimizer , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[2]  Russell C. Eberhart,et al.  A new optimizer using particle swarm theory , 1995, MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science.

[3]  Russell C. Eberhart,et al.  chapter seven – The Particle Swarm , 2001 .

[4]  Russell C. Eberhart,et al.  Comparison between Genetic Algorithms and Particle Swarm Optimization , 1998, Evolutionary Programming.

[5]  Michael N. Vrahatis,et al.  Recent approaches to global optimization problems through Particle Swarm Optimization , 2002, Natural Computing.

[6]  Yuhui Shi,et al.  Particle swarm optimization: developments, applications and resources , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

[7]  James Kennedy,et al.  Particle swarm optimization , 2002, Proceedings of ICNN'95 - International Conference on Neural Networks.

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