An adaptive resistance and stamina strategy-based dragonfly algorithm for solving engineering optimization problems

被引:24
作者
Yuan, Yongliang [1 ,2 ]
Wang, Shuo [2 ]
Lv, Liye [2 ,3 ]
Song, Xueguan [2 ]
机构
[1] Henan Polytech Univ, Sch Mech & Power Engn, Jiaozuo, Henan, Peoples R China
[2] Dalian Univ Technol, Sch Mech Engn, Dalian, Peoples R China
[3] Zhejiang Sci Tech Univ, Fac Mech Engn & Automat, Hangzhou, Peoples R China
关键词
Adaptive resistance and stamina strategy; Bucket wheel reclaimer; Dragonfly algorithm; Optimization algorithm; SEARCH; ADAPTATION; COST;
D O I
10.1108/EC-08-2019-0362
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Purpose Highly non-linear optimization problems exist in many practical engineering applications. To deal with these problems, this study aims to propose an improved optimization algorithm, named, adaptive resistance and stamina strategy-based dragonfly algorithm (ARSSDA). Design/methodology/approach To speed up the convergence, ARSSDA applies an adaptive resistance and stamina strategy (ARSS) to conventional dragonfly algorithm so that the search step can be adjusted appropriately in each iteration. In ARSS, it includes the air resistance and physical stamina of dragonfly during a flight. These parameters can be updated in real time as the flight status of the dragonflies. Findings The performance of ARSSDA is verified by 30 benchmark functions of Congress on Evolutionary Computation 2014's special session and 3 well-known constrained engineering problems. Results reveal that ARSSDA is a competitive algorithm for solving the optimization problems. Further, ARSSDA is used to search the optimal parameters for a bucket wheel reclaimer (BWR). The aim of the numerical experiment is to achieve the global optimal structure of the BWR by minimizing the energy consumption. Results indicate that ARSSDA generates an optimal structure of BWR and decreases the energy consumption by 22.428% compared with the initial design. Originality/value A novel search strategy is proposed to enhance the global exploratory capability and convergence speed. This paper provides an effective optimization algorithm for solving constrained optimization problems.
引用
收藏
页码:2228 / 2251
页数:24
相关论文
共 37 条
[1]  
Abdullah A., 2013, PLOS ONE, V8, P1
[3]  
Biswas S, 2014, 2014 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), P1076, DOI 10.1109/CEC.2014.6900484
[4]  
Santos AC, 2018, REV CUBA ING, V9, P1
[5]  
Erlich I, 2014, 2014 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), P1625, DOI 10.1109/CEC.2014.6900516
[6]   Water cycle algorithm - A novel metaheuristic optimization method for solving constrained engineering optimization problems [J].
Eskandar, Hadi ;
Sadollah, Ali ;
Bahreininejad, Ardeshir ;
Hamdi, Mohd .
COMPUTERS & STRUCTURES, 2012, 110 :151-166
[7]   A TABU SEARCH HEURISTIC FOR THE VEHICLE-ROUTING PROBLEM [J].
GENDREAU, M ;
HERTZ, A ;
LAPORTE, G .
MANAGEMENT SCIENCE, 1994, 40 (10) :1276-1290
[8]  
Gu F., 2012, INT J COMPUTATION SC, V3/4, P197
[9]   Optimal tuning of 3 degree-of-freedom proportional-integral-derivative controller for hybrid distributed power system using dragonfly algorithm [J].
Guha, Dipayan ;
Roy, Provas Kumar ;
Banerjee, Subrate .
COMPUTERS & ELECTRICAL ENGINEERING, 2018, 72 :137-153
[10]   Reducing the time complexity of the derandomized evolution strategy with covariance matrix adaptation (CMA-ES) [J].
Hansen, N ;
Muller, SD ;
Koumoutsakos, P .
EVOLUTIONARY COMPUTATION, 2003, 11 (01) :1-18