Formalization Description and Instance Research on Particle Swarm Optimization Algorithm

Formalization description of particle swarm optimization algorithm is proposed based on the collectivity mode framework of swarm intelligence in this paper. As a specific case, a modified particle swarm optimization algorithm is brought forward in formalization description mode on the basis of defining the optimum information broadcasting mode, in which broadcasting scope of the optimum information is provided with logical grouped-and-delayed characteristic and dynamic spreading scope characteristic. The algorithm?s effectiveness is proved by computer simulation results.

[1]  R. Eberhart,et al.  Fuzzy adaptive particle swarm optimization , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

[2]  Weijun Xia,et al.  APPLYING PARTICLE SWARMOPTIM IZATION TO JOB-SHOP SCHEDULING PROBLEM , 2004 .

[3]  G. Lambert-Torres,et al.  A hybrid particle swarm optimization applied to loss power minimization , 2005, IEEE Transactions on Power Systems.

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

[5]  Zhang Li-ping,et al.  Optimal choice of parameters for particle swarm optimization , 2005 .

[6]  Zwe-Lee Gaing,et al.  A particle swarm optimization approach for optimum design of PID controller in AVR system , 2004 .

[7]  Tiago Ferra de Sousa,et al.  Particle Swarm based Data Mining Algorithms for classification tasks , 2004, Parallel Comput..

[8]  R. Eberhart,et al.  Empirical study of particle swarm optimization , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

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