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 (1.5 MB)
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Research Article | Open Access

An improved aphid optimization algorithm with soft thresholding

Renyun Liu1Helei Kang2Rui Bao1Siyi Gong1Yifei Yao3Yang Wu1( )
Department of Mathematics, Changchun Normal University, Jilin 130032, China
Key Laboratory for Applied Statistics of MOE, School of Mathematics and Statistics, Northeast Normal University, Changchun 130024, China
Department of Computer Science, Changchun Normal University, Jilin 130032, China
Show Author Information

Abstract

To address excessive randomness, low late-stage convergence efficiency, and premature convergence in the aphid optimization algorithm (AOA), this study proposes a soft-threshold aphid optimization algorithm (STAOA) from a search-dynamics regulation perspective. The soft-threshold function nonlinearly controls update amplitudes to adaptively suppress or release step sizes, enhancing local exploitation while preserving global exploration and achieving a dynamic balance between them. A soft-threshold-based perturbation strategy further improves the ability to escape local optima, forming a hierarchical search regulation framework. Experiments on 23 benchmark functions, the CEC2019 test suite, and agricultural unmanned aerial vehicle (UAV) path planning tasks show that the STAOA outperforms several representative metaheuristic algorithms in accuracy, stability, and convergence speed, verifying the effectiveness of the soft-threshold mechanism in search-dynamics regulation and UAV path planning optimization.

CLC number: 90C59, 90C90

References

【1】
【1】
 
 
AIMS Mathematics
Pages 3534-3559

{{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:
Liu R, Kang H, Bao R, et al. An improved aphid optimization algorithm with soft thresholding. AIMS Mathematics, 2026, 11(2): 3534-3559. https://doi.org/10.3934/math.2026144

201

Views

5

Downloads

1

Crossref

1

Web of Science

1

Scopus

Received: 08 December 2025
Revised: 22 January 2026
Accepted: 02 February 2026
Published: 05 February 2026
©2026 the Author(s), licensee AIMS Press.

This is an open access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0)