.png){kind=icon}
Return
Search and rescue optimization algorithm: A new optimization method for solving constrained engineering optimization problems
.png){kind=icon}
OA
AI
DOI：10.1016/j.eswa.2020.113698.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A new optimization method namely the Search and Rescue optimization algorithm (SAR) is presented here to solve constrained engineering optimization problems. This metaheuristic algorithm imitates the explorations behavior of humans during search and rescue operations. The e-constrained method is utilized as a constraint-handling technique. Besides, a restart strategy is proposed to avoid local infeasible minima in some complex constrained optimization problems. SAR is applied to solve 18 benchmark constraint functions presented in CEC 2010, 13 benchmark constraint functions, and 7 constrained engineering design problems reported in the specialized literature. The performance of SAR is compared with some state-of-the-art optimization algorithms. According to the statistical comparison results, the performance of SAR is better or highly competitive against the compared algorithms on most of the studied problems. (c) 2020 Elsevier Ltd. All rights reserved.
Keywords:
Constrained optimization
Engineering optimization problems
Search and rescue optimization algorithm
Metaheuristic algorithms
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.5
Papers:
2.9W
Citations:
10.2W
Organization
Cited Papers
ShareSaveShareSaveShareSaveUnsupervised and semi-supervised extreme learning machine with wavelet kernel for high dimensional data.png)
MEMETIC COMPUTING
MEMETIC COMPUTINGIF2.3
PREAI
ShareSaveShareSaveConstraint-handling in genetic algorithms through the use of dominance-based tournament selection
PREAI
ShareSaveShareSave
View more