Dynamically Dimensioned Search Grey Wolf Optimizer Based on Positional Interaction Information

被引:17
作者
Yan, Fu [1 ]
Xu, Jianzhong [1 ]
Yun, Kumchol [1 ,2 ]
机构
[1] Harbin Engn Univ, Sch Econ & Management, Harbin 150001, Heilongjiang, Peoples R China
[2] Kim Il Sung Univ, Fac Mech, Pyongyang 950003, North Korea
基金
中国国家自然科学基金; 黑龙江省自然科学基金;
关键词
PARTICLE SWARM OPTIMIZATION; ALGORITHM; DESIGN; EVOLUTIONARY; INTEGER;
D O I
10.1155/2019/7189653
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
The grey wolf optimizer (GWO) algorithm is a recently developed, novel, population-based optimization technique that is inspired by the hunting mechanism of grey wolves. The GWO algorithm has some distinct advantages, such as few algorithm parameters, strong global optimization ability, and ease of implementation on a computer. However, the paramount challenge is that there are some cases where the GWO is prone to stagnation in local optima. This drawback of the GWO algorithm may be attributed to an insufficiency in its position-updated equation, which disregards the positional interaction information about the three best grey wolves (i.e., the three leaders). This paper proposes an improved version of the GWO algorithm that is based on a dynamically dimensioned search, spiral walking predation technique, and positional interaction information (referred to as the DGWO). In addition, a nonlinear control parameter strategy, i.e., the control parameter that is nonlinearly increased with an increase in iterations, is designed to balance the exploration and exploitation of the GWO algorithm. The experimental results for 23 general benchmark functions and 3 well-known engineering optimization design applications validate the effectiveness and feasibility of the proposed DGWO algorithm. The comparison results for the 23 benchmark functions show that the proposed DGWO algorithm performs significantly better than the GWO and its improved variant for most benchmarks. The DGWO provides the highest solution precision, strongest robustness, and fastest convergence rate among the compared algorithms in almost all cases.
引用
收藏
页数:36
相关论文
共 66 条
[1]   Natural selection methods for Grey Wolf Optimizer [J].
Al-Betar, Mohammed Azmi ;
Awadallah, Mohammed A. ;
Faris, Hossam ;
Aljarah, Ibrahim ;
Hammouri, Abdelaziz, I .
EXPERT SYSTEMS WITH APPLICATIONS, 2018, 113 :481-498
[2]  
[Anonymous], 1972, APPL NONLINEAR PROGR
[3]  
[Anonymous], P 5 INT C SOFT COMP
[4]  
[Anonymous], DISCRETE DYNAMICS NA
[5]  
[Anonymous], 2009, Asian Journal of Civil Engineering (Building and Housing)
[6]   Particle Swarm Optimization Algorithm with Asymmetric Time Varying Acceleration Coefficients [J].
Bao, G. Q. ;
Mao, K. F. .
2009 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND BIOMIMETICS (ROBIO 2009), VOLS 1-4, 2009, :2134-2139
[7]   Performance of<?show [AQ ID=Q1]?> different kernel functions for LS-SVM-GWO to estimate flashover voltage of polluted insulators [J].
Bessedik, Sid Ahmed ;
Djekidel, Rabah ;
Ameur, Aissa .
IET SCIENCE MEASUREMENT & TECHNOLOGY, 2018, 12 (06) :739-745
[8]   A survey on optimization metaheuristics [J].
Boussaid, Ilhern ;
Lepagnot, Julien ;
Siarry, Patrick .
INFORMATION SCIENCES, 2013, 237 :82-117
[9]   Use of a self-adaptive penalty approach for engineering optimization problems [J].
Coello, CAC .
COMPUTERS IN INDUSTRY, 2000, 41 (02) :113-127
[10]   An improved PSO with time-varying accelerator coefficients [J].
Cui, Zhihua ;
Zeng, Jianchao ;
Yin, Weng .
ISDA 2008: EIGHTH INTERNATIONAL CONFERENCE ON INTELLIGENT SYSTEMS DESIGN AND APPLICATIONS, VOL 2, PROCEEDINGS, 2008, :638-643