AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
PDF (6.7 MB)
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Article | Open Access

Multistrategy Improved Aquila Optimizer for Test Case Prioritization

Jiali Chen1,2,3Jiheng Zhang1,2,3Xiaojie Chen1,2,3Chong Zeng1,2,3Honghui Yi1,2,3Heming Jia4( )
School of Mathematics and Information Engineering, Longyan University, Longyan, China
Fujian Provincial University Key Laboratory of Big Data Mining and Applications, Longyan University, Longyan, China
Guo Boling Academician Workstation of Longyan University, Longyan, China
School of Information Engineering, Sanming University, Sanming, China
Show Author Information

Abstract

Traditional heuristic algorithms often fall into local optima and converge slowly when test case prioritization is addressed in regression testing, making them inadequate for complex real-world scenarios. The Aquila optimizer, a novel metaheuristic algorithm, demonstrates strong global exploration capability but still faces limitations, including insufficient exploitation capability and slow convergence. To overcome these challenges, a multi-strategy improved chaotic Cauchy inverse cumulative distribution Aquila optimizer for test case prioritization is proposed. First, a logistic–sine–cosine composite chaotic mapping is introduced during the initialization phase of the Aquila optimizer to increase population diversity. Second, the mutated random walk strategy is used to improve global exploration, further enhancing the global search ability of the Aquila optimizer. Moreover, during the narrowed exploration and narrowed exploitation phases, the Cauchy inverse cumulative distribution flight replaces the Lévy flight strategy to reallocate individual positions, strengthening individuals’ optimization capability and preventing the algorithm from becoming trapped in local optima. Finally, in the later iteration stage, the specular reflection learning strategy is used to perturb the optimal individual positions and improve the Aquila optimizer’s convergence accuracy and comprehensive optimization performance. Five Java projects were selected from the Defects4J benchmark datasets to conduct comparative experiments with the Aquila optimizer and seven other metaheuristic algorithms. The results demonstrate the effectiveness and superiority of the improved algorithm in test case prioritization. It achieves average improvements of approximately 4.96% in the average percentage of fault detection, 3.82% in the average percentage of block coverage, and 5.64% in the average percentage of decision coverage, enabling faster coverage of code blocks and branches. The results provide an efficient priority sorting solution for complex regression testing scenarios.

References

【1】
【1】
 
 
Computers, Materials & Continua
Article number: 98

{{item.num}}

Comments on this article

Go to comment

< Back to all reports

Review Status: {{reviewData.commendedNum}} Commended , {{reviewData.revisionRequiredNum}} Revision Required , {{reviewData.notCommendedNum}} Not Commended Under Peer Review

Review Comment

Close
Close
Cite this article:
Chen J, Zhang J, Chen X, et al. Multistrategy Improved Aquila Optimizer for Test Case Prioritization. Computers, Materials & Continua, 2026, 88(2): 98. https://doi.org/10.32604/cmc.2026.080569

5

Views

0

Downloads

0

Crossref

0

Web of Science

0

Scopus

Received: 12 February 2026
Accepted: 11 May 2026
Published: 15 June 2026
© The Author 2026.

This work is licensed under a Creative Commons Attribution 4.0 International License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.