Melola Discovery

← Melola Discovery

Open access Journal SINTA 1

A maximum power point tracking based on levy flight optimization

International Journal of Power Electronics and Drive Systems · Vol. 11 No. 3 (2020) · pp. 1499–1507

DOI
10.11591/ijpeds.v11.i3.pp1499-1507
ISSN
2722-256X, 2088-8694
Published
2020-09-01
Publisher
Institute of Advanced Engineering and Science
Language
eng
License
creativecommons.org/licenses/by-sa/4.0

Abstract

This paper proposes a Levy flight global maximum power point tracking for solar photovoltaic (PV) system under partial shading conditions. The proposed method comes with merits such as simplicity, fast response and free of oscillation. This algorithm uses random search over the exploration space and compares the previous and current states to obtain the best solution. For evaluation and comparative analysis, performance of the proposed method is also measured against Perturb and Observe (P&O) and Particle Swarm Optimization (PSO). All three algorithms are simulated in MATLAB/Simulink environment. Simulation results are satisfactory over the conducted tests under uniform and non-uniform irradiance. The proposed algorithm is able to track global maximum power point (GMPP) under partial shading conditions with fast tracking time and zero ripple at steady-state.

Collaboration network of the authors

25 authors · 58 co-authorship links · 29 across different organisations

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

  • Universiti Sains Malaysia
  • Universiti Teknologi MARA
  • National University of Malaysia
  • University of Kuala Lumpur
  • Universiti Putra Malaysia
  • Universiti Teknikal Malaysia Melaka
  • Universiti Malaysia Perlis
  • 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
Nor Farahaida Abdul RahmanUniversiti Teknologi MARA2
Mohamed SalemUniversiti Sains Malaysia2
Fouzey Salem AamaraNational University of Malaysia1
Praveen Kumar BalachandranNational University of Malaysia1
Yushaizad YusofNational University of Malaysia1
Mohd Amran Mohd RadziUniversiti Putra Malaysia1
Taha Ahmad HusseinAffiliation unknown1
Rahimi BaharomUniversiti Teknologi MARA1
Wan Noraishah Wan Abdul MunimUniversiti Teknologi MARA1
Naeem M. S. HannoonUniversiti Teknologi MARA1
Nabil M. HidayatUniversiti Teknologi MARA1
Mohd Rezal MohamedUniversity of Kuala Lumpur1
Mohd Saufi AhmadUniversiti Teknikal Malaysia Melaka1
Tow Leong TiangUniversiti Malaysia Perlis1
Taha Ahmed HusseinNorthern Technical University1
Jawad Hasan AlkhateebPrince Mohammad bin Fahd University1
Nurshahirah Athirah RohmanUniversiti Teknologi MARA1
M. RezalUniversity of Kuala Lumpur1
Mohamad Nazir AbdullahUniversiti Sains Malaysia1
Musa Mohammed GujjaUniversiti Sains Malaysia1
Muhammad Najwan HamidiUniversiti Sains Malaysia1
Khalil AlluhaybiTaibah University1

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.

Metadata source: OAI-PMH (metadata jurnal) http://ijpeds.iaescore.com/index.php/IJPEDS/oai, first harvested 8 Nov 2026, last seen 16 Nov 2026.
Original metadata (oai_dc)
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/  http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">A maximum power point tracking based on levy flight optimization</dc:title>
	<dc:creator>Charin, C.</dc:creator>
	<dc:creator>Ishak, Dahaman</dc:creator>
	<dc:creator>Mohd Zainuri, Muhammad Ammirrul Atiqi</dc:creator>
	<dc:description xml:lang="en-US">This paper proposes a Levy flight global maximum power point tracking for solar photovoltaic (PV) system under partial shading conditions. The proposed method comes with merits such as simplicity, fast response and free of oscillation. This algorithm uses random search over the exploration space and compares the previous and current states to obtain the best solution. For evaluation and comparative analysis, performance of the proposed method is also measured against Perturb and Observe (P&amp;amp;O) and Particle Swarm Optimization (PSO). All three algorithms are simulated in MATLAB/Simulink environment. Simulation results are satisfactory over the conducted tests under uniform and non-uniform irradiance. The proposed algorithm is able to track global maximum power point (GMPP) under partial shading conditions with fast tracking time and zero ripple at steady-state.</dc:description>
	<dc:publisher xml:lang="en-US">Institute of Advanced Engineering and Science</dc:publisher>
	<dc:contributor xml:lang="en-US">Universiti Sains Malaysia</dc:contributor>
	<dc:date>2020-09-01</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US"></dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ijpeds.iaescore.com/index.php/IJPEDS/article/view/20687</dc:identifier>
	<dc:identifier>10.11591/ijpeds.v11.i3.pp1499-1507</dc:identifier>
	<dc:source xml:lang="en-US">International Journal of Power Electronics and Drive Systems (IJPEDS); Vol 11, No 3: September 2020; 1499-1507</dc:source>
	<dc:source>2722-256X</dc:source>
	<dc:source>2088-8694</dc:source>
	<dc:source>10.11591/ijpeds.v11.i3</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ijpeds.iaescore.com/index.php/IJPEDS/article/view/20687/13199</dc:relation>
	<dc:relation>https://ijpeds.iaescore.com/index.php/IJPEDS/article/downloadSuppFile/20687/2843</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2020 C. Charin, Dahaman Ishak, Muhammad Ammirrul Atiqi Mohd Zainuri</dc:rights>
	<dc:rights xml:lang="en-US">http://creativecommons.org/licenses/by-sa/4.0</dc:rights>
</oai_dc:dc>