z-logo
open-access-imgOpen Access
Differential Evolution Based Solar Photovoltaic Array Reconfiguration Algorithm for Optimal Energy Extraction during Partial Shading Condition
Author(s) -
M. A. I. A. Tazally,
Mohammad Faridun Naim Tajuddin,
Azwan Iskandar Azmi,
Shahrin Md Ayob,
Tole Sutikno
Publication year - 2018
Publication title -
international journal of power electronics and drive systems (ijpeds)
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.322
H-Index - 21
ISSN - 2088-8694
DOI - 10.11591/ijpeds.v9.i3.pp1397-1405
Subject(s) - photovoltaic system , control reconfiguration , interconnection , particle swarm optimization , shading , computer science , differential evolution , maximum power principle , power (physics) , algorithm , electrical engineering , engineering , embedded system , physics , telecommunications , computer graphics (images) , quantum mechanics
To increase energy yield from an installed photovoltaic (PV) array, particularly during partial shading condition (PSC), a new technique based on reconfigurable PV array interconnection is proposed in this work. The proposed technique works by dynamically changing the interconnection of PV modules to form a new configuration using a switching matrix inside the array. The criteria of good reconfigurable PV array interconnection techniques depend on the efficiency and accuracy of the control algorithm to optimally reconfigure the PV array to maximize the total output power. Hence, this paper proposes a new control algorithm using differential evolution (DE) for photovoltaic array reconfiguration (PVAR). To verify the superiority of the proposed algorithm, DE is compared with the particle swarm optimization (PSO) algorithm. Results confirm that DE performs well in terms of the amount of energy production during PSC. For all the nine shading patterns tested on a 3 × 3 PV array, DE yields 1% to 5% more power than PSO.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here