Series-parallel PV arrays: A comparison between the performances of two algorithms for strings with an equal or with a different number of PV modules

In this paper the comparison between the Fast Dynamical Reconfiguration (FDR) algorithm and the Exhaustive Search Reconfiguration (ESR) algorithm is presented and discussed. Both algorithms are designed with specific reference to the Series-Parallel (SP) architecture. Moreover, in order to identify the optimal configuration, both algorithms need the knowledge of the I-V characteristics of the N PV modules of the SP array. The main difference between such algorithms is represented by the fact that, while the FDR algorithm analyzes both symmetric configurations (equal numbers of PV modules in the strings) and asymmetric configurations (different numbers of PV modules in the strings), instead the ESR algorithm considers symmetric strings only. The results of the numerical analysis puts in evidence the superior performances (at least in terms of execution times) which are exhibited by the FDR algorithm with respect to the ESR algorithm.