Melola Discovery

← Melola Discovery

Open access Jurnal SINTA 1

Parametric estimation in photovoltaic modules using the crow search algorithm

International Journal of Electrical and Computer Engineering (IJECE) · Vol. 12 No. 1 (2022)

DOI
10.11591/ijece.v12i1.pp82-91
ISSN
2722-2578, 2088-8708
Published
2022-02-01
Publisher
Institute of Advanced Engineering and Science
License
creativecommons.org/licenses/by-sa/4.0

Abstract

The problem of parametric estimation in photovoltaic (PV) modules considering manufacturer information is addressed in this research from the perspective of combinatorial optimization. With the data sheet provided by the PV manufacturer, a non-linear non-convex optimization problem is formulated that contains information regarding maximum power, open-circuit, and short-circuit points. To estimate the three parameters of the PV model (i.e., the ideality diode factor (a) and the parallel and series resistances (R p and R s )), the crow search algorithm (CSA) is employed, which is a metaheuristic optimization technique inspired by the behavior of the crows searching food deposits. The CSA allows the exploration and exploitation of the solution space through a simple evolution rule derived from the classical PSO method. Numerical simulations reveal the effectiveness and robustness of the CSA to estimate these parameters with objective function values lower than 1 × 10 −28 and processing times less than 2 s. All the numerical simulations were developed in MATLAB 2020a and compared with the sine-cosine and vortex search algorithms recently reported in the literature.

Collaboration network of the authors

7 authors · 14 co-authorship links · 11 across different organisations

Hover or tap a name to highlight its co-authors. Double-click to open the author's page.

  • Universidad Distrital Francisco José de Caldas
  • Universidad Tecnológica de Pereira
  • Institución Universitaria ITM
  • Institución Universitaria Pascual Bravo
  • Different organisations
  • Same organisation
  • Affiliation unknown
  • Thicker line = more joint articles · bigger circle = more articles
Show as table
Co-authorOrganisationJoint articles
Maria Camila HerreraUniversidad Distrital Francisco José de Caldas2
Alexander Molina-CabreraUniversidad Tecnológica de Pereira2
Diego Armando Giral-RamírezUniversidad Distrital Francisco José de Caldas2
Jauder Alexander Ocampo-ToroInstitución Universitaria Pascual Bravo2

Affiliations come from OpenAlex; journal OAI-PMH metadata carries none. Authors without an OpenAlex ID are matched by name, which can merge or split people.

This record comes from Crossref (what the publisher deposited), because the journal's own OAI-PMH endpoint could not be harvested.

Metadata source: Crossref API (cadangan, berdasarkan ISSN) https://api.crossref.org/journals/2088-8708/works, first harvested 27 Okt 2026, last seen 27 Okt 2026.
Metadata as oai_dc, converted from Crossref
<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"><dc:title>Parametric estimation in photovoltaic modules using the crow search algorithm</dc:title><dc:creator>Montoya, Oscar Danilo</dc:creator><dc:creator>Ramírez-Vanegas, Carlos Alberto</dc:creator><dc:creator>Grisales-Noreña, Luis Fernando</dc:creator><dc:description>&lt;jats:p&gt;&amp;lt;p&amp;gt;The problem of parametric estimation in photovoltaic (PV) modules considering manufacturer information is addressed in this research from the perspective of combinatorial optimization. With the data sheet provided by the PV manufacturer, a non-linear non-convex optimization problem is formulated that contains information regarding maximum power, open-circuit, and short-circuit points. To estimate the three parameters of the PV model (i.e., the ideality diode factor (a) and the parallel and series resistances (R&amp;lt;sub&amp;gt;p&amp;lt;/sub&amp;gt; and R&amp;lt;sub&amp;gt;s&amp;lt;/sub&amp;gt;)), the crow search algorithm (CSA) is employed, which is a metaheuristic optimization technique inspired by the behavior of the crows searching food deposits. The CSA allows the exploration and exploitation of the solution space through a simple evolution rule derived from the classical PSO method. Numerical simulations reveal the effectiveness and robustness of the CSA to estimate these parameters with objective function values lower than 1 × 10&amp;lt;sup&amp;gt;−28&amp;lt;/sup&amp;gt; and processing times less than 2 s. All the numerical simulations were developed in MATLAB 2020a and compared with the sine-cosine and vortex search algorithms recently reported in the literature.&amp;lt;/p&amp;gt;&lt;/jats:p&gt;</dc:description><dc:publisher>Institute of Advanced Engineering and Science</dc:publisher><dc:date>2022-02-01</dc:date><dc:type>info:eu-repo/semantics/article</dc:type><dc:format>application/pdf</dc:format><dc:identifier>https://doi.org/10.11591/ijece.v12i1.pp82-91</dc:identifier><dc:identifier>10.11591/ijece.v12i1.pp82-91</dc:identifier><dc:source>International Journal of Electrical and Computer Engineering (IJECE); Vol 12 No 1 (2022); 82</dc:source><dc:source>2722-2578</dc:source><dc:source>2088-8708</dc:source><dc:relation>http://ijece.iaescore.com/index.php/IJECE/article/viewFile/24820/15295</dc:relation><dc:rights>http://creativecommons.org/licenses/by-sa/4.0</dc:rights></oai_dc:dc>