Skip to main content

Advertisement

Log in

A novel life choice-based optimizer

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

Abstract

This paper presents a novel metaheuristic algorithm named as life choice-based optimizer (LCBO) developed on the typical decision-making ability of humans to attain their goals while learning from fellow members. LCBO is investigated on 29 popular benchmark functions which included six CEC-2005 functions, and its performance has been benchmarked against seven optimization techniques including recent ones. Further, different abilities of LCBO optimization algorithm such as exploitation, exploration and local minima avoidance were also investigated and have been reported. In addition to this, scalability is tested for several benchmark functions where dimensions have been varied till 200. Furthermore, two engineering optimization benchmark problems, namely pressure vessel design and cantilever beam design, were also optimized using LCBO and the results have been compared with recently reported other algorithms. The obtained comparative results in all the above-mentioned experimentations revealed the clear superiority of LCBO over the other considered metaheuristic optimization algorithms. Therefore, based on the presented investigations, it is concluded that LCBO is a potential optimizer for engineering problems.

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

Access this article

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

Instant access to the full article PDF.

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

Similar content being viewed by others

References

  • Abbass H (2002) MBO: marriage in honey bees optimization-a Haplometrosis polygynous swarming approach. Inst Electr Electron Eng 1:207–214

    Google Scholar 

  • Abedinpourshotorban H, Mariyam Shamsuddin S, Beheshti Z, Jawawi D (2016) Electromagnetic field optimization: a physics-inspired metaheuristic optimization algorithm. Swarm Evol Comput 26:8–22

    Google Scholar 

  • Ahrari A, Atai A (2010) Grenade explosion method—a novel tool for optimization of multimodal functions. Appl Soft Comput J 10(4):1132–1140

    Google Scholar 

  • Alatas B (2011) ACROA: artificial chemical reaction optimization algorithm for global optimization. Expert Syst Appl 38(10):13170–13180

    Google Scholar 

  • Askarzadeh A (2014) Bird mating optimizer: an optimization algorithm inspired by bird mating strategies. Commun Nonlinear Sci Numer Simul 19(4):1213–1228

    MathSciNet  MATH  Google Scholar 

  • Atashpaz-Gargari E, Lucas C (2007) Imperialist competitive algorithm: an algorithm for optimization inspired by imperialistic competition. In: IEEE congress on evolutionary computation (CEC 2007), pp 4661–4667

  • Baluja S (1994) Population-based incremental learning: a method for integrating genetic search based function optimization and competitive learning. https://www.ri.cmu.edu/pub_files/pub1/baluja_shumeet_1994_2/baluja_shumeet_1994_2.pdf. Accessed 2 June 1994

  • Bouchekara H (2017) Most valuable player algorithm: a novel optimization algorithm inspired from sport. Oper Res 1–57

  • Cheng M, Prayogo D (2014) Symbiotic organisms search: a new metaheuristic optimization algorithm. Comput Struct 139:98–112

    Google Scholar 

  • Chickermane H, Gea H (1996) Structural optimization using a new local approximation method. Int J Numer Methods Eng 39(5):829–846

    MathSciNet  MATH  Google Scholar 

  • Chu S-C, Tsai P-W, Pan J-S (2006) Cat swarm optimization. PRICAI 2006: trends in artificial intelligence. PRICAI 2006. Lect Notes Comput Sci 4099:854–858

    Google Scholar 

  • Coello C, Montes M (2002) Constraint-handling in genetic algorithms through the use of dominance-based tournament selection. Adv Eng Inform 16(3):193–203

    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(16):6374–6384

    Google Scholar 

  • Cuevas E, Echavarría A, Ramírez-Ortegón M (2014) An optimization algorithm inspired by the states of matter that improves the balance between exploration and exploitation. Appl Intell 40(2):256–272

    Google Scholar 

  • Dai C, Zhu Y, Cheng W (2006) Seeker optimization algorithm. Computational intelligence and security. CIS 2006. Lect Notes Comput Sci 4456:167–176

    Google Scholar 

  • Dhiman G, Kumar V (2017) Spotted hyena optimizer: a novel bio-inspired based metaheuristic technique for engineering applications. Adv Eng Softw 114:48–70

    Google Scholar 

  • Dorigo M, Di Caro G (1999) Ant colony optimization: A new meta-heuristic. In: Proceedings of the 1999 congress on evolutionary computation-CEC99, pp 1470–1477

  • Duman E, Uysal M, Alkaya A (2012) Migrating birds optimization: a new metaheuristic approach and its performance on quadratic assignment problem. Inf Sci 217:65–77

    MathSciNet  Google Scholar 

  • Eita M, Fahmy M (2014) Group counseling optimization. Appl Soft Comput J 22:585–604

    Google Scholar 

  • Erol O, Eksin I (2006) A new optimization method: big bang–big crunch. Adv Eng Softw 37(2):106–111

    Google Scholar 

  • Eskandar H, Sadollah A, Bahreininejad A, Hamdi M (2012) Water cycle algorithm—a novel metaheuristic optimization method for solving constrained engineering optimization problems. Comput Struct 110–111:151–166

    Google Scholar 

  • Farasat A, Menhaj M, Mansouri T, Moghadam M (2010) ARO: a new model-free optimization algorithm inspired from asexual reproduction. Appl Soft Comput J 10(4):1284–1292

    Google Scholar 

  • Ferreira C (2006) Gene expression programming: mathematical modeling by an artificial intelligence. Studies in Computational Intelligence, vol. 21, Springer, Berlin

    MATH  Google Scholar 

  • François O (1998) An evolutionary strategy for global minimization and its Markov chain analysis. IEEE Trans Evol Comput 2(3):77–90

    Google Scholar 

  • Gandomi A (2014) Interior search algorithm (ISA): a novel approach for global optimization. ISA Trans 53(4):1168–1183

    Google Scholar 

  • Gandomi A, Alavi A (2012) Krill herd: a new bio-inspired optimization algorithm. Commun Nonlinear Sci Numer Simul 17(12):4831–4845

    MathSciNet  MATH  Google Scholar 

  • Gandomi A, Yang X, Alavi A (2013) Cuckoo search algorithm: a metaheuristic approach to solve structural optimization problems. Eng Comput 29(1):17–35

    Google Scholar 

  • Gao L, Hailu A (2010) Comprehensive learning particle swarm optimizer for constrained mixed-variable optimization problems. Int J Comput Intell Syst 3(6):832–842

    Google Scholar 

  • Ghaemi M, Feizi-Derakhshi M (2014) Forest optimization algorithm. Expert Syst Appl 41(15):6676–6687

    Google Scholar 

  • Ghorbani N, Babaei E (2014) Exchange market algorithm. Appl Soft Comput J 19:177–187

    Google Scholar 

  • Glover F (1989) Tabu search—part I. ORSA J Comput 1(3):190–206

    MATH  Google Scholar 

  • Hasançebi O, Azad S (2015) Adaptive dimensional search: a new metaheuristic algorithm for discrete truss sizing optimization. Comput Struct 154:1–16

    Google Scholar 

  • Hatamlou A (2013) Black hole: a new heuristic optimization approach for data clustering. Inf Sci 222:175–184

    MathSciNet  Google Scholar 

  • Hatamlou A, Javidy B, Mirjalili S (2015) Ions motion algorithm for solving optimization problems. Appl Soft Comput 32:72–79

    Google Scholar 

  • He S, Wu Q, Saunders J (2009) Group search optimizer: an optimization algorithm inspired by animal searching behavior. IEEE Trans Evol Comput 13(5):973–990

    Google Scholar 

  • Hedayatzadeh R, Salmassi F, Keshtgari M, Akbari R, Ziarati K (2010) Termite colony optimization: a novel approach for optimizing continuous problems. In: Proceedings—2010 18th Iranian conference on electrical engineering, ICEE, pp 553–558

  • Holland J (1992) Adaptation in natural and artificial systems. The MIT Press, Cambridge

    Google Scholar 

  • Hosseini H (2009) The intelligent water drops algorithm: a nature-inspired swarm-based optimization algorithm. Int J Bio Inspired Comput 1(1/2):71–79

    Google Scholar 

  • Hosseini H (2011) Principal components analysis by the galaxy-based search algorithm: a novel metaheuristic for continuous optimisation. Int J Comput Sci Eng 6(1/2):132–140

    Google Scholar 

  • Huang F, Wang L, He Q (2007) An effective co-evolutionary differential evolution for constrained optimization. Appl Math Comput 186(1):340–356

    MathSciNet  MATH  Google Scholar 

  • Husseinzadeh Kashan A (2014) A new metaheuristic for optimization: optics inspired optimization (OIO). Comput Oper Res 55:99–125

    MathSciNet  MATH  Google Scholar 

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

    MathSciNet  MATH  Google Scholar 

  • Kaveh A (2014) Advances in metaheuristic algorithms for optimal design of structures. Springer, Berlin

    MATH  Google Scholar 

  • Kaveh A, Bakhshpoori T (2016) Water evaporation optimization: a novel physically inspired optimization algorithm. Comput Struct 167:69–85

    Google Scholar 

  • Kaveh A, Dadras A (2017) A novel meta-heuristic optimization algorithm: thermal exchange optimization. Adv Eng Softw 110:69–84

    Google Scholar 

  • Kaveh A, Farhoudi N (2013) A new optimization method: dolphin echolocation. Adv Eng Softw 59:53–70

    Google Scholar 

  • Kaveh A, Ilchi Ghazaan M (2017) Vibrating particles system algorithm for truss optimization with multiple natural frequency constraints. Acta Mech 228(1):307–322

    MathSciNet  Google Scholar 

  • Kaveh A, Mahdavi V (2014) Colliding bodies optimization: a novel meta-heuristic method. Comput Struct 139:18–27

    Google Scholar 

  • Kaveh A, Talatahari S (2010) A novel heuristic optimization method: charged system search. Acta Mech 213(3–4):267–289

    MATH  Google Scholar 

  • Kaveh A, Zolghadr A (2016) A novel meta-heuristic algorithm: tug of war optimization. Int Journal of Optim Civil Eng 6(4):469–492

    Google Scholar 

  • Kennedy J, Eberhart R (1995) Particle swarm optimization. In: Proceedings of ICNN’95—international conference on neural networks, pp 1942–1948

  • Kiran M (2015) TSA: tree-seed algorithm for continuous optimization. Expert Syst Appl 42(19):6686–6698

    Google Scholar 

  • Koza JR (1994) Genetic programming II: automatic discovery of reusable subprograms. MIT Press, Cambridge

    MATH  Google Scholar 

  • Krishnanand KN, Ghose D (2006) Glowworm swarm based optimization algorithm for multimodal functions with collective robotics applications. Multiagent and Grid Systems 2(3):209–222

    MATH  Google Scholar 

  • Krohling R, Dos Santos Coelho L (2006) Coevolutionary particle swarm optimization using gaussian distribution for solving constrained optimization problems. IEEE Trans Syst Man Cybern B Cybern 36(6):1407–1416

    Google Scholar 

  • Lam A, Li V (2010) Chemical-reaction-inspired metaheuristic for optimization. IEEE Trans Evol Comput 14(3):381–399

    Google Scholar 

  • Li X, Zhang J, Yin M (2014) Animal migration optimization: an optimization algorithm inspired by animal migration behavior. Neural Comput Appl 24(7–8):1867–1877

    Google Scholar 

  • Liang J, Suganthan P, Deb K (2005) Novel composition test functions for numerical global optimization. Swarm Intell Symp 2005:68–75

    Google Scholar 

  • Lu X, Zhou Y (2008) A novel global convergence algorithm: bee collecting pollen algorithm. Advanced intelligent computing theories and applications. With aspects of artificial intelligence. ICIC 2008. Lect Notes Comput Sci 5227:518–525

    Google Scholar 

  • Mehrabian A, Lucas C (2006) A novel numerical optimization algorithm inspired from weed colonization. Ecol Inform 1(4):355–366

    Google Scholar 

  • Meng X, Liu Y, Gao X, Zhang H (2014) A new bio-inspired algorithm: chicken swarm optimization. Advances in swarm intelligence. ICSI 2014. Lect Notes Comput Sci 8794:86–94

    Google Scholar 

  • Merrikh-Bayat F (2015) The runner-root algorithm: a metaheuristic for solving unimodal and multimodal optimization problems inspired by runners and roots of plants in nature. Appl Soft Comput J 33:292–303

    Google Scholar 

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

    Google Scholar 

  • Mirjalili S (2015b) The ant lion optimizer. Adv Eng Softw 83:80–98

    Google Scholar 

  • Mirjalili S (2016a) Dragonfly algorithm: a new meta-heuristic optimization technique for solving single-objective, discrete, and multi-objective problems. Neural Comput Appl 27(4):1053–1073

    Google Scholar 

  • Mirjalili S (2016b) SCA: a sine cosine algorithm for solving optimization problems. Knowl Based Syst 96:120–133

    Google Scholar 

  • Mirjalili S, Lewis A (2016) The whale optimization algorithm. Adv Eng Softw 95:51–67

    Google Scholar 

  • Mirjalili S, Mirjalili S, Lewis A (2014) Grey Wolf Optimizer. Adv Eng Softw 69:46–61

    Google Scholar 

  • Mirjalili S, Mirjalili S, Hatamlou A (2016) Multi-verse optimizer: a nature-inspired algorithm for global optimization. Neural Comput Appl 27(2):495–513

    Google Scholar 

  • Mirjalili S, Gandomi A, Mirjalili S, Saremi S, Faris H, Mirjalili S (2017) Salp swarm algorithm: a bio-inspired optimizer for engineering design problems. Adv Eng Softw 114:163–191

    Google Scholar 

  • Moghaddam F, Moghaddam R, Cheriet M (2012) Curved space optimization: a random search based on general relativity theory

  • Moghdani R, Salimifard K (2018) Volleyball premier league algorithm. Appl Soft Comput J 64:161–185

    Google Scholar 

  • Moosavian N, Kasaee Roodsari B (2014) Soccer league competition algorithm: a novel meta-heuristic algorithm for optimal design of water distribution networks. Swarm Evol Comput 17:14–24

    Google Scholar 

  • Oftadeh R, Mahjoob M, Shariatpanahi M (2010) A novel meta-heuristic optimization algorithm inspired by group hunting of animals: hunting search. Comput Math Appl 60(7):2087–2098

    MATH  Google Scholar 

  • Pan W-T (2012) A new fruit fly optimization algorithm: taking the financial distress model as an example. Knowl Based Syst 26:69–74

    Google Scholar 

  • Pham D, Eldukhri E, Soroka A, Ghanbarzadeh A, Kog E, Otri S, Zaidi M (2006) The bees algorithm-a novel tool for complex optimisation problems. In: Intelligent production machines and systems, pp 454–459

  • Pinto P, Runkler TA, Sousa JM (2005) Wasp swarm optimization of logistic systems. In: Ribeiro B, Albrecht RF, Dobnikar A, Pearson DW, Steele NC (eds) Adaptive and natural computing algorithms. Springer, Vienna, pp 264–267

    Google Scholar 

  • Rao RV, Vimal JS, Vakharia DP (2007) Teaching–learning-based optimization: a novel method for constrained mechanical design optimization problems. Comput Aided Des 43(3):303–315

    Google Scholar 

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

    MATH  Google Scholar 

  • Ryan C, Collins J (1998) Grammatical evolution: evolving programs for an arbitrary language. Genet Program Lect Notes Comput Sci 1391:83–96

    Google Scholar 

  • Sadollah A, Bahreininejad A, Eskandar H, Hamdi M (2013) Mine blast algorithm: a new population based algorithm for solving constrained engineering optimization problems. Appl Soft Comput J 13(5):2592–2612

    Google Scholar 

  • Salimi H (2015) Stochastic fractal search: a powerful metaheuristic algorithm. Knowl-Based Syst 75:1–18

    Google Scholar 

  • Sandgren E (1990) Nonlinear integer and discrete programming in mechanical design optimization. J Mech Des 112(2):223–229

    Google Scholar 

  • Shareef H, Ibrahim A, Mutlag A (2015) Lightning search algorithm. Appl Soft Comput J 36:315–333

    Google Scholar 

  • Simon D (2008) Biogeography-based optimization. IEEE Trans Evol Comput 12(6):702–713

    Google Scholar 

  • Storn R, Price K (1997) Differential evolution-a simple and efficient heuristic for global optimization over continuous spaces. J Global Optim 11(4):341–349

    MathSciNet  MATH  Google Scholar 

  • Suganthan PN, Hansen N, Liang JJ, Deb K, Chen YP, Auger A, Tiwari S (2005) Problem definitions and evaluation criteria for the CEC 2005 special session on real-parameter optimization. KanGAL report, 2005005

  • Svanberg K (1987) The method of moving asymptotes—a new method for structural optimization. Int J Numer Methods Eng 24:359–373

    MathSciNet  MATH  Google Scholar 

  • Tan Y, Zhu Y (2015) Fireworks algorithm for optimization. Advances in swarm intelligence. ICSI 2010. Lect Notes Comput Sci 6145:355–364

    Google Scholar 

  • Van Laarhoven PJM, Aarts EHL (1987) Simulated annealing. In: Simulated annealing: theory and applications. Springer, Dordrecht, pp 7–15

    MATH  Google Scholar 

  • Venkata RR (2016) Jaya: a simple and new optimization algorithm for solving constrained and unconstrained optimization problems. Int J Ind Eng Comput 7(1):19–34

    Google Scholar 

  • Wang G, Deb S, Coelho L (2016a) Elephant herding optimization. In: Proceedings—2015 3rd international symposium on computational and business intelligence, ISCBI 2015, pp 1–5

  • Wang G, Zhao X, Deb S (2016b) A novel monarch butterfly optimization with greedy strategy and self-adaptive. In: Proceedings—2015 2nd international conference on soft computing and machine intelligence, ISCMI 2015, pp 45–50

  • Wolpert D, Macready W (1997) No free lunch theorems for optimization. IEEE Trans Evol Comput 1(1):67–82

    Google Scholar 

  • Woo Geem Z, Hoon Kim J, Loganathan G (2001) A new heuristic optimization algorithm: harmony search. Simul Trans Soc Model Simul Int 76(2):60–68

    Google Scholar 

  • Sophia Robot. https://www.hansonrobotics.com/sophia/

  • Yang X-S (2009) Firefly algorithms for multimodal optimization. Stochastic algorithms: foundations and applications. SAGA 2009. Lect Notes Comput Sci 5792:169–178

    Google Scholar 

  • Yang X-S (2010) A new metaheuristic Bat-inspired Algorithm. Stud Comput Intell 284:65–74

    MATH  Google Scholar 

  • Yang X-S (2012) Flower pollination algorithm for global optimization. Unconventional computation and natural computation. UCNC 2012. Lect Notes Comput Sci 7445:240–249

    Google Scholar 

  • Yang X-S, Deb S (2009) Cuckoo search via levy flights. In: 2009 World congress on nature & biologically inspired computing (NaBIC), pp 210–214

  • Yang S, Jiang J, Yan G (2009) A dolphin partner optimization. In: Proceedings of the 2009 WRI global congress on intelligent systems, GCIS 2009, vol. 1, pp. 124–128

  • Yao X, Liu Y (1996) Fast evolutionary programming. Computational intelligence and intelligent systems. ISICA 2010. Commun Comput Inf Sci 107:79–86

    Google Scholar 

  • Yazdani M, Jolai F (2016) Lion optimization algorithm (LOA): a nature-inspired metaheuristic algorithm. J Comput Des Eng 3(1):24–36

    Google Scholar 

  • Zhao R, Tang W (2008) Monkey algorithm for global numerical optimization. J Uncertain Syst 2(3):165–176

    Google Scholar 

  • Zheng Y (2015) Water wave optimization: a new nature-inspired metaheuristic. Comput Oper Res 55:1–11

    MathSciNet  MATH  Google Scholar 

  • Zheng Y, Ling H, Xue J (2014) Ecogeography-based optimization: enhancing biogeography-based optimization with ecogeographic barriers and differentiations. Comput Oper Res 50:115–127

    MATH  Google Scholar 

