Skip to main content
SpringerLink
Log in

A simplified and efficient particle swarm optimization algorithm considering particle diversity

  • Published:
Cluster Computing Aims and scope Submit manuscript

Abstract

In this paper, a dynamic self-adapting and simple particle swarm optimization algorithm with the disturbed extremum and crossover is proposed in order to improve the problem of particle swarm optimization in dealing with high-dimensional multi-extremum problem which is easy to fall into the local extremum and the accuracy of search and speed of the rapid decline problem in the late evolution. The dynamic self-adapting inertia weight and simplified speed equation strategy reduce the computational difficulty of the algorithm and improve the problem of slow convergence and low precision of the evolutionary algorithm due to the particle divergence caused by the velocity term; Extreme value perturbation and hybridization strategies are used to adjust the global extremes and individual positions of the particles to ensure the diversity and vigor of the particles in the late evolutionary period, and improve the ability of the particles to get rid of the local extremes. Three sets of computational experiments are carried out to compare and evaluate the search speed, convergence accuracy and population diversity of the improved algorithm, the results show that the improved algorithm has obtained a very good optimization effect and improved the practicability of the particle swarm optimization algorithm. It shows that the improved algorithm has improved the search speed, precision and population diversity of the optimization algorithm which improves the practicability of the particle swarm algorithm and achieves the expected effect.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15

Similar content being viewed by others

References

  1. Dongfeng, W., Li, M.: Performance analysis and selection of PSO algorithm. Acta Automatica Sinica 42(10), 1552–1561 (2016)

    MATH  Google Scholar 

  2. Ayati, M., Zanousi, M.P.: Fuzzy PSO-based algorithm for controlling base station movements in a wireless sensor network. Turk. J. Electr. Eng. Comput. Sci. 24(6), 5068–5077 (2016)

    Article  Google Scholar 

  3. Gharghan, S.K., Nordin, R., Ismail, M., Ali, J.A.: Accurate wireless sensor localization technique based on hybrid PSO-ANN algorithm for indoor and outdoor track cycling. IEEE Sens. J. 16(2), 529–541 (2016)

    Article  Google Scholar 

  4. Kamboj, V.K.: A novel hybrid PSO-GWO approach for unit commitment problem. Neural Comput. Appl. 27(6), 1643–1655 (2016)

    Article  Google Scholar 

  5. Fengli, J., Zhang, Y., Yonggang, W.: Adaptive particle swarm optimization algorithm based on guiding strategy. Appl. Res. Comput. 34(12), 1596–1602 (2017)

    Google Scholar 

  6. Li, J., Chong, W., Li, B., Fang, G.: Elite opposition-based particle swarm optimization based on disturbances. Appl. Res. Comput. 33(9), 2584–2587 (2016)

    Google Scholar 

  7. Yue, T., Guanzheng, T., Shuguang, D.: Improved particle swarm optimization algorithm based on genetic crossover and multi-chaotic strategies. Appl. Res. Comput. 33(8), 6–12 (2016)

    Google Scholar 

  8. Cheng, B., Lu, H., Huang, Y., Xu, K.: Particle swarm optimization algorithm based on self-adaptive excellence coefficients for solving traveling salesman problem. J. Comput. Appl. 37(3), 750–754 (2017)

    Google Scholar 

  9. Hu, W., Li, Z.S.: A simpler and more effective particle swarm optimization algorithm. J. Softw. 18(4), 861–868 (2007)

    Article  Google Scholar 

  10. Jordehi, A.R.: Enhanced leader PSO (ELPSO): a new PSO variant for solving global optimisation problems. Appl. Soft Comput. 26, 401–417 (2015)

    Article  Google Scholar 

  11. Sahu, R.K., Panda, S., Sekhar, G.C.: A novel hybrid PSO-PS optimized fuzzy PI controller for AGC in multi area interconnected power systems. Int. J. Electr. Power Energy Syst. 64, 880–893 (2015)

    Article  Google Scholar 

  12. Ji, G.L.: Preliminary research on abnormal brain detection by wavelet-energy and quantum-behaved PSO. Technol. Health Care 24(s2), 641–649 (2016)

    Article  Google Scholar 

  13. Li, W.F., Liang, X.L., Zhang, Y.: Research on PSO with clusters and heterogeneity. ACTA Electronica Sinica 40(11), 2194–2199 (2012)

    Google Scholar 

  14. CE, L., Baoyun, W., Hao, G.: The feature selection based on adaptive particle swarm optimization. Comput. Technol. Dev. 27(4), 89–93 (2017)

    Google Scholar 

  15. Unler, A., Murat, A.: A discrete particle swarm optimization method for feature selection in binary classification problems. Eur. J. Oper. Res. 206(3), 528–539 (2010)

    Article  Google Scholar 

  16. Fei, L., Jianchang, L., Shi, H., Fu, Z.: Multi-objective particle swarm optimization algorithm based on decomposition and differential evolution. Control Decis. 3(3), 403–410 (2017)

    MATH  Google Scholar 

  17. Kennedy, J., Eberhart, R.C.: Particle Swarm Optimization, pp. 1942–1948. IEEE Piscataway, Perth (1995)

    Google Scholar 

  18. Shi, Y., Eberhart, R.C.: A modified particle swarm optimizer. In: Proceedings of the IEEE Congress on Evolutionary Computation. IEEE Press, Anchorag, pp. 69–73 (1998)

  19. Clerc, M.: The swarm and the queen: towards a deterministic and adaptive particle swarm optimization. In: Proceedings of the ICEC. Washington, pp. 1951–1957 (1999)

  20. Clerc, M., Kennedy, J.: The particle swarm: explosion stability and convergence in a multidimensional complex space. IEEE Trans. Evol. Comput. 6(1), 58–73 (2002)

    Article  Google Scholar 

  21. Hu, J., Hu, W., Feng, Y.I.N.: Unification and simplification for position updating formulas in particle swarm optimization. Scientia Sinic Informationis 46(11), 1676–1692 (2016)

    Article  Google Scholar 

  22. Mendes, R., Kennedy, J., Neves, J.: Watch why neighbor or how the swarm can learn from its environment. In: Proceedings of Swarm Intelligence Symposium. IEEE Press, Indianapolis, pp. 88–94 (2003)

  23. Kennedy, J.: Stereotyping: improving particle swarm performance with cluster analysis. Congr. Evolut. Comput. 2(2), 1507–1512 (2000)

    Google Scholar 

  24. Ling, H.-L., Zheng, W.-S.: How many clusters? A robust PSO-based local density model. Neurocomputing 27, 264–275 (2016)

    Article  Google Scholar 

  25. Kar, S., Sharma, K.D., Maitra, M.: Gene selection from microarray gene expression data for classification of cancer subgroups employing PSO and adaptive k-nearest neighborhood technique. Expert Syst. Appl. 42(1), 612–627 (2015)

    Article  Google Scholar 

  26. Zhang, Y., Wang, S., Ji, G.: A comprehensive survey on particle swarm optimization algorithm and its applications. Math. Probl. Eng. 1, 1–38 (2015)

    MathSciNet  MATH  Google Scholar 

  27. Guochu, C.: Simplified particle swarm optimization algorithm based on particles classification. In: Proceedings of the 6th International Conference on Natural Computation, pp. 2701–2705 (2010)

  28. Pedersen, M.E.H., Chepperfield, A.J.: Simplifying particle swarm optimization. Appl. Soft Comput. J. 10(2), 618–628 (2010)

    Article  Google Scholar 

  29. Martins, C.H., dos Santos, R.P.B., Santos, F.L.: Simplified particle swarm optimization algorithm. Acta Scientiarum-Technol. 34(1), 21–25 (2012)

    Article  Google Scholar 

  30. Parente, E.B., de Melo, A.M.: A hybrid PSO-GA algorithm for optimization of laminated composites. Struct. Multidiscip. Optim. 55(6), 2111–2130 (2017)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

