Local search enhanced Aquila optimization algorithm ameliorated with an ensemble of Wavelet mutation strategies for complex optimization problems

Abstract

Aquila Optimization Algorithm (AQUILA) is a newly emerged metaheuristic optimizer for solving global optimization problems, which is based on intrinsic hunting behaviors of the foraging aquila individuals. However, this stochastic optimization method suffers from some algorithm-specific drawbacks, such as premature convergence to the local optimum points over the search hyperspace due to the lack of solution diversity in the population. To conquer this algorithmic deficiency, an ensemble of Wavelet mutation operators has been implemented into the standard AQUILA to enhance the explorative capabilities of the algorithm by diversifying the search domain as much as possible. Furthermore, a brand-new local search scheme empowered by the synergetic interactions of elite opposition-based learning and a simple-yet-effective exploitative manipulation equation is introduced into the base AQUILA to intensify on the previously visited promising regions. The proposed learning schemes are stochastically applied to the obtained solutions from the base Aquila algorithm to refine the overall solution quality and amend the premature convergence problem. It is also aimed to investigate whether the collective application of Wavelet mutation operators with different types entails a significant improvement in the general search effectivity of the algorithm rather than their individual efforts. Numerical experiments made on a suite of unconstrained unimodal and multimodal benchmark functions reveal that this hybridization with AQUILA has improved the general solution accuracy and stability to very high standards, outperforming its contemporary counterparts in the comparative statistical analysis. Furthermore, an exhaustive benchmark analysis has been performed on fourteen constrained real-world complex engineering problems.