Advances in Sparrow Search Algorithm: A Comprehensive Survey

Mathematical programming and meta-heuristics are two types of optimization methods. Meta-heuristic algorithms can identify optimal/near-optimal solutions by mimicking natural behaviours or occurrences and provide benefits such as simplicity of execution, a few parameters, avoidance of local optimiza...

Full description

Saved in:
Bibliographic Details
Published inArchives of computational methods in engineering Vol. 30; no. 1; pp. 427 - 455
Main Authors Gharehchopogh, Farhad Soleimanian, Namazi, Mohammad, Ebrahimi, Laya, Abdollahzadeh, Benyamin
Format Journal Article
LanguageEnglish
Published Dordrecht Springer Netherlands 01.01.2023
Springer Nature B.V
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:Mathematical programming and meta-heuristics are two types of optimization methods. Meta-heuristic algorithms can identify optimal/near-optimal solutions by mimicking natural behaviours or occurrences and provide benefits such as simplicity of execution, a few parameters, avoidance of local optimization, and flexibility. Many meta-heuristic algorithms have been introduced to solve optimization issues, each of which has advantages and disadvantages. Studies and research on presented meta-heuristic algorithms in prestigious journals showed they had good performance in solving hybrid, improved and mutated problems. This paper reviews the sparrow search algorithm (SSA), one of the new and robust algorithms for solving optimization problems. This paper covers all the SSA literature on variants, improvement, hybridization, and optimization. According to studies, the use of SSA in the mentioned areas has been equal to 32%, 36%, 4%, and 28%, respectively. The highest percentage belongs to Improved, which has been analyzed by three subsections: Meat-Heuristics, artificial neural networks, and Deep Learning.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:1134-3060
1886-1784
1886-1784
DOI:10.1007/s11831-022-09804-w