Skip to main content
Springer Nature Link
Log in

Comparison between SSA and SSO algorithm inspired in the behavior of the social spider for constrained optimization

  • Published:
Artificial Intelligence Review Aims and scope Submit manuscript

Abstract

The heuristic algorithms are often used to find solutions to real complex world problems. In this paper, the Social Spider Algorithm (SSA) and Social Spider Optimization (SSO) which are heuristic algorithms created upon spider behaviors are considered. Performances of both algorithms are compared with each other from six different items. These are; fitness values of spider population which are obtained in different dimensions, number of candidate solution obtained in each iteration, the best value of candidate solutions obtained in each iteration, the worst value of candidate solutions obtained in each iteration, average fitness value of candidate solutions obtained in each iteration and running time of each iteration. Obtained results of SSA and SSO are applied to the Wilcoxon signed-rank test. Various unimodal, multimodal, and hybrid standard benchmark functions are studied to compare each other with the performance of SSO and SSA. Using these benchmark functions, performances of SSO and SSA are compared with well-known evolutionary and recently developed methods in the literature. Obtained results show that both heuristic algorithms have advantages to another from different aspects. Also, according to other algorithms have good performance.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  • Abualigah, L., Diabat, A., Mirjalili, S., Elaziz, M.A., Gandomi, A.H., (2021). The Arithmetic Optimization Algorithm, Comput. Methods Appl. Mech. Engrg. 376, 113609.

  • Acılar, A.M. Fuzzy System Design by Using Passive Immunity Algorithms, Konya, Turkey, 2013 (Ph.D. thesis) (in Turkish).

  • Baş E, Ülker E (2020a) A binary social spider algorithm for continuous optimization task. Soft Comput. https://doi.org/10.1007/s00500-020-04718-w

    Article  Google Scholar 

  • Baş, E., Ülker, E. (2020b). An efficient binary social spider algorithm for feature selection problem, Expert Systems With Applications 146, 113185.

  • Baş E, Ülker E (2020c) Discrete social spider algorithm for the traveling salesman problem. Artif Intell Rev. https://doi.org/10.1007/s10462-020-09869-8

    Article  Google Scholar 

  • Baş, E., Ülker, E. (2020d). A binary social spider algorithm for uncapacitated facility location problem, Expert Systems with Applications 161, 113618.

  • Baş E, Ülker E (2020e) Improved social spider algorithm for large scale constrained optimization. Artif Intell Rev. https://doi.org/10.1007/s10462-020-09931-5

    Article  Google Scholar 

  • Cuevas E, Cienfuegos M, Zaldívar D, Pérez-Cisneros M (2013) A swarm optimization algorithm inspired in the behavior of the social-spider. Expert Syst Appl 40:6374–6384

    Article  Google Scholar 

  • Cuevas E, Cienfuegos M (2014) A new algorithm inspired in the behavior of the social-spider for constrained optimization. Expert Syst Appl 41:412–425

    Article  Google Scholar 

  • El-Bages MS, Elsayed WT (2017) Social spider algorithm for solving the transmission expansion planning problem. Electric Power Syst Res 143:235–243

    Article  Google Scholar 

  • Elsayed WT, Hegazy YG, Bendary FM, El-Bages MS (2016) Modified social spider algorithm for solving the economic dispatch Problem. Eng Sci Technol, Int J 19:1672–1681

    Google Scholar 

  • Ghanim, T., Ajel, A.R., Humaidi,A.J., (2020). Optimal Fuzzy Logic Control for Temperature Control based on Social Spider Optimization, Materials Science and Engineering 745 (2020) 012099 IOP Publishing doi:https://doi.org/10.1088/1757-899X/745/1/012099.

  • Jamil M, Yang XS (2013) A literature survey of benchmark functions for global optimization problems. Int J Math Model Numeric Optim 4(2):150–194. https://doi.org/10.1504/IJMMNO.2013.055204

    Article  MATH  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  • Kavitha, S., Venkumar, P., (2020). A vibrant crossbreed social spider optimization with genetic algorithm tactic for flexible job shop scheduling problem, Measurement and Control 2020, Vol. 53(1–2) 93–103.

  • Kennedy, J., Eberhart, R. (1995). Particle swarm optimization, in Proc. IEEE Int. Conf.Neural Networks, Perth, WA, pp. 1942–1948.

  • Krishnanand, K., Ghose, D. (2005). Detection of multiple source locations using a glowworm metaphor with applications to collective robotics, in Proc. IEEE Swarm Intell. Symposium, Pasadena, CA, pp. 84–91.

  • Kuo RJ, Ferani FE (2015) The gradient evolution algorithm: a new metaheuristic. Inf Sci 316:246–265

    Article  Google Scholar 

  • Long Q, Wu C, Wang X, Wu Z (2017) A modified quasi-secant method for global optimization. Appl Math Model 51:21–37

    Article  MathSciNet  Google Scholar 

  • Luque-Chang A, Cuevas E, Fausto F, Zald-var D, Pérez M (2018) Social spider optimization algorithm: modifications, applications, and perspectives. Math Probl Eng. https://doi.org/10.1155/2018/6843923

    Article  Google Scholar 

  • Mallipeddi R, Suganthan PN, Pan QK (2011) Tasgetiren M.F., Differential evolution algorithm with an ensemble of parameters and mutation strategies. Appl Soft Comput 11:1679–1696

    Article  Google Scholar 

  • Mirjalili, S., (2015). Moth-flame optimization algorithm: A novel nature-inspired heuristic paradigm, Knowl.-based Syst. 89, 228–249.

  • Mirjalili S, Gandomi AH, Mirjalili SZ, Saremi S, Faris H (2017) Salp Swarm algorithm: a bio-inspired optimizer for engineering design problems. Adv Eng Softw 114:163–191. https://doi.org/10.1016/j.advengsoft.2017.07.002

    Article  Google Scholar 

  • Mousa, A., Bentahar, J. (2016). An Efficient QoS-aware Web Services Selection using Social Spider Algorithm, The 13th International Conference on Mobile Systems and Pervasive Computing (MobiSPC 2016), Procedia Computer Science 94, 176 – 182.

  • Parpinelli RS, Lopes HS (2011) New inspirations in swarm intelligence: a survey. Int J Bio-Inspired Comput 3(1):1–16

    Article  Google Scholar 

  • Pereira, L.A.M., Rodrigues, D., Ribeiro, P.B., Papa, J.P., Weber, S.A.T. (2014). Social-spider optimization-based artificial neural networks training and its applications for Parkinson's disease identification, 2014 IEEE 27th International Symposium on Computer-Based Medical Systems, pp. 14–17.

  • Rao RV, Savsani VJ, Vakharia DP (2011) Teaching–learning-based optimization: a novel method for constrained mechanical design optimization problems. Comput Aided Des 43(3):303–315. https://doi.org/10.1016/j.cad.2010.12.015

    Article  Google Scholar 

  • Rashedi E, Nezamabadi-Pour H, Saryazdi S (2009) Gsa: a gravitational search algorithm. Inf Sci 179(13):2232–2248

    Article  Google Scholar 

  • Sadollah A, Sayyaadi H, Yadav A (2018) A dynamic metaheuristic optimization model inspired by biological nervous systems: Neural network algorithm. Appl Soft Comput 71:747–782. https://doi.org/10.1016/j.asoc.2018.07.039

    Article  Google Scholar 

  • Singh PR, Elaziz MA, Xiong S (2018) Modified spider monkey optimization based on nelder-mead method for global optimization. Expert Syst Appl 110:264–289

    Article  Google Scholar 

  • Singh SS, Kumar A, Singh K, Biswas B (2020) IM-SSO: Maximizing influence in social networks using social spider optimization. Wiley. https://doi.org/10.1002/cpe.5421

    Article  Google Scholar 

  • Shayanfar H, Gharehchopogh FS (2018) Farmland fertility: a new metaheuristic algorithm for solving continuous optimization problems. Appl Soft Comput 71:728–746

    Article  Google Scholar 

  • Shukla UP, Nanda SJ (2016) Parallel social spider clustering algorithm for high dimensional datasets. Eng Appl Artif Intell 56:75–90

    Article  Google Scholar 

  • Shukla UP, Nanda SJ (2018) A Binary Social Spider Optimization algorithm for unsupervised band selection in compressed hyperspectral images. Expert Syst Appl 97:336–356

    Article  Google Scholar 

  • Sun S, Qi H, Sun J, Ren Y, Ruan L (2017) Estimation of thermophysical properties of phase change material by the hybrid SSO algorithms. Int J Therm Sci 120:121–135

    Article  Google Scholar 

  • Surjanovic, S., Bingham, D. (2017). A virtual library of simulation experiments: test functions and datasets, https://www.sfu.ca/~ssurjano/index.html.

  • Talbi EG (2009) Metaheuristics: from design to implementation. Wiley

    Book  Google Scholar 

  • Yang X-S, Karamanoglu M, He X (2014) Flower pollination algorithm: a novel approach for multiobjective optimization. Eng Optim 46(9):1222–1237

    Article  MathSciNet  Google Scholar 

  • Yelghi A, Köse C (2018) A modified firefly algorithm for global minimum optimization. Appl Soft Comput 62:29–44

    Article  Google Scholar 

  • Yu JJQ, Li VOK (2015a) A social spider algorithm for global optimization. Appl Soft Comput 30:614–627

    Article  Google Scholar 

  • Yu, J.J.Q., Li, V.O.K. (2015b). Parameter sensitivity analysis of Social Spider Algorithm, 2015 IEEE Congress on Evolutionary Computation (CEC), DOI: https://doi.org/10.1109/CEC.2015.7257289.

  • Yu, J.J.Q., Li, V. O. K. (2016). A social spider algorithm for solving the non-convex economic load dispatch problem. Neurocomputing, 171(C), 955–965.

  • Xiao J, Li L (2011) A hybrid ant colony optimization for continuous domains. Expert Syst Appl 38:11072–11077

    Article  Google Scholar 

  • Zhang, Y., Jin, Z., (2020). Group teaching optimization algorithm: A novel metaheuristic method for solving global optimization problems, Expert Systems With Applications 148, 113246.

  • Zhao W, Wang L (2016) An effective bacterial foraging optimizer for global optimization. Inf Sci 329(2016):719–735

    Article  Google Scholar 

  • Zhou G, Zhao R, Luo Y (2020) Optimal hydropower station dispatch using quantum social spider optimization algorithm. Wiley. https://doi.org/10.1002/cpe.5782

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Kulu Vocational School, Selçuk University, 42075, Konya, Turkey

    Emine Baş

  2. Department of Computer Engineering, Faculty of Engineering and Nature Sciences, Konya Technical University, 42075, Konya, Turkey

    Erkan Ülker

Authors
  1. Emine Baş
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Erkan Ülker
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Emine Baş.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Baş, E., Ülker, E. Comparison between SSA and SSO algorithm inspired in the behavior of the social spider for constrained optimization. Artif Intell Rev 54, 5583–5631 (2021). https://doi.org/10.1007/s10462-021-10035-x

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10462-021-10035-x

Keywords