An efficient modified grey wolf optimizer with Lévy flight for optimization tasks |
| |
Affiliation: | 1. Department of Information Technology, Al-Huson University College, Al-Balqa Applied University, Irbid, Jordan;2. Department of Computer Science, Al-Aqsa University, P.O. Box 4051, Gaza, Palestine;3. King Abdullah II School for Information Technology, The University of Jordan, Amman, Jordan;4. Department of Computer Information Systems, Al-Balqa Applied University, Al-Salt, 19117, Jordan;1. School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan 430074, China;2. Department of Mathematics, Faculty of Science, Zagazig University, Zagazig, Egypt |
| |
Abstract: | The grey wolf optimizer (GWO) is a new efficient population-based optimizer. The GWO algorithm can reveal an efficient performance compared to other well-established optimizers. However, because of the insufficient diversity of wolves in some cases, a problem of concern is that the GWO can still be prone to stagnation at local optima. In this article, an improved modified GWO algorithm is proposed for solving either global or real-world optimization problems. In order to boost the efficacy of GWO, Lévy flight (LF) and greedy selection strategies are integrated with the modified hunting phases. LF is a class of scale-free walks with randomly-oriented steps according to the Lévy distribution. In order to investigate the effectiveness of the modified Lévy-embedded GWO (LGWO), it was compared with several state-of-the-art optimizers on 29 unconstrained test beds. Furthermore, 30 artificial and 14 real-world problems from CEC2014 and CEC2011 were employed to evaluate the LGWO algorithm. Also, statistical tests were employed to investigate the significance of the results. Experimental results and statistical tests demonstrate that the performance of LGWO is significantly better than GWO and other analyzed optimizers. |
| |
Keywords: | Optimization Lévy flight Grey wolf optimizer Metaheuristic |
本文献已被 ScienceDirect 等数据库收录! |
|