Rao algorithms based on elite local search method

Abstract

The Rao algorithms, which have been proposed for solving complex and continuous optimization problems lately, are described as metaphor-less optimization algorithms because they do not contain algorithm-specific parameters. The Rao algorithms have variants called Rao-1, Rao-2 and Rao-3, respectively, depending on different population updating procedures. In Rao 1-3 algorithms, random interactions between candidate solutions and the best and worst solution in the whole population for solving optimizations problems were determined as the basic principle. Although this situation makes the Rao 1-3 algorithms increase the speed of convergence, it can cause the diversity of candidate solutions to decrease and the local search capacity to reduce. In this study, a new elite local search procedure was added to the population updating procedure of Rao algorithms to expand the capacity of Rao 1-3 algorithms and develop their solutions. The proposed method was called ELSRao-1, ELSRao-2 and ELSRao-3. Fifteen unconstrained unimodal, fifteen unconstrained multimodal functions and twenty-nine unconstrained CEC 2017 benchmark test functions were used to analyze the performance of the proposed ELSRao 1-3 algorithms. Jaya, dragonfly algorithm, arithmetic optimization algorithm, whale optimization algorithm and standard Rao 1-3 algorithms which are all state-of-the-art algorithms were used to compare the superiority and success of the proposed ELSRao 1-3 algorithms in benchmark functions. Friedman's mean rank test and Tukey-Kramer post hoc test were applied for statistical analysis. According to the experimental studies and statistical analysis, it was concluded that the proposed ELSRao 1-3 algorithms proved to be efficient and robust in the solution to unconstrained optimization problems.