Evaluation of several initialization methods on arithmetic optimization algorithm performance

Abstract

Arithmetic optimization algorithm (AOA) is one of the recently proposed population-based metaheuristic algorithms. The algorithmic design concept of the AOA is based on the distributive behavior of arithmetic operators, namely, multiplication (M), division (D), subtraction (S), and addition (A). Being a new metaheuristic algorithm, the need for a performance evaluation of AOA is significant to the global optimization research community and specifically to nature-inspired metaheuristic enthusiasts. This article aims to evaluate the influence of the algorithm control parameters, namely, population size and the number of iterations, on the performance of the newly proposed AOA. In addition, we also investigated and validated the influence of different initialization schemes available in the literature on the performance of the AOA. Experiments were conducted using different initialization scenarios and the first is where the population size is large and the number of iterations is low. The second scenario is when the number of iterations is high, and the population size is small. Finally, when the population size and the number of iterations are similar. The numerical results from the conducted experiments showed that AOA is sensitive to the population size and requires a large population size for optimal performance. Afterward, we initialized AOA with six initialization schemes, and their performances were tested on the classical functions and the functions defined in the CEC 2020 suite. The results were presented, and their implications were discussed. Our results showed that the performance of AOA could be influenced when the solution is initialized with schemes other than default random numbers. The Beta distribution outperformed the random number distribution in all cases for both the classical and CEC 2020 functions. The performance of uniform distribution, Rayleigh distribution, Latin hypercube sampling, and Sobol low discrepancy sequence are relatively competitive with the Random number. On the basis of our experiments’ results, we recommend that a solution size of 6,000, the number of iterations of 100, and initializing the solutions with Beta distribution will lead to AOA performing optimally for scenarios considered in our experiments.

The Function of Remote Monitoring System of a Robot Inverter Based on PLC and Cloud Platform

“…The basic particle swarm optimization algorithm can be used to optimize the system matrix and determine the optimal value in the process of continuously tracking the extreme value, which is easy to realize and has fast convergence speed. However, due to the single optimization method, the optimal solution often cannot break through its own limitations [17,18]. The hybrid particle swarm optimization algorithm proposed in this paper uses genetic algorithm for reference; that is, genetic algorithm is introduced into particle swarm optimization algorithm to make particles reach the optimal value in the cross mutation with individual extreme value and population extreme value, so as to solve the problem that particle similarity cannot jump out of the boundary of local optimal solution when the population converges.…”

A Comprehensive Survey on Arithmetic Optimization Algorithm

“…According to the literature, one type of adaptation strategy to include well-balanced exploration and exploitation in any NIOA is to vary the population size. Experiments had been performed under three conditions: large population and small number of iterations, small population and large number of iterations, and large population and large number of iterations [37]. The findings revealed that AOA is affected by the size of the population, and a large population is required for the best results.…”

Improved Dwarf Mongoose Optimization for Constrained Engineering Design Problems

“…The representation of a group of dwarf mongooses, which also represents the entire population, is modeled using Eq. (1). Since the population of the dwarf mongoose is often composed of the alpha groups, juvenile group, and scout (including babysitters), we derive the alpha group from the population to allow for allocating the remaining individuals in the population for the other two subgroups.…”

“…Optimization tries to find the best solution amongst a pool of other solutions. As such, optimization occurs naturally in many human endeavors and is deeply rooted in science, businesses, ecology, and manufacturing [ 1 ]. Basically, optimization is accomplished using either the mathematical or metaheuristic approach.…”