An elitism-based self-adaptive multi-population Jaya algorithm and its applications
- 133 Downloads
This study proposes an elitist-based self-adaptive multi-population (SAMPE) Jaya algorithm to solve the constrained and unconstrained problems related to numerical and engineering optimization. The Jaya algorithm is a newly developed metaheuristic-based optimization algorithm, and it does not require any algorithmic-specific parameters to be set other than the common control parameters of number of iterations and population size. The search mechanism of the Jaya algorithm is improved in this work by using the subpopulation search scheme with elitism. It uses an adaptive scheme for dividing the population into subpopulations. The effectiveness of the proposed SAMPE-Jaya algorithm is verified on CEC 2015 benchmark problems in addition to fifteen unconstrained, six constrained standard benchmark problems and four constrained mechanical design optimization problems considered from the literature. The Friedman rank test is also done for comparing the performance of the SAMPE-Jaya algorithm with other algorithms. It is also tested on three large-scale problems with the dimensions of 100, 500 and 1000. Furthermore, the proposed SAMPE-Jaya algorithm is used for solving a case study of design optimization of a micro-channel heat sink. The computational experiments have proved the effectiveness of the proposed SAMPE-Jaya algorithm.
KeywordsMulti-population Jaya algorithm CEC 2015 Heat sink
Compliance with ethical standards
Conflict of interest
The authors declare that they have no conflict of interest.
This article does not contain any studies with human participants or animals performed by any of the authors.
- Andersson M, Bandaru S, Ng AHC, Syberfeldt A (2015) Parameter tuned CMA-ES on the CEC’15 expensive problems. In: IEEE congress on evolutionary computation, Sendai, Japan, 2015Google Scholar
- Branke J, Kaußler T, Schmidt C, Schmeck H (2000) A multi-population approach to dynamic optimization problems. Adaptive computing in design and manufacturing. Springer, Berlin, pp 299–308Google Scholar
- Cantu-Paz E (1998) A survey of parallel genetic algorithms. IllGAL report 97003, The University of Illinois, 1997. ftp://ftp-lligal.ge.uiuc.edu/pub/papers/IlliGALs/97003.ps.Z
- Eberhart RC, Kennedy J (1995) A new optimizer using particle swarm theory. In: Sixth international symposium on micro machine and human science, Nagoya, Japan, pp 39–43Google Scholar
- Hamida SB, Schoenauer M (2002) ASCHEA: new results using adaptive segregational constraint handling. In: Proceedings of the world on congress on computational intelligence, pp 884–889Google Scholar
- Joaquin D, Salvador G, Daniel M, Francisco H (2016) A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm Evolut Comput 1(1):3–18Google Scholar
- Karaboga D, Basturk B (2007) Artificial bee colony (ABC) optimization algorithm for solving constrained optimization problems. In: LNAI 4529. Springer, Berlin, pp 789–798Google Scholar
- Lampinen J (2002) A constraint handling approach for the differential evolution algorithm. In: IEEE congress on evolutionary computation, vol 2, pp 1468–1473Google Scholar
- Li C, Yang S (2008) Fast multi-swarm optimization for dynamic optimization problems. In: Fourth international conference on natural computation, ICNC’08, vol 7. IEEE, pp 624–628Google Scholar
- Mambrini A, Sudholt D (2014) Design and analysis of adaptive migration intervals in parallel evolutionary algorithms. In: Proceedings of the 2014 annual conference on genetic and evolutionary computation, pp 1047–1054Google Scholar
- Rao RV (2016a) Review of applications of TLBO algorithm and a tutorial for beginners to solve the unconstrained and constrained optimization problems. Dec Sci Lett 5:1–30Google Scholar
- Rao RV, Patel VK (2012) An elitist teaching–learning-based optimization algorithm for solving complex constrained optimization problems. Int J Ind Eng Comput 3(4):535–560Google Scholar
- Tessema B, Yen GG (2006) A self-adaptive penalty function based algorithm for constrained optimization. In: IEEE congress on evolutionary computation, pp 246–253Google Scholar