Modified Grey Wolf Optimizer for Global Engineering Optimization

Nitin Mittal, Urvinder Singh, B.S. Sohi

Applied Computational Intelligence and Soft Computing · 2016 · 385 citations · 47 references

DOIFull text

Open access

Concepts

TL;DR

Nature‑inspired metaheuristics are popular for their simplicity and flexibility, yet their success depends on parameter tuning, exploration–exploitation balance, and diffusion mechanisms, as illustrated by the Grey Wolf Optimizer, which has proven effective for engineering problems but traditionally splits iterations evenly between exploration and exploitation, potentially compromising global optimum accuracy. To address this, the authors propose a modified Grey Wolf Optimizer that explicitly balances exploration and exploitation to enhance algorithmic performance. The modified algorithm incorporates adaptive mechanisms that adjust the search behavior during iterations, thereby improving convergence toward the global optimum. Benchmark simulations and a wireless sensor network clustering task demonstrate that the modified GWO outperforms the original GWO and several well‑known algorithms in terms of effectiveness, efficiency, and stability.

Abstract

Nature-inspired algorithms are becoming popular among researchers due to their simplicity and flexibility. The nature-inspired metaheuristic algorithms are analysed in terms of their key features like their diversity and adaptation, exploration and exploitation, and attractions and diffusion mechanisms. The success and challenges concerning these algorithms are based on their parameter tuning and parameter control. A comparatively new algorithm motivated by the social hierarchy and hunting behavior of grey wolves is Grey Wolf Optimizer (GWO), which is a very successful algorithm for solving real mechanical and optical engineering problems. In the original GWO, half of the iterations are devoted to exploration and the other half are dedicated to exploitation, overlooking the impact of right balance between these two to guarantee an accurate approximation of global optimum. To overcome this shortcoming, a modified GWO (mGWO) is proposed, which focuses on proper balance between exploration and exploitation that leads to an optimal performance of the algorithm. Simulations based on benchmark problems and WSN clustering problem demonstrate the effectiveness, efficiency, and stability of mGWO compared with the basic GWO and some well-known algorithms.

References

47