.png){kind=icon}
.png){kind=icon}
Return
Improved Rao algorithm: a simple and effective algorithm for constrained mechanical design optimization problems
.png){kind=icon}
PRE
AI
DOI：10.1007/s00500-022-07589-5.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper proposes a simple and effective optimization algorithm named as Improved Rao (I-Rao) algorithm. The I-Rao algorithm consists of two phases: the local exploitation phase and the global exploration phase. The local exploitation phase improves the exploitation of the search process of Rao algorithms and enhances the algorithm's convergence speed. The global exploration phase helps the algorithm to get away from the local optimum solutions and enhances the exploration ability of the search process of the algorithm. Like Rao algorithms, the I-Rao algorithm also does not need algorithm-specific control parameters. The effectiveness of the I-Rao algorithm is tested on 25 unconstrained benchmark functions, 45 complex CEC test functions, and 19 real-world constrained mechanical design optimization problems of CEC2020. The comparison of results reveals the effectiveness of the I-Rao algorithm over many state-of-the-art advanced optimization algorithms such as GWO, SCA, PSO, WOA, Jaya, IJAYA, MJAYA, PGJAYA, EJAYA, IUDE, epsilon MAgES, iLSHADE epsilon, and COLSHADE. The Friedman test is also carried out to check the overall performance of the I-Rao algorithm as compared to other advanced optimization algorithms considered. The convergence plots illustrate the convergence speed of the I-Rao algorithm.
Keywords:
Optimization
Design optimization
Engineering design
Metaphor-less algorithm
Improved Rao algorithm
Journal
IF:
2.5
Papers:
1.0W
Citations:
2.1W