Gaussian Mutation Specular Reflection Learning with Local Escaping Operator Based Artificial Electric Field Algorithm and Its Engineering Application

Abstract

During the contribution of a metaheuristic algorithm for solving complex problems, one of the major challenges is to obtain the one that provides a well-balanced exploration and exploitation. Among the possible solutions to overcome this issue is to combine the strengths of the different methods. In this study, one of the recently developed metaheuristic algorithms, artificial electric field algorithm (AEFA), has been used, to improve its converge speed and the ability to avoid the local optimum points of the given problems. To address these issues, Gaussian mutation specular reflection learning (GS) and local escaping operator (LEO) have been added to the essential steps on AEFA and called GSLEO-AEFA. In order to observe the effect of the applied features, 23 benchmark functions as well as engineering and real-world application problems were tested and compared with the other algorithms. Friedman and Wilcoxon rank-sum statistical tests, and complexity analyses were also conducted to measure the performance of GSLEO-AEFA. The overall effectiveness of the algorithm among the compared algorithms obtained in between 84.62–92.31%. According to the achieved results, it can be seen that GSLEO-AEFA has precise optimization accuracy even in changing dimensions, especially in engineering optimization problems.

DGS-SCSO: Enhancing Sand Cat Swarm Optimization with Dynamic Pinhole Imaging and Golden Sine Algorithm for improved numerical optimization performance

“…When the starting collection of solutions is located close to the best solution, there is a greater chance of locating the global optimum with a smaller search effort. Opposition-based Learning (OBL) is a technique that draws its inspiration from the opposite relationship between real-world entities 36 , 37 . The concept was first introduced in 2005, and it has piqued significant research interest.…”

Chaotic opposition learning with mirror reflection and worst individual disturbance grey wolf optimizer for continuous global numerical optimization

“…The breakdown of the steps and analysis of complexity is given below: Random initialization: Initializing the grey wolf population involves generating random values for each individual wolf's position in the search space. The complexity of this step is , where is the size of the population and big denotes CMWGWO’s complexity 60 , 61 . Fitness evaluation: Evaluating the fitness of each grey wolf requires evaluating the objective function of each individual.…”

“…Random initialization: Initializing the grey wolf population involves generating random values for each individual wolf's position in the search space. The complexity of this step is , where is the size of the population and big denotes CMWGWO’s complexity 60 , 61 .…”

Antenna S-parameter optimization based on golden sine mechanism based honey badger algorithm with tent chaos

“…In the optimization algorithms’ preliminary stage of design, they are usually evaluated on a collection of analytical functions for which the global and local optima are known. This collection of functions, also known as a test suite helps in validating the performance of the algorithm in relation to its effectiveness and efficiency in numerous circumstances [ 46 , 47 ]. Several authors have proposed test suites for evaluating the effectiveness of optimization methods function when applied to antenna problems.…”