6533b82bfe1ef96bd128e24c

RESEARCH PRODUCT

Dynamic programming and Munkres algorithm for optimal photovoltaic arrays reconfiguration

Marzia CardinaleVincenzo Li VigniEleonora Riva SanseverinoThanh Ngo NgocThanh Ngo NgocFabio ViolaDomenico MussoPietro Romano

subject

Mathematical optimizationRenewable Energy Sustainability and the EnvironmentComputer sciencePhotovoltaic systemMismatch Photovoltaic modules Optimization Reconfiguration.Control reconfigurationPower (physics)Settore ING-IND/33 - Sistemi Elettrici Per L'EnergiaDynamic programmingSettore ING-IND/31 - ElettrotecnicaHungarian algorithmKnapsack problemControl systemSubset sum problemGeneral Materials Science

description

Abstract In this paper, an original formulation of the control problem for optimal PV array reconfiguration, following a Total Cross Tied layout, is proposed. The formulation follows the well-known subset sum problem, which is a special case of the knapsack problem. The reconfiguration is a measure devoted to mitigate the mismatch effect and maximize the output power of small photovoltaic plants under non-homogeneous working conditions. Therefore, reconfiguration means changing the connections of the solar panels adaptively by a dynamic switching matrix. The control system implements an easy dynamic programming algorithm to change the switches layout. The use of the Munkres assignment method in a post-processing module makes the algorithm able to obtain the optimum configuration for which it is possible to balance and minimize the aging of the switches within the switching matrix.

yearjournalcountryeditionlanguage
2015-12-01Solar Energy
https://doi.org/10.1016/j.solener.2015.09.016