Skip to content
naulon
Not checkedNot checked for notices yet.

A Solution of Implicit Model of Series-Parallel Photovoltaic Arrays by Using Deterministic and Metaheuristic Global Optimization Algorithms

Luis Miguel Pérez Archila, Juan David Bastidas-Rodríguez, Rodrigo Correa and 2 more

Energies · 2020

doi:10.3390/en13040801 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

The implicit model of photovoltaic (PV) arrays in series-parallel (SP) configuration does not require the LambertW function, since it uses the single-diode model, to represent each submodule, and the implicit current-voltage relationship to construct systems of nonlinear equations that describe the electrical behavior of a PV generator. However, the implicit model does not analyze different solution methods to reduce computation time. This paper formulates the solution of the implicit model of SP arrays as an optimization problem with restrictions for all the variables, i.e., submodules voltages, blocking diode voltage, and strings currents. Such an optimization problem is solved by using two deterministic (Trust-Region Dogleg and Levenberg Marquard) and two metaheuristics (Weighted Differential Evolution and Symbiotic Organism Search) optimization algorithms to reproduce the current−voltage (I−V) curves of small, medium, and large generators operating under homogeneous and non-homogeneous conditions. The performance of all optimization algorithms is evaluated with simulations and experiments. Simulation results indicate that both deterministic optimization algorithms correctly reproduce I−V curves in all the cases; nevertheless, the two metaheuristic optimization methods only reproduce the I−V curves for small generators, but not for medium and large generators. Finally, experimental results confirm the simulation results for small arrays and validate the reference model used in the simulations.

Abstract licence: CC BY

Reads

Read by people on this page

None yet.

Checked or read by AI through naulon

None yet.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

Are you an author?

Is this your paper?

Claim it to add your note and be paid when agents cite it. Free.