Systems and Soft Computing (Dec 2022)
A comparative study between deterministic and two meta-heuristic algorithms for solar PV MPPT control under partial shading conditions
Abstract
During partial shading conditions (PSC), the PV modules in a solar PV array become reverse biased and act as a load, resulting in hotspot issues. This can significantly decrease the efficiency of the solar PV. The general way to deal with PSC is to connect bypass diodes across the non-shaded PV module. However, this will alter the uniform characteristics of the PV array, resulting in multiple power peaks i.e., a multi modal landscape. The conventional gradient-based Perturb and Observe (PnO) algorithm generally used for maximum power point tracking (MPPT) in solar PV is ineffective in finding the maximum power during PSC because it is prone to converge to local optimum due to its nature of searching in a multimodal landscape. However, in this article an attempt is made to show how the PnO behaves in a multimodal landscape considering different starting points. Robust stochastic algorithms that are based on a population of search agents are used to guarantee convergence to the global MPP. In this paper, the maximum power point under PSC was tracked using two meta-heuristic algorithms namely, particle swarm optimization (PSO) and the firefly algorithm (FA). The performances of these algorithms in tracking the maximum power point are evaluated. The efficiency, standard deviation (STD), and root mean square error (RMSE) of the PSO and FA algorithms are compared to those of the PnO algorithm. The PSO was found to have the lowest RMSE, and the FA had the lowest STD. The efficiency of the PSO and FA were relatively the same. Simulation results show that PSO and FA-based MPPT algorithms can efficiently track the global maximum power point (GMPP) irrespectively of the starting points. On the other hand, PnO is shown to be unreliable under PSC even with different starting points.
