On the moments of the sampling distribution of particle swarm optimisers

ABSTRACT

A method is presented that allows one to exactly determine all the characteristics of a PSO's sampling distribution and explain how it changes over time, in the presence stochasticity. The only assumption made is stagnation (particles are in search for a better personal best).

REFERENCES

• 1: James Kennedy, The Behavior of Particles, Proceedings of the 7th International Conference on Evolutionary Programming VII, p.581-589, March 25-27, 1998
• 2: Andries P. Engelbrecht, Fundamentals of Computational Swarm Intelligence, John Wiley & Sons, 2006
• 3: Ozcan, E. and Mohan, C. K. (1998). Analysis of a simple particle swarm optimization system. Intelligent Engineering Systems Through Artificial Neural Networks Vol. 8, pp. 253--258.
• 4: Ozcan, E., and Mohan, C. (1999). Particle swarm optimization: surfing the waves. Proc. 1999 Congress on Evolutionary Computation, 1939--1944. Piscataway, NJ: IEEE Service Center.
• 5: Clerc, M., and Kennedy, J. (2002) The particle swarm - explosion, stability, and convergence in a multidimensional complex space. IEEE Transaction on Evolutionary Computation, 6(1):58--73, February 2002.
• 6: van den Bergh, F. (2002) An Analysis of Particle Swarm Optimizers. PhD thesis, Department of Computer Science, University of Pretoria, Pretoria, South Africa.
• 7: K. Yasuda, A. Ide, and N. Iwasaki. Adaptive particle swarm optimization. Systems, Man and Cybernetics, 2003. IEEE International Conference on, 2:1554--1559, 2003.
• 8: Iwasaki, N., and Yasuda, K. (2005) Adaptive particle swarm optimization using velocity feedback. International Journal of Innovative Computing, Information and Control, 1(3):369--380, September.
• 9: Blackwell, T. M. (2003) Particle swarms and population diversity I: Analysis. In Alwyn M. Barry, editor, GECCO 2003: Proceedings of the Bird of a Feather Workshops, Genetic and Evolutionary Computation Conference, pages 103--107, Chigaco. AAAI.
• 10: Brandstatter, B., and Baumgartner, U. (2002) Particle swarm optimization-mass-spring system analogon. Magnetics, IEEE Transactions on, 38(2):997--1000, 2002.
• 11: Ioan Cristian Trelea, The particle swarm optimization algorithm: convergence analysis and parameter selection, Information Processing Letters, v.85 n.6, p.317-325, 31 March 2003 [doi>10.1016/S0020-0190(02)00447-7]
• 12: Campana, E. F., Fasano, G., and Pinto, A. (2006) Dynamic system analysis and initial particles position in particle swarm optimization. In IEEE Swarm Intelligence Symposium, Indianapolis.
• 13: Campana, E. F., Fasano, G., Peri, D., and Pinto, A. (2006) Particle swarm optimization: Efficient globally convergent modifications. In C. A. Mota Soares et al., editor, Proceedings of the III European Conference on Computational Mechanics, Solids, Structures and Coupled Problems in Engineering, Lisbon, Portugal.
• 14: J. Kennedy , R. Mendes, Population structure and particle swarm performance, Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress, p.1671-1676, May 12-17, 2002
• 15: Mendes, R. (2004). Population Topologies and Their Influence in Particle Swarm Performance. PhD thesis, Departamento de Informatica, Escola de Engenharia, Universidade do Minho, 2004.
• 16: Clerc, M. (2006) Stagnation analysis in particle swarm optimisation or what happens when nothing happens. Technical Report CSM-460, Department of Computer Science, University of Essex, August 2006.
• 17: Kadirkamanathan, V., Selvarajah, K., and Fleming, P. J. (2006) Stability analysis of the particle dynamics in particle swarm optimizer. IEEE Trans. Evolutionary Computation, 10(3):245--255.
• 18: Poli, R., Langdon, W. B., Clerc, M., and Stephens, C. R. (2007) Continuous optimisation theory made easy? Finite-element models of evolutionary strategies, genetic algorithms and particle swarm optimizers. Proceedings of the Foundations of Genetic Algorithms (FOGA) workshop.
• 19: Kennedy, J. (2003) Bare bones particle swarms. Proceedings of the IEEE Swarm Intelligence Symposium, 80--87. Indianapolis, IN.
• 20: M. Blackwell, Particle swarms and population diversity, Soft Computing - A Fusion of Foundations, Methodologies and Applications, v.9 n.11, p.793-802, November 2005 [doi>10.1007/s00500-004-0420-5]
• 21: AuYeung, S. W. M. (2003) Finding Probability Distributions from Moments, Master's Thesis, Imperial College, London.
• 22: Lakhany, A. and H. Mausser (2000), Estimating the Parameters of the Generalized Lambda Distribution, Algo Research Quarterly, 3(3): 47--58.
• 23: Ramberg, J. S., Dudewicz, E. J., Tadikamalla, P. R. and Mykytka, E. F. (1979), A probability distribution and its uses in fitting data, Technometrics, 21(2):201--214.
• 24: Riccardo Poli , David Broomhead, Exact analysis of the sampling distribution for the canonical particle swarm optimiser and its convergence during stagnation, Proceedings of the 9th annual conference on Genetic and evolutionary computation, July 07-11, 2007, London, England [doi>10.1145/1276958.1276977]

INDEX TERMS

Primary Classification:
  I. Computing Methodologies
  I.2 ARTIFICIAL INTELLIGENCE
      I.2.8 Problem Solving, Control Methods, and Search
          Subjects: Heuristic methods

General Terms:
Algorithms, Performance

Keywords:
particle swarm optimisation, theory