Skip to main content

Re-diversified Particle Swarm Optimization

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6329))

Abstract

The tendency to converge prematurely is a main limitation which affects the performacne of evolutionary computation algorithm, including particle swarm optimization (PSO). To overcome the limitation, we propose an extended PSO algorithm, called re-diversified particle swarm optimization (RDPSO). When population diversity is small, i.e., particles’s velocity approches zero and the algorithm stagnates, a restart approach called diversification mechanism begins to work, which disperses particles and lets them leave bad positions. Based on the diversity calculated by the particles’ current positions, the algorithm decides when to start the diversification mechanism and when to return the usual PSO. We testify the performance of the proposed algorithm on a 10 benchmark functions and provide comparisons with 4 classical PSO variants. The numerical experiment results show that the RDPSO has superior performace in global optimization, especially for those complex multimodal functions whose solution is difficult to be found by the other tested algorithm.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Kennedy, J., Eberhart, R.: Particle Swarm Optimization. In: 4th IEEE International Conference on Neural Networks, pp. 1942–1948. IEEE Press, Piscataway (1995)

    Google Scholar 

  2. Tasgetiren, M.F., Liang, Y.C., Sevkli, M., Gencyilmaz, G.: A Particle Swarm Optimization Algorithm for Makespan and Total Flowtime Minimization in the Permutation Flowshop Sequencing Problem. European Journal of Operational Research 177, 1930–1947 (2007)

    Article  MATH  Google Scholar 

  3. Franken, N., Engelbrecht, A.P.: Particle Swarm Optimization Approaches to Coevolve Strategies for the Iterated Prisoner’s Dilemma. IEEE Trans. Evol. Comput. 9, 562–579 (2005)

    Article  Google Scholar 

  4. Ho, S.Y., Lin, H.S., Liauh, W.H., Ho, S.J.: OPSO: Orthogonal Particle Swarm Optimization and Its Application to Task Assignment Problems. IEEE Trans. Syst., Man, Cybern. A, Syst., Humans. 38, 288–298 (2008)

    Google Scholar 

  5. Tchomte, S.K., Gourgand, M.: Particle Swarm Optimization: A Study of Particle Displacement for Solving Continuous and Combinatorial Optimization Problems. Int. J. Production Economics. 121, 57–67 (2009)

    Article  Google Scholar 

  6. Dong, J., Yang, S., Ni, G., Ni, P.: An Improved Particle Swarm Optimization Algorithm for Global. International Journal of Applied Electromagnetics and Mechanics 25, 723–728 (2007)

    Google Scholar 

  7. Poli, R., Kennedy, J., Blackwell, T.: Particle Swarm Optimization: An Overview. Swarm Intelligence 1, 33–57 (2007)

    Article  Google Scholar 

  8. Ratnaweera, A., Halgamuge, S., Watson, H.: Self-Organizing Hierarchical Particle Swarm Optimizer with Time-Varying Acceleration Coefficients. IEEE Trans. Evol. Comput. 8, 240–255 (2004)

    Article  Google Scholar 

  9. Oca, M.A.M., Stützle, T., Birattari, M., Dorigo, M.: Frankenstein’s PSO: A Composite Particle Swarm Optimization Algorithm. IEEE Trans. Evol. Comput. 13, 1120–1132 (2009)

    Article  Google Scholar 

  10. Zhan, Z.H., Zhang, J., Li, Y., Chung, H.S.H.: Adaptive Particle Swarm Optimization. IEEE Trans. Syst., Man, Cybern. B, Cybern. 39, 1362–1380 (2009)

    Article  Google Scholar 

  11. Arumugam, M.S., Rao, M.V.C., Tan, A.W.C.: A Novel and Effective Particle Swarm Optimization like Algorithm with Extrapolation Technique. Applied Soft Computing 9, 308–320 (2009)

    Article  Google Scholar 

  12. Poli, R., Langdon, W.B., Holland, O.: Extending Particle Swarm Optimization via Genetic Programming. In: Keijzer, M., Tettamanzi, A.G.B., Collet, P., van Hemert, J., Tomassini, M. (eds.) EuroGP 2005. LNCS, vol. 3447, pp. 291–300. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  13. Clerc, M., Kennedy, J.: The Particle Swarm-Explosion, Stability and Convergence in a Multidimensional Complex Space. IEEE Trans. Evol. Comput. 6, 5–73 (2002)

    Article  Google Scholar 

  14. Mendes, R., Kennedy, J., Neves, J.: The Fully Informed Particle Swarm: Simpler, Maybe Better. IEEE Trans. Evol. Comput. 8, 204–210 (2004)

    Article  Google Scholar 

  15. Bratton, D., Kennedy, J.: Defining a Standard for Particle Swarm Optimization. In: Proceedings of IEEE Swarm Intelligence Symposium, Honolulu, pp. 120–127 (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Qi, J., Pang, S. (2010). Re-diversified Particle Swarm Optimization. In: Li, K., Fei, M., Jia, L., Irwin, G.W. (eds) Life System Modeling and Intelligent Computing. ICSEE LSMS 2010 2010. Lecture Notes in Computer Science, vol 6329. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15597-0_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-15597-0_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-15596-3

  • Online ISBN: 978-3-642-15597-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics