Grey Wolf Optimizer — GWO
Grey Wolf Optimizer (GWO) · Also known as: GWO, Gri Kurt Optimizasyonu, Gri Kurt Optimizasyonu (GWO)
The Grey Wolf Optimizer (GWO) is a swarm-intelligence metaheuristic introduced by Mirjalili, Mirjalili, and Lewis in 2014 that models the social hierarchy and cooperative hunting behaviour of grey wolves. A population of candidate solutions is divided into four leadership ranks — alpha, beta, delta, and omega — and the three best solutions at each iteration guide the entire swarm toward increasingly better regions of the search space.
Read the full method
Sign in with a free account to read this section.
Method map
The neighbourhood of related methods — select a node to explore.
+1 more
When to use it
GWO fits continuous optimisation problems where the objective function is expensive to evaluate analytically or is a black box. It requires no gradient information and no distributional assumptions about the data. The method is suitable for engineering design, parameter tuning, and feature selection tasks. Because it is population-based, a minimum population size of roughly 10–30 agents is advisable; very small populations reduce diversity and increase the risk of premature convergence. GWO is not appropriate for discrete or combinatorial problems without modification, nor for problems where an exact mathematical solution exists.
Strengths & limitations
- Gradient-free: works on any objective function that returns a scalar, including simulations and black-box models.
- Minimal parameterisation: only population size and iteration count need to be set; a decreases automatically.
- Balances exploration and exploitation through a single linearly decaying parameter, making the balance mechanism transparent.
- Competitive performance on engineering design benchmarks with low implementation complexity (difficulty level 2 of 5).
- Convergence is not guaranteed to the global optimum; quality depends on population diversity and iteration count.
- Not natively suited to discrete, binary, or combinatorial search spaces without custom encoding.
- Like most swarm methods, it can stagnate if the three leaders cluster prematurely in a suboptimal region.
- Scales poorly to very high-dimensional search spaces compared to gradient-based solvers when the objective is smooth.
Frequently asked
How do I choose population size and iteration count?
A common starting point is 30 agents and 200–500 iterations for moderate-dimensional problems (up to roughly 30 variables). Increase population size and iterations as problem dimensionality grows. Because GWO is stochastic, run it at least 20–30 times with different random seeds and report the mean and standard deviation of the best fitness.
Can GWO handle discrete or binary variables?
Not natively. The standard position-update equations are defined for continuous real-valued spaces. Binary or discrete variants exist in the literature — typically using a transfer function to map continuous positions to binary decisions — but these are extensions rather than the original algorithm.
How does GWO compare to Particle Swarm Optimization?
Both are swarm-intelligence methods with similar computational cost. GWO uses three leaders (alpha, beta, delta) rather than a single global best and each particle's personal best, which tends to preserve diversity longer. Mirjalili et al. (2014) found GWO competitive with or superior to PSO on their benchmark set, but performance is problem-dependent; neither method dominates universally.
What does the parameter a control, and do I need to tune it?
The parameter a decreases linearly from 2 to 0 over the course of the run and controls whether wolves explore (high a) or exploit (low a). This schedule is fixed by the algorithm — you do not tune a directly. The only levers you control are population size and the total number of iterations, which together determine how slowly or quickly a drops.
Sources
- Mirjalili, S., Mirjalili, S. M., & Lewis, A. (2014). Grey Wolf Optimizer. Advances in Engineering Software, 69, 46-61. DOI: 10.1016/j.advengsoft.2013.12.007 ↗
- Faris, H., Aljarah, I., Al-Betar, M. A., & Mirjalili, S. (2018). Grey Wolf Optimizer: A Review of Recent Variants and Applications. Neural Computing and Applications, 30(2), 413-435. DOI: 10.1007/s00521-017-3272-5 ↗
How to cite this page
ScholarGate. (2026, June 1). Grey Wolf Optimizer (GWO). ScholarGate. https://scholargate.app/en/optimization/grey-wolf-optimizer
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
- Bayesian OptimizationOptimization↔ compare
- Genetic AlgorithmOptimization↔ compare
- Particle Swarm OptimizationOptimization↔ compare
- Simulated AnnealingOptimization↔ compare
- Tabu SearchOptimization↔ compare