Advances in Tree Seed Algorithm: A Comprehensive Survey

In recent years, significant research has been done to solve optimization and complex problems by metaheuristic algorithms. Metaheuristic algorithms are inspired by the observation and behavior of natural phenomena, such as animals' and plants' lives. In this paper, a comprehensive survey...

Full description

Saved in:
Bibliographic Details
Published inArchives of computational methods in engineering Vol. 29; no. 5; pp. 3281 - 3304
Main Author Gharehchopogh, Farhad Soleimanian
Format Journal Article
LanguageEnglish
Published Dordrecht Springer Netherlands 01.08.2022
Springer Nature B.V
Subjects
Online AccessGet full text
ISSN1134-3060
1886-1784
DOI10.1007/s11831-021-09698-0

Cover

More Information
Summary:In recent years, significant research has been done to solve optimization and complex problems by metaheuristic algorithms. Metaheuristic algorithms are inspired by the observation and behavior of natural phenomena, such as animals' and plants' lives. In this paper, a comprehensive survey of the tree seed algorithm (TSA) and its applications in a wide range of different fields is performed. TSA is a metaheuristic algorithm inspired by the relationships between trees and seeds in nature and how tree seeds grow and position. TSA has become a convenient algorithm for solving optimization problems in various fields with good exploration and exploitation capabilities. TSA has been used in many disciplines due to its capabilities and strengths. Since 2015, various TSA-based papers have been published in various international journals such as Elsevier, Springer, IEEE, and international conferences. This paper covers all the TSA empirical literature in hybridization, Improved, Variants and Optimization. According to studies, the use of TSA in the mentioned areas has been equal to 21, 23, 4 and 52%, respectively. Therefore, it is believed that this paper will be helpful and practical for students, academic researchers, and specialists and engineers.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1134-3060
1886-1784
DOI:10.1007/s11831-021-09698-0