A novel Random Walk Grey Wolf Optimizer

被引:318
作者
Gupta, Shubham [1 ]
Deep, Kusum [1 ]
机构
[1] Indian Inst Technol Roorkee, Dept Math, Roorkee 247667, Uttarakhand, India
关键词
Optimization; Swarm intelligence; Grey Wolf Optimizer; Random walk; ALGORITHM; OPERATOR; SEARCH;
D O I
10.1016/j.swevo.2018.01.001
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Grey Wolf Optimizer (GWO) algorithm is a relatively new algorithm in the field of swarm intelligence for solving continuous optimization problems as well as real world optimization problems. The Grey Wolf Optimizer is the only algorithm in the category of swam intelligence which is based on leadership hierarchy. This paper has three important aspects-Firstly, for improving the search ability by grey wolf a modified algorithm RW-GWO based on random walk has been proposed. Secondly, its performance is exhibited in comparison with GWO and state of art algorithms GSA, CS, BBO and SOS on IEEE CEC 2014 benchmark problems. A non-parametric test Wilcoxon and Performance Index Analysis has been performed to observe the impact of improving the leaders in the proposed algorithm. The results presented in this paper demonstrate that the proposed algorithm provide a better leadership to search a prey by grey wolves. The third aspect of the paper is to use the proposed algorithm and GWO on real life application problems. It is concluded from this article that RW-GWO algorithm is an efficient and reliable algorithm for solving not only continuous optimization problems but also for real life optimization problems.
引用
收藏
页码:101 / 112
页数:12
相关论文
共 52 条
[1]  
Arora, 2004, Introduction to Optimum Design
[2]  
Auger A, 2005, IEEE C EVOL COMPUTAT, P1769
[3]  
Bansal J.C., 2014, SPIDER MONKEY OPTIMI, P31
[4]   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
[5]   Symbiotic Organisms Search: A new metaheuristic optimization algorithm [J].
Cheng, Min-Yuan ;
Prayogo, Doddy .
COMPUTERS & STRUCTURES, 2014, 139 :98-112
[6]   Constraint-handling in genetic algorithms through the use of dominance-based tournament selection [J].
Coello, CAC ;
Montes, EM .
ADVANCED ENGINEERING INFORMATICS, 2002, 16 (03) :193-203
[7]   Use of a self-adaptive penalty approach for engineering optimization problems [J].
Coello, CAC .
COMPUTERS IN INDUSTRY, 2000, 41 (02) :113-127
[8]  
Das Satyajit., 2011, EXTREME MONEY MASTER, V1, P1
[9]   An efficient constraint handling method for genetic algorithms [J].
Deb, K .
COMPUTER METHODS IN APPLIED MECHANICS AND ENGINEERING, 2000, 186 (2-4) :311-338
[10]  
Deb K., 1996, Comput. Sci. Inf., V26, P30, DOI DOI 10.1109/TEVC.2007.895269