An improved aquila optimization algorithm integrating stochastic opposition-based learning and a mutated teaching-learning-based optimization strategy.

Saved in:

Bibliographic Details
Title:	An improved aquila optimization algorithm integrating stochastic opposition-based learning and a mutated teaching-learning-based optimization strategy.
Authors:	SONG, Yijia¹, ZHANG, Xiaoqing¹, SUN, Minmin¹, ZHANG, Li¹, LI, Na¹, ZENG, Junzhe¹
Source:	Computer Engineering & Science / Jisuanji Gongcheng yu Kexue. May2026, Vol. 48 Issue 5, p936-950. 15p.
Subjects:	Metaheuristic algorithms, Optimization algorithms, Multidisciplinary design optimization, Mathematical optimization
Abstract:	To address the shortcomings of slow convergence speed and susceptibility to local optima in the standard aquila optimization (AO) algorithm, an improved aquila optimization algorithm, TAO algorithm, is proposed by integrating stochastic opposition-based learning and a mutated teaching-learning-based optimization (TLBO) strategy. Firstly, an expanded search strategy is introduced in the initial phase to enhance the diversity of initial space exploration, and differential mutation is employed to improve the quality of optimization. Secondly, a stochastic opposition-based learning strategy is adopted to increase the number of elite individuals, thereby enhancing the algorithm's search quality. Furthermore, individual positions are updated through t-distribution mutation perturbations to boost the diversity of the search space. Meanwhile, the TLBO strategy is integrated, leveraging the teaching-learning synergy strategy to accelerate the algorithm's convergence speed. Then, simulation experiments were carried out on 23 functions with diverse characteristics (unimodal, multimodal, and fixed-dimension multimodal) selected from the CEC 2005 benchmark test suite. The results demonstrate that, compared to AO algorithm and several other heuristic intelligent optimization algorithms, TAO algorithm exhibits superior performance in terms of optimization accuracy, convergence, and stability. The Wilcoxon ranksum test results further verify that the search performance of TAO is significantly different from that of the comparative algorithms, and TAO outperforms the comparison algorithms. Finally, three engineering design optimization cases are introduced to further validate the feasibility of TAO algorithm in solving practical problems. [ABSTRACT FROM AUTHOR]
	Copyright of Computer Engineering & Science / Jisuanji Gongcheng yu Kexue is the property of Computer Engineering & Science and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database:	Engineering Source

Description
Abstract:	To address the shortcomings of slow convergence speed and susceptibility to local optima in the standard aquila optimization (AO) algorithm, an improved aquila optimization algorithm, TAO algorithm, is proposed by integrating stochastic opposition-based learning and a mutated teaching-learning-based optimization (TLBO) strategy. Firstly, an expanded search strategy is introduced in the initial phase to enhance the diversity of initial space exploration, and differential mutation is employed to improve the quality of optimization. Secondly, a stochastic opposition-based learning strategy is adopted to increase the number of elite individuals, thereby enhancing the algorithm's search quality. Furthermore, individual positions are updated through t-distribution mutation perturbations to boost the diversity of the search space. Meanwhile, the TLBO strategy is integrated, leveraging the teaching-learning synergy strategy to accelerate the algorithm's convergence speed. Then, simulation experiments were carried out on 23 functions with diverse characteristics (unimodal, multimodal, and fixed-dimension multimodal) selected from the CEC 2005 benchmark test suite. The results demonstrate that, compared to AO algorithm and several other heuristic intelligent optimization algorithms, TAO algorithm exhibits superior performance in terms of optimization accuracy, convergence, and stability. The Wilcoxon ranksum test results further verify that the search performance of TAO is significantly different from that of the comparative algorithms, and TAO outperforms the comparison algorithms. Finally, three engineering design optimization cases are introduced to further validate the feasibility of TAO algorithm in solving practical problems. [ABSTRACT FROM AUTHOR]
ISSN:	1007130X
DOI:	10.3969/j.issn.1007-130X.2026.05.017