A New Optimization Algorithm Based on Search and Rescue Operations

被引:84
作者
Shabani, Amir [1 ]
Asgarian, Behrouz [1 ]
Gharebaghi, Saeed Asil [1 ]
Salido, Miguel A. [2 ]
Giret, Adriana [3 ]
机构
[1] KN Toosi Univ Technol, Fac Civil Engn, Tehran, Iran
[2] Univ Politecn Valencia, Inst Automat & Informat Ind, Valencia, Spain
[3] Univ Politecn Valencia, Dept Sistemas Informat & Comp, Valencia, Spain
关键词
STRUCTURAL OPTIMIZATION; FIREFLY ALGORITHM; DESIGN; COLONY; NETWORK; SWARM;
D O I
10.1155/2019/2482543
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
In this paper, a new optimization algorithm called the search and rescue optimization algorithm (SAR) is proposed for solving single-objective continuous optimization problems. SAR is inspired by the explorations carried out by humans during search and rescue operations. The performance of SAR was evaluated on fifty-five optimization functions including a set of classic benchmark functions and a set of modern CEC 2013 benchmark functions from the literature. The obtained results were compared with twelve optimization algorithms including well-known optimization algorithms, recent variants of GA, DE, CMA-ES, and PSO, and recent metaheuristic algorithms. The Wilcoxon signed-rank test was used for some of the comparisons, and the convergence behavior of SAR was investigated. The statistical results indicated SAR is highly competitive with the compared algorithms. Also, in order to evaluate the application of SAR on real-world optimization problems, it was applied to three engineering design problems, and the results revealed that SAR is able to find more accurate solutions with fewer function evaluations in comparison with the other existing algorithms. Thus, the proposed algorithm can be considered an efficient optimization method for real-world optimization problems.
引用
收藏
页数:23
相关论文
共 74 条
[1]  
[Anonymous], 2014, INT J OPTIMIZATION C
[2]  
[Anonymous], SAR FIELD SEARCH MET
[3]  
[Anonymous], P ASME INT DES ENG T
[4]  
[Anonymous], SWARM EVOLUTIONARY C
[5]  
[Anonymous], F1848 ASTM
[6]  
[Anonymous], F1847 ASTM
[7]  
[Anonymous], 2012, IEEE C EVOL COMPUTAT
[8]  
[Anonymous], 2016, PARTICLE SWARM OPTIM
[9]  
[Anonymous], 2009 NABIC 2009 WORL
[10]  
[Anonymous], 2005, COMPUT INFORM SCI