2020 IEEE Intl Conf on Parallel &Amp; Distributed Processing With Applications, Big Data &Amp; Cloud Computing, Sustainable Com 2020
DOI: 10.1109/ispa-bdcloud-socialcom-sustaincom51426.2020.00093
|View full text |Cite
|
Sign up to set email alerts
|

An Improved Sparrow Search Algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
9
0

Year Published

2022
2022
2023
2023

Publication Types

Select...
7
2

Relationship

0
9

Authors

Journals

citations
Cited by 27 publications
(12 citation statements)
references
References 20 publications
0
9
0
Order By: Relevance
“…Using ( 2) or ( 12) to update the scroungers' position; (10) end for (11) for i � 1: SD do (12) Using equation ( 3) to update the scouters' position; (13) end for (14) for i � 1: N do (15) if the new position is better than the previous position then (16) Using the new position to update the previous position; (17) end if (18) if the new position is better than the optimal position then (19) Using the new position to update the optimal position; (20) end if (21) end for (22) t � t + 1 (23) end while (24) return f best , X best ALGORITHM 1: Te improved sparrow search algorithm. Computational Intelligence and Neuroscience Equation ( 13) can be expressed as a matrix as follows:…”
Section: Inputmentioning
confidence: 99%
See 1 more Smart Citation
“…Using ( 2) or ( 12) to update the scroungers' position; (10) end for (11) for i � 1: SD do (12) Using equation ( 3) to update the scouters' position; (13) end for (14) for i � 1: N do (15) if the new position is better than the previous position then (16) Using the new position to update the previous position; (17) end if (18) if the new position is better than the optimal position then (19) Using the new position to update the optimal position; (20) end if (21) end for (22) t � t + 1 (23) end while (24) return f best , X best ALGORITHM 1: Te improved sparrow search algorithm. Computational Intelligence and Neuroscience Equation ( 13) can be expressed as a matrix as follows:…”
Section: Inputmentioning
confidence: 99%
“…However, this method is stochastic and does not make full use of the information carried by high-quality individuals in the initial population. Song et al [19] introduce nonlinear decreasing weight to improve the ability of global exploration and local exploitation, but this method cannot improve the ability to jump out of the local optimal solution. Zhang et al [20] combine the sine cosine algorithm with SSA to help SSA jump out of the local optimal solution, but this method is stochastic, and if the solution space is not well selected, it still cannot jump out of the local optimal solution.…”
Section: Introductionmentioning
confidence: 99%
“…Based on this, a method combining the global search ability algorithms such as sine-cosine algorithm [62], bird swarm algorithm [63], firefly algorithm [53], and differential evolution algorithm [64] with the discoverers in SSA is proposed, which improves the global search ability of SSA with the excellent global search ability of other algorithms, "using other spears, strengthening our spears." At the same time, another adaptive improvement strategy based on balanced 12 Wireless Communications and Mobile Computing exploratory development capability is introduced into SSA, such as nonlinear inertial weight [53,65], adaptive distribution [66], and adaptive control step [67], to increase the global search capability by enhancing the previous exploratory capability. The above improvements are mainly aimed at the discoverers who occupy a minority of the population and are responsible for guiding the direction of the population.…”
Section: Biological Characteristicsmentioning
confidence: 99%
“…J. Dong proposed a niche multi-objective SSA algorithm, introduced Lévy flight interference tactics to upgrade the capability of the SSA algorithm to skip away from the regional optimal, and used the algorithm to optimize the distributed power capacity configuration [35]. W. Song utilized a chaotic tent map to initialize people and adjusted the population using a nonlinear decreasing weight, a mutation strategy, and a chaotic search method to improve the population quality and expand the search range, thus enhancing the aptitude of the algorithm to skip away from the regional optimal [36]. G. Liu introduced an improved SSA into the UAV path-planning problem and used the global and local probe and development capabilities of the algorithm to enhance the speed and precision of path planning [37].…”
Section: Introductionmentioning
confidence: 99%