[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ Skip to main content
Springer Nature Link
Log in

A binary social spider algorithm for continuous optimization task

  • Methodologies and Application
  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

The social spider algorithm (SSA) is a new heuristic algorithm created on spider behaviors. The original study of this algorithm was proposed to solve continuous problems. In this paper, the binary version of SSA (binary SSA) is introduced to solve binary problems. Currently, there is insufficient focus on the binary version of SSA in the literature. The main part of the binary version is at the transfer function. The transfer function is responsible for mapping continuous search space to discrete search space. In this study, four of the transfer functions divided into two families, S-shaped and V-shaped, are evaluated. Thus, four different variations of binary SSA are formed as binary SSA-Tanh, binary SSA-Sigm, binary SSA-MSigm and binary SSA-Arctan. Two different techniques (SimSSA and LogicSSA) are developed at the candidate solution production schema in binary SSA. SimSSA is used to measure similarities between two binary solutions. With SimSSA, binary SSA’s ability to discover new points in search space has been increased. Thus, binary SSA is able to find global optimum instead of local optimums. LogicSSA which is inspired by the logic gates and a popular method in recent years has been used to avoid local minima traps. By these two techniques, the exploration and exploitation capabilities of binary SSA in the binary search space are improved. Eighteen unimodal and multimodal standard benchmark optimization functions are employed to evaluate variations of binary SSA. To select the best variations of binary SSA, a comparative study is presented. The Wilcoxon signed-rank test has applied to the experimental results of variations of binary SSA. Compared to well-known evolutionary and recently developed methods in the literature, the variations of binary SSA performance is quite good. In particular, binary SSA-Tanh and binary SSA-Arctan variations of binary SSA showed superior 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
£29.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 includes VAT (United Kingdom)

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5

Similar content being viewed by others

Explore related subjects

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

References

  • Acılar AM (2013) Yapay Bağışıklık Algoritmaları Kullanılarak Bulanık Sistem Tasarımı, Konya, Turkey. Ph.D. thesis (in Turkish)

  • Aslan M, Gunduz M, Kiran MS (2019) JayaX: Jaya algorithm with xor operator for binary optimization. Appl Soft Comput J 82:105576

    Google Scholar 

  • Babaoglu I, Findik O, Ulker E (2010) A comparison of feature selection models utilizing binary particle swarm optimization and genetic algorithm in determining coronary artery disease using support vector machine. Expert Syst Appl 37:3177–3183

    Google Scholar 

  • Beskirli M, Koc I, Hakli H, Kodaz H (2018) A new optimization algorithm for solving wind turbine placement problem: binary artificial algae algorithm. Renew Energy 121:301–308

    Google Scholar 

  • Choi SS, Cha SH, Tappert CC (2010) A survey of binary similarity and distance measures. J Syst Cybern Inform 8(1):43–48

    Google Scholar 

  • Çınar AC, Kiran MS (2018) Similarity and logic gate-based tree-seed algorithms for binary optimization. Comput Ind Eng 115:631–646

    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

    Google Scholar 

  • Derrac J, García S, Molina D, Herrera F (2011) A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm Evol Comput 1:3–18

    Google Scholar 

  • Dorigo M (1990) Optimization learning and natural algorithms. Politecnico di Milano, Italie, Ph.D. thesis

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

    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 

  • Emary E, Zawbaa HM, Hassanien AE (2016) Binary grey wolf optimization approaches for feature selection. Neurocomputing 172:371–381

    Google Scholar 

  • Fan K, Weijia Y, Li Y (2013) An effective modified binary particle swarm optimization (mBPSO) algorithm for multi-objective resource allocation problem (MORAP). Appl Math Comput 221:257–267

    MathSciNet  MATH  Google Scholar 

  • Holland JH (1975) Adaptation in natural and artificial systems. University of Michigan Press, Ann Arbor

    Google Scholar 

  • Jaccard P (1901) Etude comparative de la distribution florale dans une portion des Alpes et du Jura: Impr. Corbaz

  • Jamil M, Yang XS (2013) A literature survey of benchmark functions for global optimization problems. Int J Math Model Numer Optim 4:150–194

    MATH  Google Scholar 

  • Jiang F, Xia H, Tran QA, Ha QM, Tran NQ, Hu J (2017) A new binary hybrid particle swarm optimization with wavelet mutation. Knowl Based Syst 130:90–101

    Google Scholar 

  • Karaboga D (2005) An idea based on honey bee swarm for numerical optimization. Erciyes University, Engineering Faculty, Computer Engineering Department, Kayseri, Turkey, pp 1–10. Ph.D. thesis (in Turkish)

  • Kennedy J, Eberhart R (1995) Particle swarm optimization. In: Proceedings of IEEE international conference on neural networks, Perth, WA, pp 1942–1948

  • Kennedy J, Eberhart R (1997) A discrete binary version of the particle swarm algorithm. In: Proceedings of the IEEE international conference on computational cybernetics and simulation. https://doi.org/10.1109/icsmc.1997.637339

  • Kiran MS, Gunduz M (2013) XOR-based artificial bee colony algorithm for binary optimization. Turk J Electr Eng Comput Sci 21:2307–2328

    Google Scholar 

  • Korkmaz S, Babalik A, Servet KM (2017) An artificial algae algorithm for solving binary optimization problems. J Mach Learn Cybern, Int. https://doi.org/10.1007/s13042-017-0772-7

    Book  Google Scholar 

  • Kurt M, Semetay C (2001) Genetik Algoritma ve Uygulama Alanları. Turk J Mühendis ve Makina 42(501):19–24 (in Turkish)

    Google Scholar 

  • Ling W, Fu X, Menhas M, Fei M (2010a) A modified binary differential evolution algorithm. In: Li K, Fei M, Jia L, Irwin GW (eds) Life system modeling and intelligent computing, vol 6329. Springer, Berlin, pp 49–57

    Google Scholar 

  • Ling W, Xu Y, Mao Y, Fei M (2010b) A discrete harmony search algorithm. In: Li K, Fei M, Jia L, Irwin GW (eds) Life system modeling and intelligent computing, vol 98. Springer, Berlin, pp 37–43

    Google Scholar 

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

    Google Scholar 

  • Mirjalili S, Lewis A (2013) S-shaped versus V-shaped transfer functions for binary particle swarm optimization. Swarm Evol Comput 9:1–14

    Google Scholar 

  • Mirjalili S, Mohd Hashim SZ (2012) BMOA: binary magnetic optimization algorithm. Int J Mach Learn Comput 2(3):204–208

    Google Scholar 

  • Mousa A, Bentahar J (2016) An efficient QoS-aware web services selection using social spider algorithm. In: The 13th international conference on mobile systems and pervasive Computing (MobiSPC 2016), procedia computer science, vol 94, pp 176–182

  • Omkar S, Senthilnath J, Khandelwal R, Naik GN, Gopalakrishnan S (2011) Artificial bee colony (ABC) for multi-objective design optimization of composite structures. Appl Soft Comput 11:489–499

    Google Scholar 

  • Pal A, Maiti J (2010) Development of a hybrid methodology for dimensionality reduction in Mahalanobis–Taguchi system using Mahalanobis distance and binary particle swarm optimization. Expert Syst Appl 37:1286–1293

    Google Scholar 

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

    Google Scholar 

  • Pereira LAM, Rodrigues D, Ribeiro PB, Papa JP, Weber SAT (2014) Social-spider optimization-based artificial neural networks training and its applications for Parkinson’s disease identification. In: 2014 IEEE 27th international symposium on computer-based medical systems, pp 14–17

  • Prescilla K, Immanuel SA (2013) Modified binary particle swarm optimization algorithm application to real-time task assignment in a heterogeneous multiprocessor. Microprocess Microsyst 37:583–589

    Google Scholar 

  • Qiao LY, Peng XY, Peng Y (2006) BPSO-SVM wrapper for feature subset selection. Dianzi Xuebao (Acta Electron Sin) 34:496–498

    Google Scholar 

  • Rashedi E, Nezamabadi-pour H, Saryazdi S (2009) BGSA: binary gravitational search algorithm. Nat Comput 9(3):727–745

    MathSciNet  MATH  Google Scholar 

  • Rizk-Allah RM (2014) A novel multi-ant colony optimization for multi-objective resource allocation problems. Int J Math Arch 5:183–192

    Google Scholar 

  • Rizk-Allah RM (2018) Hybridizing sine cosine algorithm with a multi-orthogonal search strategy for engineering design problems. J Comput Des Eng 5:249–273

    Google Scholar 

  • Rizk-Allah RM, Hassanien AE (2018) New binary bat algorithm for solving 0–1 knapsack problem. Complex Intell Syst 4:31–53

    Google Scholar 

  • Rizk-Allah RM, Hassanien AE, Elhoseny M, Gunasekaran M (2018) A new binary salp swarm algorithm: development and application for optimization tasks. Neural Comput Appl. https://doi.org/10.1007/s00521-018-3613

    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

    Google Scholar 

  • Sun S, Qi H, Sun Jianping, 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

    Google Scholar 

  • Surjanovic S, Bingham D (2019) Virtual library of simulation experiments: test functions and datasets. http://www.sfu.ca/ssurjano

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

    MATH  Google Scholar 

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

    Google Scholar 

  • Yu JJQ, Li VOK (2016) A social spider algorithm for solving the non-convex economic load dispatch problem. Neurocomputing 171(C):955–965

    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 in PubMed Google Scholar

  2. Erkan Ülker
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Emine Baş.

Ethics declarations

Conflict of interest

There is no conflict of interest between the authors to publish this manuscript.

Additional information

Communicated by V. Loia.

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. A binary social spider algorithm for continuous optimization task. Soft Comput 24, 12953–12979 (2020). https://doi.org/10.1007/s00500-020-04718-w

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-020-04718-w

Keywords

Search

Navigation