Skip to main content
Log in

Self-adaptively commensal learning-based Jaya algorithm with multi-populations and its application

  • Optimization
  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

Jaya algorithm is an advanced optimization algorithm, which has been applied to many real-world optimization problems. Jaya algorithm has better performance in some optimization field. However, Jaya algorithm exploration capability is not better. In order to enhance exploration capability of the Jaya algorithm, a self-adaptively commensal learning-based Jaya algorithm with multi-populations (Jaya-SCLMP) is presented in this paper. In Jaya-SCLMP, a commensal learning strategy is used to increase the probability of finding the global optimum, in which the person history best and worst information is used to explore new solution area. Moreover, a multi-populations strategy based on Gaussian distribution scheme and learning dictionary is utilized to enhance the exploration capability, meanwhile every subpopulation employed three Gaussian distributions at each generation, roulette wheel selection is employed to choose a scheme based on learning dictionary. The performance of Jaya-SCLMP is evaluated based on 28 CEC 2013 unconstrained benchmark problems. In addition, three reliability problems, i.e., complex (bridge) system, series system and series–parallel system, are selected. Compared with several Jaya variants and several state-of-the-art other algorithms, the experimental results reveal that Jaya-SCLMP is effective.

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.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9

Similar content being viewed by others

Data availability

All data used to support the findings of this study are available from our experiments. Upon request, please contact the author to provide them.

