2021
DOI: 10.1155/2021/3946958
|View full text |Cite
|
Sign up to set email alerts
|

A Learning Sparrow Search Algorithm

Abstract: This paper solves the drawbacks of traditional intelligent optimization algorithms relying on 0 and has good results on CEC 2017 and benchmark functions, which effectively improve the problem of algorithms falling into local optimality. The sparrow search algorithm (SSA) has significant optimization performance, but still has the problem of large randomness and is easy to fall into the local optimum. For this reason, this paper proposes a learning sparrow search algorithm, which introduces the lens reverse lea… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
36
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
8
1

Relationship

2
7

Authors

Journals

citations
Cited by 71 publications
(36 citation statements)
references
References 26 publications
0
36
0
Order By: Relevance
“…A learning SSA (LSSA) [ 65 ] is introduced in the discoverer stage. The random reverse learning technique promotes population variety and flexibility in the search process.…”
Section: Methods Of Ssamentioning
confidence: 99%
“…A learning SSA (LSSA) [ 65 ] is introduced in the discoverer stage. The random reverse learning technique promotes population variety and flexibility in the search process.…”
Section: Methods Of Ssamentioning
confidence: 99%
“…Literature [ 27 ] makes full use of the current dominant individuals through the iterative local search mechanism, making the search method more diversified and the optimization accuracy more detailed. Literature [ 28 ] introduced the dimension-by-dimension lens learning mechanism to reduce the interference between dimensions and accelerate the convergence of the population. Inspired by logistic model, literature [ 29 ] proposed a new adaptive factor to dynamically control the safety threshold, which balances the ability of global search and local development of the algorithm.…”
Section: Introductionmentioning
confidence: 99%
“…Then, a differential evolution approach was also presented to avoid missing high-quality solutions to enhance the ability to escape local optima. Finally, the algorithm's feasibility was verified by comparing three SSA variants and three classical SI algorithms [13]. Wang et al used Bernoulli chaos mapping and adaptive weighting factors to improve the global search range of the SSA and used a hybrid Cauchy mutation and reverse learning to jump out of the local optimum.…”
Section: Introductionmentioning
confidence: 99%