Abstract
A wolf pack can hunt prey efficiently due to reasonable social team hierarchy and effective team cooperation. Inspired by the collective intelligence of wolf pack, in this paper, a novel swarm algorithm named the social team building optimization (STBO) algorithm is proposed for solving optimization problems. In order to mimic the method of social team building, which is an optimization process in reality, STBO algorithm is in terms of social team hierarchy, team building state and process control. Firstly, the social team model separates individuals of population into different swarms according to the appropriate team hierarchy. In this way, the proposed algorithm not only has fast search speed but also avoids to fall into the local optimum prematurely. Secondly, the team building state model divides the optimization process into three states. In different states, individuals at different levels act diverse social behaviors to make the algorithm maintain population diversity and possess better search capability. Thirdly, the team power model is designed to determine the states of optimization process by means of the team power and the team cohesion. The main aim of this model is to make the algorithm have a good balance between exploration and exploitation, namely to find the optimal solutions as possible as it can. Moreover, the mathematical models of STBO are educed by the swarm theory, the state evolution theory and the energy–entropy theory. Meanwhile, the convergence property of the presented algorithm has been analyzed theoretically in this paper. And STBO was compared to three classical nature-inspired algorithms on 11 basic standard benchmark functions and also three state-of-the-art evolutionary methods on CEC2016 competition on learning-based single-objective optimization. Some simulation results have shown the effectiveness and high performance of the proposed approach.
Similar content being viewed by others
References
Adra F, Fleming PJ (2011) Diversity management in evolutionary many-objective optimization. IEEE Trans Evol Comput 15(2):183–195
Bansal JC, Sharma H, Arya KV, Nagar A (2013) Memetic search in artificial bee colony algorithm. Soft Comput 17(10):1911–1928
Chen G, Low CP, Yang Z (2009) Preserving and exploiting genetic diversity in evolutionary programming algorithms. IEEE Trans Evol Comput 13(3):661–673
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(16):6374–6384
Duan X, Wang GG, Kang X, Niu Q, Naterer G, Peng Q (2009) Performance study of mode-pursuing sampling method. Eng Optim 41(1):1–21
Gandomi AH, Alavi AH (2012) Krill herd: a new bio-inspired optimization algorithm. Commun Nonlinear Sci Numer Simul 17(12):4831–4845
Han M-F, Liao S-H, Chang J-Y, Lin C-T (2013) Dynamic group-based differential evolution using a self-adaptive strategy for global optimization problems. Appl Intell 39(1):41–56
Kennedy J (2011) Particle swarm optimization. In: Sammut C, Webb G (eds) Encyclopedia of machine learning. Springer, Boston, pp 760–766
Kephart JO (2011) Learning from nature. Science 331(6018):682–683
Krishnanand KR, Kumar NS, Panigrahi Bijaya K, Rout Pravat K (2009) Comparative study of five bio-inspired evolutionary optimization techniques. In: World congress on nature and biologically inspired computing, NaBIC 2009. IEEE, pp 1231–1236
Lam AYS, Li VOK (2012) Chemical reaction optimization: a tutorial. Memet Comput 4(1):3–17
Liang JJ, Qu BY, Suganthan PN, Chen Q (2014) Problem definitions and evaluation criteria for the CEC 2015 competition on learning-based real-parameter single objective optimization. Technical Report201411A, Computational Intelligence Laboratory, Zhengzhou University, Zhengzhou China and Technical Report, Nanyang Technological University, Singapore
Mezura-Montes E, Velázquez-Reyes J, Coello Coello CA (2006) A comparative study of differential evolution variants for global optimization. In: Proceedings of the 8th annual conference on genetic and evolutionary computation. ACM, pp 485–492
Poláková R, Tvrdík J, Bujok P (2016) L-shade with competing strategies applied to CEC2015 learning-based test suite. In: 2016 IEEE congress on evolutionary computation (CEC). IEEE. pp 4790–4796
Postmes T, Branscombe NR (2010) Rediscovering social identity. Psychology, Hove
Rajabioun R (2011) Cuckoo optimization algorithm. Appl Soft Comput 11(8):5508–5518
Rogers H (1987) Theory of recursive functions and effective computability. MIT Press, Cambridge
Rueda Torres JL, Erlich I (2016) Solving the CEC2016 real-parameter single objective optimization problems through MVMO-PHM. Technical report
Shadbolt N (2004) Nature-inspired computing. IEEE Intell Syst 19(1):2–3
Stephen D, Reicher S, Haslam A, Platow Michael J (2007) The new psychology of leadership. Sci Am Mind 18(4):22–29
Tajfel H (1982) Social psychology of intergroup relations. Annu Rev Psychol 33(1):1–39
Vesterstrom J, Thomsen R (2004) A comparative study of differential evolution, particle swarm optimization, and evolutionary algorithms on numerical benchmark problems. In: Congress on evolutionary computation, CEC2004, vol 2. IEEE, pp 1980–1987
Yang E, Barton NH, Arslan T, Erdogan AT (2008) A novel shifting balance theory-based approach to optimization of an energy-constrained modulation scheme for wireless sensor networks. In: IEEE congress on evolutionary computation, CEC 2008 (IEEE world congress on computational intelligence). IEEE, pp 2749–2756
Zelinka I, Tomaszek L (2016) Competition on learning-based real-parameter single objective optimization by soma swarm based algorithm with SOMA remove strategy. In: 2016 IEEE congress on evolutionary computation (CEC). IEEE, pp 4981–4987
Acknowledgements
This work was supported in part by the National Natural Science Foundation of China under Grant Nos. 61472139 and 61462073, the Information Development Special Funds of Shanghai Economic and Information Commission under Grant No. 201602008, the Open Funds of Shanghai Smart City Collaborative Innovation Center.
Author information
Authors and Affiliations
Corresponding authors
Ethics declarations
Conflict of interest
The authors declare that they have no conflict of interest.
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
About this article
Cite this article
Feng, X., Xu, H., Wang, Y. et al. The social team building optimization algorithm. Soft Comput 23, 6533–6554 (2019). https://doi.org/10.1007/s00500-018-3303-x
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00500-018-3303-x