Neighborhood Re-structuring in Particle Swarm Optimization

  • Arvind S. Mohais
  • Rui Mendes
  • Christopher Ward
  • Christian Posthoff
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3809)

Abstract

This paper considers the use of randomly generated directed graphs as neighborhoods for particle swarm optimizers (PSO) using fully informed particles (FIPS), together with dynamic changes to the graph during an algorithm run as a diversity-preserving measure. Different graph sizes, constructed with a uniform out-degree were studied with regard to their effect on the performance of the PSO on optimization problems. Comparisons were made with a static random method, as well as with several canonical PSO and FIPS methods. The results indicate that under appropriate parameter settings, the use of random directed graphs with a probabilistic disruptive re-structuring of the graph produces the best results on the test functions considered.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proc. of IEEE International Conference on Neural Networks, pp. 1942–1948. IEEE Press, Los Alamitos (1995)CrossRefGoogle Scholar
  2. 2.
    Kennedy, J., Eberhart, R., Shi, Y.: Swarm Intelligence. Morgan Kaufmann, San Francisco (2001)Google Scholar
  3. 3.
    Mendes, R.: Population Toplogies and Their Influence in Particle Swarm Performance. PhD thesis, Universidade do Minho, Braga, Portugal (2004)Google Scholar
  4. 4.
    Ashlock, D., Smucker, M., Walker, J.: Graph based genetic algorithms. In: Proc. of the IEEE Congress on Evolutionary Computation, pp. 1362–1368. IEEE Press, Los Alamitos (1999)Google Scholar
  5. 5.
    Kennedy, J.: Stereotyping: Improving particle swarm performance with cluster analysis. In: Proc. of the IEEE Congress on Evolutionary Computation, pp. 1507–1512 (2000)Google Scholar
  6. 6.
    Suganthan, P.N.: Particle swarm optimiser with neighbourhood operator. In: Proc. of the IEEE Congress on Evolutionary Computation, pp. 1958–1962. IEEE Press, Los Alamitos (1999)Google Scholar
  7. 7.
    Mohais, A., Ward, C., Posthoff, C.: Randomized directed neighborhoods with edge migration in particle swarm optimization. In: Proc. of the 2004 IEEE Congress on Evolutionary Computation, pp. 548–555. IEEE Press, Los Alamitos (2004)CrossRefGoogle Scholar
  8. 8.
    Clerc, M., Kennedy, J.: The particle swarm - explosion, stability, and convergence in a multidimensional complex space. IEEE Transactions on Evolutionary Computation 6, 58–73 (2002)CrossRefGoogle Scholar
  9. 9.
    Mendes, R., Kennedy, J., Neves, J.: The fully informed particle swarm: Simple, maybe better. IEEE Transactions on Evolutionary Computation 8, 204–210 (2004)CrossRefGoogle Scholar
  10. 10.
    Gouri, K., Bhattacharyya, R.A.J.: Statistical Concepts and Methods (May 1977)Google Scholar
  11. 11.
    Holm, S.: A simple sequentially rejective multiple test procedure. Scandinavian Journal of Statistics 6, 65–70 (1979)MATHMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Arvind S. Mohais
    • 1
  • Rui Mendes
    • 2
  • Christopher Ward
    • 1
  • Christian Posthoff
    • 1
  1. 1.The University of the West IndiesSt. AugustineTrinidad
  2. 2.Universidade do MinhoBragaPortugal

Personalised recommendations