Skip to main content

In-Depth Insights into Swarm Intelligence Algorithms Performance

  • Conference paper
  • First Online:
  • 351 Accesses

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 1341))

Abstract

Solving hard optimization problems is one of the most important research topics due to the countless applications in different areas. Since solving such problems is of great importance, numerous metaheuristics were developed, many of which belong to the group of swarm intelligence optimization algorithms. In recent decades, there has been an explosion in the number of the proposed swarm intelligence algorithms most commonly compared to other metaheuristics using one statistic such as average or median which can lead to putting algorithms in different rankings even though there are only small differences between them. In order to provide more insights into swarm intelligence algorithms’ performance, a deep statistical comparison is used. Five representative swarm intelligence optimization algorithms are ranked based on the obtained solutions values and their distribution in the search space while solving the CEC2013 benchmark functions. The used analysis differentiates algorithms that have statistically significant performance and measure the qualities of the exploration and the exploitation abilities of the tested algorithms.

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 EPUB and 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

References

  1. Abdel-Basset, M., Shawky, L.A.: Flower pollination algorithm: a comprehensive review. Artif. Intell. Rev. 52(4), 2533–2557 (2018). https://doi.org/10.1007/s10462-018-9624-4

    Article  Google Scholar 

  2. Eftimov, T., Korošec, P.: A novel statistical approach for comparing meta-heuristic stochastic optimization algorithms according to the distribution of solutions in the search space. Inf. Sci. 489, 255–273 (2019)

    Article  MathSciNet  Google Scholar 

  3. Eftimov, T., Korošec, P., Seljak, B.K.: A novel approach to statistical comparison of meta-heuristic stochastic optimization algorithms using deep statistics. Inf. Sci. 417, 186–215 (2017)

    Article  Google Scholar 

  4. Eftimov, T., Petelin, G., Korošec, P.: DSCTool: a web-service-based framework for statistical comparison of stochastic optimization algorithms. Appl. Soft Comput. 87, 105977 (2020)

    Article  Google Scholar 

  5. Eftimov, T., Popovski, G., Kocev, D., Korošec, P.: Performance2vec: a step further in explainable stochastic optimization algorithm performance. In: Proceedings of the Genetic and Evolutionary Computation Conference Companion. In Press (2020)

    Google Scholar 

  6. Hussain, K., Mohd Salleh, M.N., Cheng, S., Shi, Y.: Comparative analysis of swarm-based metaheuristic algorithms on benchmark functions. In: Tan, Y., Takagi, H., Shi, Y. (eds.) ICSI 2017, Part I. LNCS, vol. 10385, pp. 3–11. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-61824-1_1

    Chapter  Google Scholar 

  7. Karaboga, D.: An idea based on honey bee swarm for numerical optimization. Technical Report - TR06, pp. 1–10 (2005)

    Google Scholar 

  8. Karaboga, D., Basturk, B.: Artificial bee colony (ABC) optimization algorithm for solving constrained optimization problems. In: Melin, P., Castillo, O., Aguilar, L.T., Kacprzyk, J., Pedrycz, W. (eds.) IFSA 2007. LNCS (LNAI), vol. 4529, pp. 789–798. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-72950-1_77

    Chapter  MATH  Google Scholar 

  9. Karaboga, D., Basturk, B.: A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm. J. Global Optim. 39(3), 459–471 (2007)

    Article  MathSciNet  Google Scholar 

  10. Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proceedings of the IEEE International Conference on Neural Networks (ICNN ’95), vol. 4, pp. 1942–1948 (1995)

    Google Scholar 

  11. Li, J., Tan, Y.: The bare bones fireworks algorithm: a minimalist global optimizer. Appl. Soft Comput. 62, 454–462 (2018)

    Article  Google Scholar 

  12. Liang, J., Qu, B., Suganthan, P., Hernández-Díaz, A.G.: Problem definitions and evaluation criteria for the CEC 2013 special session on real-parameter optimization. Computational Intelligence Laboratory, Zhengzhou University, Zhengzhou, China and Nanyang Technological University, Singapore, Technical Report 201212 (2013)

    Google Scholar 

  13. Senthilnath, J., Omkar, S., Mani, V.: Clustering using firefly algorithm: performance study. Swarm Evol. Comput. 1(3), 164–171 (2011)

    Article  Google Scholar 

  14. Shan, H., Yasuda, T., Ohkura, K.: A self adaptive hybrid enhanced artificial bee colony algorithm for continuous optimization problems. BioSystems 132, 43–53 (2015)

    Article  Google Scholar 

  15. Tan, Y., Zhu, Y.: Fireworks algorithm for optimization. In: Tan, Y., Shi, Y., Tan, K.C. (eds.) ICSI 2010, Part I. LNCS, vol. 6145, pp. 355–364. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-13495-1_44

    Chapter  Google Scholar 

  16. Tuba, E., Mrkela, L., Tuba, M.: Support vector machine parameter tuning using firefly algorithm. In: 26th International Conference Radioelektronika, pp. 413–418. IEEE (2016)

    Google Scholar 

  17. Tuba, E., Strumberger, I., Bacanin, N., Jovanovic, R., Tuba, M.: Bare bones fireworks algorithm for feature selection and SVM optimization. In: 2019 IEEE Congress on Evolutionary Computation (CEC), pp. 2207–2214. IEEE (2019)

    Google Scholar 

  18. Tuba, E., Tuba, M., Beko, M.: Two stage wireless sensor node localization using firefly algorithm. In: Yang, X.-S., Nagar, A.K., Joshi, A. (eds.) Smart Trends in Systems, Security and Sustainability. LNNS, vol. 18, pp. 113–120. Springer, Singapore (2018). https://doi.org/10.1007/978-981-10-6916-1_10

    Chapter  Google Scholar 

  19. Tuba, E., Tuba, M., Dolicanin, E.: Adjusted fireworks algorithm applied to retinal image registration. Stud. Inf. Control 26(1), 33–42 (2017)

    Google Scholar 

  20. Yang, X.-S.: Firefly algorithms for multimodal optimization. In: Watanabe, O., Zeugmann, T. (eds.) SAGA 2009. LNCS, vol. 5792, pp. 169–178. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-04944-6_14

    Chapter  Google Scholar 

  21. Yang, X.-S.: Flower pollination algorithm for global optimization. In: Durand-Lose, J., Jonoska, N. (eds.) UCNC 2012. LNCS, vol. 7445, pp. 240–249. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-32894-7_27

    Chapter  Google Scholar 

  22. Zambrano-Bigiarini, M., Clerc, M., Rojas, R.: Standard particle swarm optimisation 2011 at CEC-2013: a baseline for future PSO improvements, pp. 2337–2344 (2013). https://doi.org/10.1109/CEC.2013.6557848

Download references

Acknowledgement

The authors acknowledge the financial support from the Slovenian Research Agency (research core funding No. P2-0098, and project Z2-1867). We also acknowledge support by COST Action CA15140 “Improving Applicability of Nature-Inspired Optimisation by Joining Theory and Practice (ImAppNIO)”.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Eva Tuba .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Tuba, E., Korošec, P., Eftimov, T. (2021). In-Depth Insights into Swarm Intelligence Algorithms Performance. In: Simian, D., Stoica, L.F. (eds) Modelling and Development of Intelligent Systems. MDIS 2020. Communications in Computer and Information Science, vol 1341. Springer, Cham. https://doi.org/10.1007/978-3-030-68527-0_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-68527-0_21

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-68526-3

  • Online ISBN: 978-3-030-68527-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics