A Performance Comparison of PSO based MPPT Algorithms for Various Partial Shading Conditions

Abstract

Background/Objectives: PV array being shaded partially by buildings, trees or passing clouds is common. This makes the P-V curve of the PV system complex with more than one peak. MPPT algorithm capable of consistently detecting the global peak within a short duration of time is essential. Methods/Statistical Analysis: Lately Particle Swarm Optimization (PSO) algorithm has been used for Maximum Power Point (MPP) tracking due to its ability to locate the MPP irrespective of its location in the P-V curve. This paper evaluates and compares the performance of the basic PSO algorithm and the modified PSO algorithms for ten different shading patterns. Findings: The basic PSO algorithm is compared with three modified PSO algorithms - PSO algorithm with random numbers eliminated, PSO algorithm with linearly varying constants and PSO algorithm with fixed maximum iterations. The basic PSO algorithm gives good results but random numbers in the algorithm tends to make the convergence time random for the same shading pattern and makes hardware implementation difficult. The PSO algorithm with random numbers eliminated overcomes this disadvantage and is found to give good results. But the convergence time is a little higher and varies with shading pattern. The PSO algorithm with fixed maximum iterations gives good performance with shorter and fixed convergence time. Application/Improvements: PSO algorithm with fixed maximum iterations thus improves the responsiveness of the algorithm to rapidly changing patterns of shading.