A Modified Variant of Grey Wolf Optimizer

Document Type: Article

Author

Department of Mathematics, Punjabi University, Patiala

Abstract

The original version of Grey Wolf Optimization (GWO) algorithm has small number of disadvantages of low solving accuracy, bad local searching ability and slow convergence rate. In order to overcome these disadvantages of Grey Wolf Optimizer, a new version of Grey Wolf Optimizer algorithm has been proposed by modifying the encircling behavior and position update equations of Grey Wolf Optimization Algorithm. The accuracy and convergence performance of modified variant is tested on several well known classical further more like sine dataset and cantilever beam design functions. For verification, the results are compared with some of the most powerful well known algorithms i.e. Particle Swarm Optimization, Grey Wolf Optimizer and Mean Grey Wolf Optimization. The experimental solutions demonstrate that the modified variant is able to provide very competitive solutions in terms of improved minimum objective function value, maximum objective function value, mean, standard deviation and convergence rate.

Keywords