An exploration-enhanced grey wolf optimizer to solve high-dimensional numerical optimization

被引:222
作者
Long, Wen [1 ,2 ]
Jiao, Jianjun [2 ]
Liang, Ximing [3 ]
Tang, Mingzhu [4 ]
机构
[1] Guizhou Univ Finance & Econ, Key Lab Econ Syst Simulat, Guiyang 550025, Guizhou, Peoples R China
[2] Guizhou Univ Finance & Econ, Sch Math & Stat, Guiyang 550025, Guizhou, Peoples R China
[3] Beijing Univ Civil Engn & Architecture, Sch Sci, Beijing 100044, Peoples R China
[4] Changsha Univ Sci & Technol, Sch Energy Power & Engn, Changsha 410114, Hunan, Peoples R China
基金
中国国家自然科学基金;
关键词
Grey wolf optimizer; Exploration; Exploitation; High-dimensional numerical optimization; Global optimization; ARTIFICIAL BEE COLONY; PARTICLE SWARM OPTIMIZATION; HARMONY SEARCH ALGORITHM; DIFFERENTIAL EVOLUTION; GLOBAL OPTIMIZATION; DESIGN OPTIMIZATION; GENETIC ALGORITHM; FIREFLY ALGORITHM; POWER DISPATCH; BAT ALGORITHM;
D O I
10.1016/j.engappai.2017.10.024
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Grey wolf optimizer (GWO) algorithm is a relatively novel population-based optimization technique that has the advantage of less control parameters, strong global optimization ability and easy of implementation. It has received significant interest from researchers in different fields. However, there is still an insufficiency in the GWO algorithm regarding its position-updated equation, which is good at exploitation but poor at exploration. In this work, we proposed an improved algorithm called the exploration-enhanced GWO (EEGWO) algorithm. In order to improve the exploration, a new position-updated equation is presented by applying a random individual in the population to guide the search of new candidate individuals. In addition, in order to make full use of and balance the exploration and exploitation of the GWO algorithm, we introduced a nonlinear control parameter strategy, i.e., the control parameter of (a) over right arrow is nonlinearly increased over the course of iterations. The experimental result on a set of 23 benchmark functions and 4 engineering applications demonstrate the effectiveness and efficiency of the modified position-updated equation and the nonlinear control parameter strategy. The comparisons show that the proposed EEGWO algorithm significantly improves the performance of GWO. Moreover, EEGWO offers the highest solution quality, strongest robustness, and fastest global convergence among all of the contenders on almost all of the test functions. (C) 2017 Elsevier Ltd. All rights reserved.
引用
收藏
页码:63 / 80
页数:18
相关论文
共 96 条
[1]  
[Anonymous], INFORM SCI
[2]   Performance evaluation of an improved harmony search algorithm for numerical optimization: Melody Search (MS) [J].
Ashrafi, S. M. ;
Dariane, A. B. .
ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2013, 26 (04) :1301-1321
[3]   A novel metaheuristic method for solving constrained engineering optimization problems: Crow search algorithm [J].
Askarzadeh, Alireza .
COMPUTERS & STRUCTURES, 2016, 169 :1-12
[4]   Adaptive firefly algorithm with chaos for mechanical design optimization problems [J].
Baykasoglu, Adil ;
Ozsoydan, Fehmi Burcin .
APPLIED SOFT COMPUTING, 2015, 36 :152-164
[5]   Design optimization with chaos embedded great deluge algorithm [J].
Baykasoglu, Adil .
APPLIED SOFT COMPUTING, 2012, 12 (03) :1055-1067
[6]  
Belegund A., 1982, THESIS
[7]   A STUDY OF MATHEMATICAL-PROGRAMMING METHODS FOR STRUCTURAL OPTIMIZATION .1. THEORY [J].
BELEGUNDU, AD ;
ARORA, JS .
INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING, 1985, 21 (09) :1583-1599
[8]   An upgraded artificial bee colony (ABC) algorithm for constrained optimization problems [J].
Brajevic, Ivona ;
Tuba, Milan .
JOURNAL OF INTELLIGENT MANUFACTURING, 2013, 24 (04) :729-740
[9]   New directional bat algorithm for continuous optimization problems [J].
Chakri, Asma ;
Khelif, Rabia ;
Benouaret, Mohamed ;
Yang, Xin-She .
EXPERT SYSTEMS WITH APPLICATIONS, 2017, 69 :159-175
[10]   A robust ant colony optimization for continuous functions [J].
Chen, Zhiming ;
Zhou, Shaorui ;
Luo, Jieting .
EXPERT SYSTEMS WITH APPLICATIONS, 2017, 81 :309-320