.png){kind=icon}
返回
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}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Constrained optimization
Engineering optimization problems
Search and rescue optimization algorithm
Metaheuristic algorithms
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.5
论文数:
2.9W
被引数:
10.2W
机构
引用论文
Unsupervised and semi-supervised extreme learning machine with wavelet kernel for high dimensional data.png)
MEMETIC COMPUTING
MEMETIC COMPUTINGIF2.3
PREAI
分享收藏Constraint-handling in genetic algorithms through the use of dominance-based tournament selection
PREAI
分享收藏
查看更多内容