Implementation of the Jaya2 Optimization Algorithm as described in the paper: https://www.degruyter.com/document/doi/10.1515/jisys-2022-0200
https://www.degruyter.com/document/doi/10.1515/jisys-2022-0200/pdf
이 제출물을 팔로우합니다
- 팔로우하는 게시물 피드에서 업데이트를 확인할 수 있습니다
- 정보 수신 기본 설정에 따라 이메일을 받을 수 있습니다
An improved Jaya optimization algorithm with ring topology and population size reduction
By: Mahamed G.H. Omran and Giovanni Iacca
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.
인용 양식
Mahamed (2026). Jaya2 Optimization Algorithm (https://kr.mathworks.com/matlabcentral/fileexchange/128799-jaya2-optimization-algorithm), MATLAB Central File Exchange. 검색 날짜: .
| 버전 | 퍼블리시됨 | 릴리스 정보 | Action |
|---|---|---|---|
| 1.0.0 |
