Gazelle-Inspired Algorithm Learns to Stride Through Solar Shading Problems

When a passing cloud, a falling leaf, or a nearby building casts its shadow across a solar array, the panels no longer behave as a single, well-behaved power source. Instead, the current-voltage curve fractures into a landscape of multiple peaks, and the true maximum power point hides among local impostors. Conventional tracking methods, which were designed for smooth, single-peak conditions, can become stranded on one of these false summits, silently forfeiting a significant fraction of the array’s output. A team of researchers led by Lee Yan Kang and Tan Jian Ding of Xiamen University Malaysia, working with collaborators in China, Malaysia and Iraq, has now proposed a way to make a nature-inspired search algorithm smart enough to navigate this treacherous terrain, and their results suggest that the trick lies in teaching the algorithm to change its stride.

The study, published in Neural Computing and Applications, introduces an Enhanced Gazelle Optimization Algorithm, or EGOA, built on top of the relatively recent gazelle optimization algorithm, a metaheuristic that mimics the survival behavior of gazelles in the wild. The core problem the researchers set out to solve is one that plagues nearly every population-based optimizer: the trade-off between convergence speed and solution precision. Algorithms that take large steps through the search space explore quickly but tend to overshoot and oscillate around the optimum. Algorithms that take small steps settle precisely but crawl toward the answer and can be trapped by local optima. Most implementations fix the step size in advance, forcing the algorithm to live with whichever compromise its designer chose.

EGOA breaks that compromise with a self-adaptive step-size mechanism. Early in the search, when the algorithm knows little about the landscape, the step size is large, encouraging rapid exploration and allowing the population of candidate solutions to sweep broadly across the problem space. As the search progresses and the algorithm closes in on promising regions, the step size shrinks automatically, shifting the emphasis from exploration to fine-grained exploitation. In the language of the paper, a step-size regulator governs how candidate solutions, described as search agents, add or subtract step increments from their current positions while chasing the best solution found so far. The result is an optimizer that sprints at the start and tiptoes at the finish, without any manual tuning of when to switch between the two modes.

To test whether this adaptive stride actually matters, the researchers benchmarked EGOA against a deliberately constructed family of rivals: a large-step version of the gazelle algorithm, a small-step version, the Grey Wolf Optimizer, Particle Swarm Optimization, and the conventional Perturb and Observe algorithm that remains the workhorse of commercial solar charge controllers. The evaluation proceeded in two stages. First, the algorithms were run on standard optimization benchmark functions, mathematical landscapes with known optima that allow convergence speed and accuracy to be measured precisely. EGOA demonstrated a superior balance between convergence speed and solution accuracy compared with the fixed-step gazelle variants and the swarm-based baselines, confirming that the adaptive mechanism addresses exactly the weakness it was designed to fix.

The second and more application-focused stage involved photovoltaic maximum power point tracking, the control problem that determines how much usable electricity a solar installation actually delivers. In simulations, the researchers subjected a photovoltaic system to ideal, uniform irradiance and to a series of separated partial shading conditions, the scenarios in which different parts of the array receive different levels of sunlight. Under every one of these conditions, EGOA achieved exact maximum power point tracking: the average power it tracked equaled the corresponding maximum available power, and the standard deviation across repeated runs was near zero. That combination of accuracy and repeatability is the gold standard for a tracking controller, because a real-world installation cannot afford an algorithm that finds the right answer only occasionally.

The contrast with the incumbent technology was stark. Perturb and Observe, which nudges the operating voltage up or down and watches how the power responds, exhibited larger deviations and significantly higher variability under the more challenging shading cases, precisely the situations where its hill-climbing logic is most easily fooled by local peaks. The Grey Wolf Optimizer and Particle Swarm Optimization landed in between, better than the classical method but not matching the consistency of the enhanced gazelle framework. This ordering is instructive: it shows that simply adopting a modern metaheuristic is not enough, and that the internal search dynamics, in this case the step-size regulation, determine whether the algorithm can be trusted under the harshest conditions a solar farm will face.

