2022
DOI: 10.1063/5.0108340
|View full text |Cite
|
Sign up to set email alerts
|

Boosting sparrow search algorithm for multi-strategy-assist engineering optimization problems

Abstract: An improved optimization algorithm, namely, multi-strategy-sparrow search algorithm (MSSSA), is proposed to solve highly non-linear optimization problems. In MSSSA, a circle map is utilized to improve the quality of the population. Moreover, the adaptive survival escape strategy (ASES) is proposed to enhance the survival ability of sparrows. In the producer stage, the craziness factor integrated with ASES is introduced to enhance the search accuracy and survival ability. In the scout stage, the ASES facilitate… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(2 citation statements)
references
References 72 publications
0
2
0
Order By: Relevance
“…The reverse mutation of center of gravity [79] is expressed like this: Let (x1j, x2j, ..., xNj) be the value of N spiders in the j-th dimension, the number of the population be N and the number of the dimensions be D. Then the center of gravity of the spider population in the j-th dimension is described by Eq. (10). The center of gravity of the population is Zg=(Z1, Z2, ..., Zj, ..., ZD).…”
Section: Cauchy Barycenter Reverse Differential Mutation Operatormentioning
confidence: 99%
See 1 more Smart Citation
“…The reverse mutation of center of gravity [79] is expressed like this: Let (x1j, x2j, ..., xNj) be the value of N spiders in the j-th dimension, the number of the population be N and the number of the dimensions be D. Then the center of gravity of the spider population in the j-th dimension is described by Eq. (10). The center of gravity of the population is Zg=(Z1, Z2, ..., Zj, ..., ZD).…”
Section: Cauchy Barycenter Reverse Differential Mutation Operatormentioning
confidence: 99%
“…They can obtain the optimal solution with a high probability. Therefore, many algorithms have been employed for solving engineering constrained optimization problems, such as golden jackal optimization algorithm [5], alpine skiing optimization [6], niche chimp optimization algorithm [7], novel equilibrium optimizer of Lévy flight and iterative cosine operator [8], improved chaotic Harris hawks optimizer [9], boosting sparrow search algorithm [10], etc.…”
Section: Introductionmentioning
confidence: 99%