Download references

Acknowledgements

The author thanks the anonymous reviewers who contributed to improving the quality and clarity of this paper with their comments during the revision process. MATLAB code of LCBO may be provided to the researchers and developers on request.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to K. P. S. Rana.

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.

Appendix

Appendix

The engineering problems used in this paper are pressure vessel design and cantilever beam design. The mathematical details of these engineering problems have been presented. The mathematical equations of constraints, range space and cost function to be minimized are given below.

1.1 Pressure vessel design

The objective of this problem is to minimize the total cost consisting of material, forming and welding of a cylindrical vessel as in Fig. 6. Both ends of the vessel are capped, and the head has a hemispherical shape. There are four variables in this problem, namely thickness of the shell (\( T_{s} \)), thickness of the head (\( T_{h} \)), inner radius (\( R \)) and length of the cylindrical section without considering the head (\( L \)). The function \( f\left( {T_{s} ,T_{h} ,R,L} \right) \) is to be minimized subjected to the following four constraints \( g1 \), \( g2 \), \( g3 \) and \( g4 \) and variable ranges:

Fig. 6
figure 6

Pressure vessel design problem

$$ f\left( {T_{s} ,T_{h} ,R,L} \right) = 0.6224\;T_{s} RL + 1.7781\;T_{h} R^{2} + 3.1661\;{\text{T}}_{s}^{2} L + T_{h} + 19.84\;T_{h}^{2} L $$
$$ g1 = - T_{h} + 0.0193\;R \le 0 $$
$$ g2 = - T_{h} + 0.0095\;R \le 0 $$
$$ g3 = - \pi R^{2} L - \frac{4}{3}\pi R^{3} + 1296000 \le 0 $$
$$ g4 = L - 240 \le 0 $$
$$ 1*0.0625 \le T_{s} ,T_{h} \le 99*0.0625 \;{\text{and}}\;10 \le R,\;L \le 200 $$