This work is supported by the National Natural Science Foundation of China (No. 70160376), the Natural Science Foundation of Hubei Province (No. 2016CFB490), the China Postdoctoral Special Science Foundation (No. 2017T100560) and Hubei Logistic Development Research Center Sponsored Project.

Author information

Authors and Affiliations

  1. College of Public Administration of Huazhong University of Science & Technology, Wuhan, 430074, China

    Ya Bi

  2. School of Logistics and Engineering Management, Hubei University of Economics, Wuhan, 430205, China

    Ya Bi & Mei Xiang

  3. Accadis Hochschule Bad Homburg, 61352, Frankfurt, Germany

    Florian Schäfer

  4. Univ Manchester, Manchester, Lancs, M13 9PL, UK

    Alan Lebwohl

  5. School of Management, Wuhan University of Technology, Wuhan, 430070, China

    Cunfa Wang

  6. Fujian Zhuozhi Project Investment Consulting Co., LTD, Wuhan, 430060, China

    Cunfa Wang

Authors
  1. Ya Bi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mei Xiang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Florian Schäfer
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Alan Lebwohl
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Cunfa Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ya Bi.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Bi, Y., Xiang, M., Schäfer, F. et al. A simplified and efficient particle swarm optimization algorithm considering particle diversity. Cluster Comput 22 (Suppl 6), 13273–13282 (2019). https://doi.org/10.1007/s10586-018-1845-4

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10586-018-1845-4

Keywords

Search

Navigation