Dynamic programming and Munkres algorithm for optimal photovoltaic arrays reconfiguration

Volume: 122, Pages: 347 - 358
Published: Dec 1, 2015
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,...
Paper Details
Title
Dynamic programming and Munkres algorithm for optimal photovoltaic arrays reconfiguration
Published Date
Dec 1, 2015
Volume
122
Pages
347 - 358
Citation AnalysisPro
  • Scinapse’s Top 10 Citation Journals & Affiliations graph reveals the quality and authenticity of citations received by a paper.
  • Discover whether citations have been inflated due to self-citations, or if citations include institutional bias.