1.2 Cantilever beam design

The cantilever beam shown in Fig. 7 is made of five elements, each having a hollow cross section with constant thickness. There is external force acting at the free end of the cantilever. The weight of the beam is to be minimized while assigning an upper limit on the vertical displacement of the free end. The design variables are the heights (or widths) \( x_{i} \) of the cross section of each element. Another interesting requirement is the lower bounds on these design variables are very small and the upper bounds very large so they do not become active in the problem. The problem is formulated using classical beam theory as follows:

Fig. 7
figure 7

Cantilever beam design problem

$$ f\left( x \right) = 0.0624*\left( {x_{1} + x_{2} + x_{3} + x_{4} + x_{5} } \right) $$

subjected to the following constraint and range of variables:

$$ \begin{aligned} & g\left( x \right) = \frac{61}{{x_{1}^{3} }} + \frac{37}{{x_{2}^{3} }} + \frac{19}{{x_{3}^{3} }} + \frac{7}{{x_{4}^{3} }} + \frac{1}{{x_{5}^{3} }} - 1 \le 0 \\ & 0.01 \le {\text{x}}_{1} , {\text{x}}_{2} ,{\text{x}}_{3} ,x_{4} ,x_{5 } \le 100 \\ \end{aligned} $$

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Khatri, A., Gaba, A., Rana, K.P.S. et al. A novel life choice-based optimizer. Soft Comput 24, 9121–9141 (2020). https://doi.org/10.1007/s00500-019-04443-z

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-019-04443-z

Keywords

Navigation