Affiliations: [a] Department of Computer Science and Technology, Henan Polytechnic University, Jiaozuo, China
| [b] Department of Information Systems, Faculty of Computing and Information Technology, King Abdulaziz University, Jeddah, Saudi Arabia
Correspondence:
[*]
Corresponding authors. Hairu Guo, Department of Computer Science and Technology, Henan Polytechnic University, Jiaozuo 454000, China. E-mail: guohr@hpu.edu.cn. and Yudong Zhang, Department of Information Systems, Faculty of Computing and Information Technology, King Abdulaziz University, Jeddah 21589, Saudi Arabia. E-mail: yudongzhang@ieee.org.
Abstract: The Aquila optimization (AO) algorithm has the drawbacks of local optimization and poor optimization accuracy when confronted with complex optimization problems. To remedy these drawbacks, this paper proposes an Enhanced aquila optimization (EAO) algorithm. To avoid elite individual from entering the local optima, the elite opposition-based learning strategy is added. To enhance the ability of balancing global exploration and local exploitation, a dynamic boundary strategy is introduced. To elevate the algorithm’s convergence rapidity and precision, an elite retention mechanism is introduced. The effectiveness of EAO is evaluated using CEC2005 benchmark functions and four benchmark images. The experimental results confirm EAO’s viability and efficacy. The statistical results of Freidman test and the Wilcoxon rank sum test are confirmed EAO’s robustness. The proposed EAO algorithm outperforms previous algorithms and can useful for threshold optimization and pressure vessel design.