References

  • Akay B, Karaboga D (2012) A modified artificial bee colony algorithm for real-parameter optimization. Inform Sci 192:120–142

    Article  Google Scholar 

  • Azizi M, Ghasemi SAM, Ejlali RG et al (2019) Optimum design of fuzzy controller using hybrid ant lion optimizer and Jaya algorithm. Artif Intell Rev 53:1–32

    Google Scholar 

  • Chen X, Yu K, Du W et al (2016) Parameters identification of solar cell models using generalized oppositional teaching learning based optimization. Energy 99:170–180

    Article  Google Scholar 

  • Deb K et al (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evolut Comput 6(2):182–197

    Article  Google Scholar 

  • Degertekin SO, Lamberti L, Ugur IB (2018) Sizing, layout and topology design optimization of truss structures using the Jaya algorithm. Appl Soft Comput 70:903–928

    Article  Google Scholar 

  • Degertekin SO, Lamberti L, Ugur IB (2019) Discrete sizing/layout/topology optimization of truss structures with an advanced Jaya algorithm. Appl Soft Comput 79:363–390

    Article  Google Scholar 

  • Eberhart R, Kennedy J (1995) A new optimizer using particle swarm theory. In: Proceedings of the sixth international symposium on micro machine and human science, 1995. MHS '95

  • Farah A, Belazi A (2018) A novel chaotic Jaya algorithm for unconstrained numerical optimization. Nonlinear Dyn 93(3):1451–1480

    Article  Google Scholar 

  • Gao K, Yang F, Zhou M et al (2019) Flexible job-shop rescheduling for new job insertion by using discrete Jaya algorithm. IEEE Trans Syst Man Cybern 49(5):1944–1955

    Google Scholar 

  • Geem ZW, Kim JH, Loganathan GV (2001) A new heuristic optimization algorithm: harmony search. SIMULATION 76(2):60–68

    Article  Google Scholar 

  • Grzywinski M, Dede T, Ozdemir YI (2019) Optimization of the braced dome structures by using Jaya algorithm with frequency constraints. Steel Comp Struct 30(1):47–55

    Google Scholar 

  • Huang C, Wang L, Yeung RS et al (2018) A prediction model-guided Jaya algorithm for the PV system maximum power point tracking. IEEE Trans Sustain Energy 9(1):45–55

    Article  Google Scholar 

  • Liang JJ, Qu BY, Suganthan PN et al (2013) Problem definitions and evaluation criteria for the CEC 2013 special session on real-parameter optimization. Comput Intell Lab Zhengzhou Univ Zhengzhou China Nanyang Technol Univ Singap Techn Rep 201212(34):281–295

    Google Scholar 

  • Ocłoń P, Cisek P, Rerak M et al (2018) Thermal performance optimization of the underground power cable system by using a modified Jaya algorithm. Int J Therm Sci 123:162–180

    Article  Google Scholar 

  • Ouyang H, Gao L, Li S et al (2015) Improved novel global harmony search with a new relaxation method for reliability optimization problems. Inform Sci 305:14–55

    Article  Google Scholar 

  • Ouyang H, Wu W, Zhang C et al (2018) Improved harmony search with general iteration models for engineering design optimization problems. Soft Comput 23:1–36

    Google Scholar 

  • Papa JP, Scheirer W, Cox DD (2016) Fine-tuning deep belief networks using harmony search. Appl Soft Comput 46:875–885

    Article  Google Scholar 

  • Peng H, Wu Z, Deng C et al (2017) Enhancing differential evolution with commensal learning and uniform local search. Chin J Elect 26(4):725–733

    Article  Google Scholar 

  • Rao RV (2019) Application of Jaya algorithm and its variants on constrained and unconstrained benchmark functions. Jaya: an advanced optimization algorithm and its engineering applications. Springer, Cham, pp 59–90

    Google Scholar 

  • Rao RV, Keesari HS (2018) Multi-team perturbation guiding Jaya algorithm for optimization of wind farm layout. Appl Soft Comput 71:800–815

    Article  Google Scholar 

  • Rao RV, More KC (2017) Design optimization and analysis of selected thermal devices using self-adaptive Jaya algorithm. Energy Conv Manag 140:24–35

    Article  Google Scholar 

  • Rao RV, Rai DP (2017) Optimization of submerged arc welding process parameters using quasi-oppositional based Jaya algorithm. J Mech Sci Technol 31(5):2513–2522

    Article  Google Scholar 

  • Rao RV, Saroj A (2017a) A self-adaptive multi-population based Jaya algorithm for engineering optimization. Swarm Evolut Comput 37:1–26

    Article  Google Scholar 

  • Rao RV, Saroj A (2017b) Constrained economic optimization of shell-and-tube heat exchangers using elitist-Jaya algorithm. Energy 128:785–800

    Article  Google Scholar 

  • Rao RV, Saroj A (2018a) An elitism-based self-adaptive multi-population Jaya algorithm and its applications. Soft Comput 23:1–24

    Google Scholar 

  • Rao RV, Saroj A (2018b) Constrained economic optimization of shell-and-tube heat exchangers using a self-adaptive multipopulation elitist-Jaya algorithm. J Therm Sci Eng Appl 10(4):041001

    Article  Google Scholar 

  • Rao RV, Saroj A (2018c) Multi-objective design optimization of heat exchangers using elitist-Jaya algorithm. Energy Syst 9(2):305–341

    Article  Google Scholar 

  • Rao RV, Waghmare GG (2016) A new optimization algorithm for solving complex constrained design optimization problems. Eng Optim 49(1):1–24

    Google Scholar 

  • 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

    Article  Google Scholar 

  • Rao RV, More KC, Taler J et al (2016) Dimensional optimization of a micro-channel heat sink using Jaya algorithm. Appl Therm Eng 103:572–582

    Article  Google Scholar 

  • Rashedi E, Nezamabadi-Pour H, Saryazdi S (2009) GSA: a gravitational search algorithm. Elsevier, Amsterdam

    MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  • Wang L, Huang C (2018) A novel Elite Opposition-based Jaya algorithm for parameter estimation of photovoltaic cell models. Optik 155:351–356

    Article  Google Scholar 

  • Wang H, Wu Z, Rahnamayan S et al (2011) Enhancing particle swarm optimization using generalized opposition-based learning. Inform Sci 181(20):4699–4714

    Article  MathSciNet  Google Scholar 

  • Wang L, Zhang Z, Huang C et al (2018a) A GPU-accelerated parallel Jaya algorithm for efficiently estimating Li-ion battery model parameters. Appl Soft Comput 65:12–20

    Article  Google Scholar 

  • Wang SH, Muhammad K, Lv Y, et al (2018) Identification of Alcoholism based on wavelet Renyi entropy and three-segment encoded Jaya algorithm. Complexity 2018.

  • Warid W, Hizam H, Mariun N et al (2018) A novel quasi-oppositional modified Jaya algorithm for multi-objective optimal power flow solution. Appl Soft Comput 65:360–373

    Article  Google Scholar 

  • Wu P, Gao L, Zou D et al (2011) An improved particle swarm optimization algorithm for reliability problems. ISA Trans 50(1):71–81

    Article  Google Scholar 

  • Yao X, Liu Y, Lin G (1999) Evolutionary programming made faster. IEEE Trans Evolut Comput 3(2):82–102

    Article  Google Scholar 

  • Yu K, Liang JJ, Qu BY et al (2017) Parameters identification of photovoltaic models using an improved Jaya optimization algorithm. Energy Conv Manag 150:742–753

    Article  Google Scholar 

  • Yu K, Qu B, Yue C et al (2019) A performance-guided Jaya algorithm for parameters identification of photovoltaic cell and module. Appl Energy 237:241–257

    Article  Google Scholar 

  • Zhang YD, Zhao G, Sun J et al (2018) Smart pathological brain detection by synthetic minority oversampling technique, extreme learning machine, and Jaya algorithm. Multimedia Tools Appl 77(17):22629–22648

    Article  Google Scholar 

Download references

Acknowledgements

The authors are grateful to the editor and the anonymous referees for their constructive comments and recommendations, which have helped to improve this paper significantly. The authors would also like to express their sincere thanks to P. N. Suganthan for the useful information about metaheuristic algorithm and optimization problems on their homepages. We appreciate R.V. Rao for providing the original Jaya algorithm code. This work is supported by Guangzhou Science and Technology Plan Project (201804010299), National Nature Science Foundation of China (Grant No. 61806058), Nature Science Foundation of Guangdong province (2018A030310063).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Haibin Ouyang.

Ethics declarations

Conflict of interest

All the authors have no conflict of interests. This article does not contain any studies with human participants performed by any of the authors.

Additional information

Publisher's Note

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

Zuanjia Xie and Chunliang Zhang are the common first author.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Xie, Z., Zhang, C., Ouyang, H. et al. Self-adaptively commensal learning-based Jaya algorithm with multi-populations and its application. Soft Comput 25, 15163–15181 (2021). https://doi.org/10.1007/s00500-021-06445-2

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-021-06445-2

Keywords

Navigation