An improved Jaya optimization algorithm with ring topology and population size reduction

7Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

An improved variant of the Jaya optimization algorithm, called Jaya2, is proposed to enhance the performance of the original Jaya sacrificing its algorithmic design. The proposed approach arranges the solutions in a ring topology to reduce the likelihood of premature convergence. In addition, the population size reduction is used to automatically adjust the population size during the optimization process. Moreover, the translation dependency problem of the original Jaya is discussed, and an alternative solution update operation is proposed. To test Jaya2, we compare it with nine different optimization methods on the CEC 2020 benchmark functions and the CEC 2011 real-world optimization problems. The results show that Jaya2 is highly competitive on the tested problems where it generally outperforms most approaches. Having an easy-to-implement approach with little parameter tuning is highly desirable since researchers from different disciplines with basic programming skills can use it to solve their optimization problems.

Cite

CITATION STYLE

APA

Omran, M. G. H., & Iacca, G. (2022). An improved Jaya optimization algorithm with ring topology and population size reduction. Journal of Intelligent Systems, 31(1), 1178–1210. https://doi.org/10.1515/jisys-2022-0200

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free