Melola Discovery

← Melola Discovery

Open access Journal SINTA 1

Optimal population size of particle swarm optimization for photovoltaic systems under partial shading condition

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

DOI
10.11591/ijece.v12i5.pp4599-4613
ISSN
2722-2578, 2088-8708
Published
2022-10-01
Publisher
Institute of Advanced Engineering and Science
License
creativecommons.org/licenses/by-sa/4.0

Abstract

Particle swarm optimization (PSO) is the most widely used soft computing algorithm in photovoltaic systems to address partial shading conditions (PSC). The success of the PSO run heavily depends on the initial population size (NP). A higher NP increases the probability of a global peak (GP) solution, but at the expense of a longer convergence time. To find the optimal value of NP, a trade-off is typically made between a high success rate and a reasonable convergence time. The most used trade-off method is a trial-and-error approach that lacks explicit guidelines and empirical evidence from detailed analysis, which can affect data reproducibility when different systems are used. Hence, this study proposes an empirical trade-off method based on the performance index (PI) indicator, which takes into account the weighted importance of success rate and convergence time. Furthermore, the impact of NP on achieving a successful PSO was empirically investigated, with the PSO tested with 16 different NPs ranging from 3 to 50, and 10,000 independent runs on various PSC problems. Overall, this study found that the best NP to use was 25, which had the best average PI value of 0.9373 for solving all PSC problems under consideration.

Collaboration network of the authors

40 authors · 109 co-authorship links · 50 across different organisations · showing the 40 most connected

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

  • Universiti Teknologi MARA
  • UCSI University
  • University Ferhat Abbas of Setif
  • National University of Malaysia
  • University of Brawijaya
  • HELP University
  • Universiti Teknikal Malaysia Melaka
  • Other organisations
  • Affiliation unknown
  • Different organisations
  • Same organisation
  • Affiliation unknown
  • Thicker line = more joint articles · bigger circle = more articles
Show as table
Co-authorOrganisationJoint articles
Muhammad Murtadha OthmanUniversiti Teknologi MARA8
Rahimi BaharomUniversiti Teknologi MARA4
Zainal SalamUniversity of Technology Malaysia4
Zulkiffli Abdul HamidUniversiti Teknologi MARA3
Muhamad Faliq Mohamad NazerUCSI University2
Shahrizal JelaniUCSI University2
Mohd Helmi MansorUniversiti Tenaga Nasional2
Hadi SuyonoUniversity of Brawijaya2
Rini Nur HasanahUniversity of Brawijaya2
Mohammad Lutfi OthmanUniversiti Putra Malaysia2
Muhammad Khairul Azman Mohd JamhariUniversiti Teknologi MARA2
Nor Farahaida Abdul RahmanUniversiti Teknologi MARA2
Ramzi KouadriUniversity Ferhat Abbas of Setif1
Linda SlimaniUniversity Ferhat Abbas of Setif1
Tarek BouktirUniversity Ferhat Abbas of Setif1
A.V.Senthil KumarAffiliation unknown1
Muhammad Firdaus ShaariUniversiti Teknologi MARA1
Farah Adilah JamaludinUCSI University1
Nor Azura Md GhaniUniversiti Teknologi MARA1
Saadi Bin Ahmad KamaruddinHELP University1
Hazrita Ab RahimHELP University1
Ammar Yasier AzmanUniversiti Teknologi MARA1
Nofri Yenita DahlanUniversiti Teknologi MARA1
Wan Nazirah Wan Md AdnanUniversity of Selangor1
Nor Azwan Mohamed KamariNational University of Malaysia1
Ahmad Asrul IbrahimNational University of Malaysia1
Syahirah Abd HalimNational University of Malaysia1
Fareed Danial Ahmad KaharUniversiti Teknologi MARA1
Saiful Izwan SulimanUniversiti Teknologi MARA1
Mohamed ZellaguiUniversity of Batna 11
Muhamad Hazim LokmanUniversiti Teknologi MARA1
Sharifah Azma Syed MustafaUniversiti Teknologi MARA1
Siti Zaliha Mohammad NoorUniversiti Teknologi MARA1
Muhammad Alif MansorUniversiti Teknologi MARA1
Naeem M. S. HannoonUniversiti Teknologi MARA1

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 Oct 2026, last seen 15 Nov 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>Optimal population size of particle swarm optimization for photovoltaic systems under partial shading condition</dc:title><dc:creator>Hashim, Norazlan</dc:creator><dc:creator>Nik Ismail, Nik Fasdi</dc:creator><dc:creator>Johari, Dalina</dc:creator><dc:creator>Musirin, Ismail</dc:creator><dc:creator>Rahman, Azhan Ab.</dc:creator><dc:description>&lt;jats:p&gt;&amp;lt;span&amp;gt;Particle swarm optimization (PSO) is the most widely used soft computing algorithm in photovoltaic systems to address partial shading conditions (PSC). The success of the PSO run heavily depends on the initial population size (NP). A higher NP increases the probability of a global peak (GP) solution, but at the expense of a longer convergence time. To find the optimal value of NP, a trade-off is typically made between a high success rate and a reasonable convergence time. The most used trade-off method is a trial-and-error approach that lacks explicit guidelines and empirical evidence from detailed analysis, which can affect data reproducibility when different systems are used. Hence, this study proposes an empirical trade-off method based on the performance index (PI) indicator, which takes into account the weighted importance of success rate and convergence time. Furthermore, the impact of NP on achieving a successful PSO was empirically investigated, with the PSO tested with 16 different NPs ranging from 3 to 50, and 10,000 independent runs on various PSC problems. Overall, this study found that the best NP to use was 25, which had the best average PI value of 0.9373 for solving all PSC problems under consideration.&amp;lt;/span&amp;gt;&lt;/jats:p&gt;</dc:description><dc:publisher>Institute of Advanced Engineering and Science</dc:publisher><dc:date>2022-10-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.v12i5.pp4599-4613</dc:identifier><dc:identifier>10.11591/ijece.v12i5.pp4599-4613</dc:identifier><dc:source>International Journal of Electrical and Computer Engineering (IJECE); Vol 12 No 5 (2022); 4599</dc:source><dc:source>2722-2578</dc:source><dc:source>2088-8708</dc:source><dc:relation>https://ijece.iaescore.com/index.php/IJECE/article/viewFile/27820/15885</dc:relation><dc:rights>http://creativecommons.org/licenses/by-sa/4.0</dc:rights></oai_dc:dc>