Robustness under changing conditions matters as much as accuracy under static ones, because real clouds move. The researchers therefore ran a sequential step-change test, in which the shading pattern shifted abruptly while the algorithms were tracking. Here EGOA consistently recovered the global maximum power point more rapidly than all the benchmark algorithms, and it did so with reduced oscillatory behavior. Fewer oscillations translate directly into less wasted energy during the transition and less stress on the power electronics, since the DC-DC converter that implements the tracking decision via pulse-width modulation does not have to chase a jittery set point. In a grid increasingly dependent on solar generation, that kind of smooth, fast recovery is more than an academic nicety.

The work sits within a rapidly expanding research effort to bring metaheuristics to renewable energy systems. The paper’s own reference list traces the breadth of this movement, from surveys of black hole algorithms and reviews of microgrid optimization to applications of moth flame optimization, circle search, and modified coot optimizers for maximum power point tracking under complex shading. A systematic review by members of the same group catalogued the proliferation of nature-inspired frameworks applied to partial shading problems, and the new study can be read as a response to a gap that review identified: rather than proposing yet another animal-inspired algorithm, it improves the internal mechanics of an existing one in a way that is transparent and testable. The gazelle optimization algorithm itself was only introduced in 2023, so refining it this early in its lifecycle signals a maturing methodology in the field.

What makes the contribution technically interesting is the generality of the underlying principle. The convergence-precision trade-off is not unique to solar tracking; it appears wherever metaheuristics are applied, from engineering design optimization to scheduling and feature selection. A self-adaptive step size that promotes exploration early and exploitation late is a mechanism that could, in principle, be ported to other optimizers suffering from the same fixed-step pathology. The authors’ benchmark results, showing EGOA outperforming both deliberately weakened variants of its parent algorithm and established competitors, provide a clean demonstration that the mechanism, not the metaphor, is doing the work. That kind of controlled comparison, in which the only difference between algorithms is the step-size strategy, is exactly how claims of algorithmic improvement should be substantiated.

For the solar industry, the practical implications are straightforward. Partial shading is not an edge case; it is the everyday reality of rooftops cluttered with chimneys and antennas, of utility-scale farms bordered by vegetation, and of urban installations hemmed in by taller structures. Every percentage point of energy lost to a tracker stuck on a local peak is a point that no amount of panel efficiency can recover. A tracking controller that achieves exact maximum power extraction with near-zero run-to-run variability, and that recovers quickly when shading patterns change, addresses the problem at its source. The study was supported by the Xiamen University Malaysia Research Fund, and the authors note that the underlying data are available from the corresponding author upon reasonable request. As metaheuristic controllers continue their migration from simulation studies into commercial hardware, frameworks like EGOA suggest that the next generation of solar trackers will not merely search harder, but search smarter, adjusting their gait to the landscape the way the animal that inspired them adjusts its own to the savanna.

Subject of Research: Adaptive metaheuristic optimization for photovoltaic maximum power point tracking under partial shading conditions

Article Title: An enhanced experience-based gazelle optimization framework for mitigating partial shading condition problems in photovoltaic systems

Article References: Kang, L. Y., Ding, T. J., Hong, N. C., Han, W., Chao, K. C., Paw, J. K. S., & Abed, A. M. (2026). An enhanced experience-based gazelle optimization framework for mitigating partial shading condition problems in photovoltaic systems. Neural Computing and Applications, 38(17), Article 720. https://doi.org/10.1007/s00521-026-12440-1

Image Credits: AI Generated

DOI: 10.1007/s00521-026-12440-1

Keywords: photovoltaics, maximum power point tracking, partial shading, gazelle optimization algorithm, metaheuristics, self-adaptive step size, renewable energy, Perturb and Observe, Grey Wolf Optimizer, particle swarm optimization, convergence accuracy, solar energy