Dynamic Random Walk and Dynamic Opposition Learning for Improving Aquila Optimizer: Solving Constrained Engineering Design Problems

One of the most important tasks in handling real-world global optimization problems is to achieve a balance between exploration and exploitation in any nature-inspired optimization method. As a result, the search agents of an algorithm constantly strive to investigate the unexplored regions of a search space. Aquila Optimizer (AO) is a recent addition to the field of metaheuristics that finds the solution to an optimization problem using the hunting behavior of Aquila. However, in some cases, AO skips the true solutions and is trapped at sub-optimal solutions. These problems lead to premature convergence (stagnation), which is harmful in determining the global optima. Therefore, to solve the above-mentioned problem, the present study aims to establish comparatively better synergy between exploration and exploitation and to escape from local stagnation in AO. In this direction, firstly, the exploration ability of AO is improved by integrating Dynamic Random Walk (DRW), and, secondly, the balance between exploration and exploitation is maintained through Dynamic Oppositional Learning (DOL). Due to its dynamic search space and low complexity, the DOL-inspired DRW technique is more computationally efficient and has higher exploration potential for convergence to the best optimum. This allows the algorithm to be improved even further and prevents premature convergence. The proposed algorithm is named DAO. A well-known set of CEC2017 and CEC2019 benchmark functions as well as three engineering problems are used for the performance evaluation. The superior ability of the proposed DAO is demonstrated by the examination of the numerical data produced and its comparison with existing metaheuristic algorithms.