Volume 21, Issue 2 (Special Issue on the 1st International Conference on ELECRiS 2024 Malaysia - June 2025)                   IJEEE 2025, 21(2): 3583-3583 | Back to browse issues page

XML Print

Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:
IBRAHIM W I, Sadan N, Ramli N, Riduwan Ghazali M R G, Fuad I. Variable Step-size Hill-Climbing Search (VS-HCS) MPPT Algorithm for Hydrokinetic Energy Harnessing. IJEEE 2025; 21 (2) :3583-3583
URL: http://ijeee.iust.ac.ir/article-1-3583-en.html
Variable Step-size Hill-Climbing Search (VS-HCS) MPPT Algorithm for Hydrokinetic Energy Harnessing
WAN ISMAIL IBRAHIM , Nasiruddin Sadan , Noorlina Ramli , Mohd Riduwan Ghazali Riduwan Ghazali , Ilham Fuad
Abstract:   (121 Views)
Hydrokinetic energy harnessing has emerged as a promising renewable energy that utilizes the kinetic energy of moving water to generate electricity. Nevertheless, the variation and fluctuation of water velocity and turbulence flow in a river is a challenging issue, especially in designing a control system that can harness the maximum output power with high efficiency. Besides, the conventional Hill-climbing Search (HCS) MPPT algorithm has weaknesses, such as slow tracking time and producing high steady-state oscillation, which reduces efficiency. In this paper, the Variable-Step Hill Climbing Search (VS-HCS) MPPT algorithm is proposed to solve the limitation of the conventional HCS MPPT. The model of hydrokinetic energy harnessing is developed using MATLAB/Simulink. The system consists of a water turbine, permanent magnet synchronous generator (PMSG), passive rectifier, and DC-DC boost converter. The results show that the power output achieves a 28 % increase over the system without MPPT and exhibits the lowest energy losses with a loss percentage of 0.9 %.
Keywords: Hill-Climbing Search, Hydrokinetic Energy Harnessing, MPPT Algorithm
Full-Text [PDF 1022 kb]   (27 Downloads)    
Type of Study: Only For Articles of ELECRiS 2024 | Subject: Heuristics and Metaheuristics
Received: 2024/12/05 | Revised: 2025/03/14 | Accepted: 2025/02/23
Rights and permissions
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
Creative Commons License
© 2022 by the authors. Licensee IUST, Tehran, Iran. This is an open access journal distributed under the terms and conditions of the Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0) license.