Saturday 20th of April 2024
 

Hybrid RVGA-ENM for Turkey Electricity Demand Forecasting


Wahab Musa

Electricity demand forecasting model based on single algorithm at least have two problems related to local optima and computational cost. We consider to utilised the hybrid real value genetic algorithm and extended Nelder-Mead to solved local optima and reduced the number of iteration. The model is known as the hybrid Real-Value GA and Extended Nelder-Mead (RVGA-ENM). The GA has been enhanced to accept real value while the Nelder-Mead local search is extended to assist in overcoming the local optima problem. The actual electricity demand data of Turkey were used in the experiments to evaluate the performance of the proposed model. Results of the proposed model were compared to the hybrid GA and Nelder-Mead original, Real Code Genetic Algorithm and Particle Swarm Optimisation. Through our evaluation, the proposed hybrid model produced higher accuracy for electricity demand estimation. This model can be used to assist decision-makers in forecasting electricity demand.

Keywords: Genetic Algorithm, Electricity Demand Forecasting, Local Optimal.

Download Full-Text


ABOUT THE AUTHOR

Wahab Musa
Wahab Musa is an Associate Professor in Electrical Engineering Department, Universitas Negeri Gorontalo, Indonesia. He received Master of Engineering degree (Electrical Engineering) from ITB Bandung, Indonesia in 2001, and Doctor of Philosophy degree (Computer Science) from Universiti Utara Malaysia (UUM), Malaysia in 2014. His research interest includes electricity energy planning, digital signal processing, hybrid genetic algorithm and computational intelligence.


IJCSI Published Papers Indexed By:

 

 

 

 
+++
About IJCSI

IJCSI is a refereed open access international journal for scientific papers dealing in all areas of computer science research...

Learn more »
Join Us
FAQs

Read the most frequently asked questions about IJCSI.

Frequently Asked Questions (FAQs) »
Get in touch

Phone: +230 911 5482
Email: info@ijcsi.org

More contact details »