Application of Metaheuristic Algorithms with Supervised Machine Learning for Accurate Power Consumption Prediction

被引:0
作者
Wang, Mengxia [2 ,3 ,5 ,7 ,8 ]
Zhu, Chaoyang [1 ,2 ,3 ]
Zhang, Yunxiang [4 ,5 ,6 ]
Deng, Jinxin [2 ]
Cai, Yiwei [2 ]
Wei, Wei [9 ]
Guo, Mengxing [10 ]
机构
[1] Commun Univ China, Inst Social Innovat & Publ Culture, Beijing 100000, Peoples R China
[2] Int Engn Psychol Inst US, Denver, CO 80201 USA
[3] Univ Illinois, Champaign, IL 61820 USA
[4] Hainan Vocat Univ Sci & Technol, Haikou 570100, Peoples R China
[5] Shenzhen High Level Talents Dev Promot Assoc, Shenzhen 518000, Peoples R China
[6] CDA Int Accelerator, Shenzhen 518000, Peoples R China
[7] Beijing Inst Technol, Shenzhen Res Inst, Shenzhen 518000, Peoples R China
[8] Univ Wollongong, Wollongong City 2223, Australia
[9] Xian Univ Technol, Sch Comp Sci & Engn, Xian 710048, Peoples R China
[10] Shandong Open Univ, Jinan 250000, Peoples R China
关键词
Power consumption prediction; Optimization techniques; Support vector regression; Metaheuristic algorithm; Machine learning; ENERGY-CONSUMPTION;
D O I
10.1007/s12559-025-10402-8
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Accurate power consumption prediction is a crucial part of energy management. Some of the machine learning models that are the focus of this study for the prediction of power use include Support Vector Regression, Adaptive Boosting, and Decision Tree Regression. These models have been improved with the use of some novel optimizers-namely, the Trochoid Search Optimization, Red-Tailed Hawk, and Giant Armadillo Optimization methods-for hyper-parameter tuning to enhance prediction accuracy. When tested against real data, DTGA outperformed with R2 values of 0.9918, 0.9924, and 0.9934 for three zones. This work extends the study on the forecast of power consumption by integrating machine learning and optimization techniques that provide effective energy management strategies.
引用
收藏
页数:35
相关论文
共 38 条
[1]   A Hybrid Marine Predator Sine Cosine Algorithm for Parameter Selection of Hybrid Active Power Filter [J].
Ali, Shoyab ;
Bhargava, Annapurna ;
Saxena, Akash ;
Kumar, Pavan .
MATHEMATICS, 2023, 11 (03)
[2]   Giant Armadillo Optimization: A New Bio-Inspired Metaheuristic Algorithm for Solving Optimization Problems [J].
Alsayyed, Omar ;
Hamadneh, Tareq ;
Al-Tarawneh, Hassan ;
Alqudah, Mohammad ;
Gochhait, Saikat ;
Leonova, Irina ;
Malik, Om Parkash ;
Dehghani, Mohammad .
BIOMIMETICS, 2023, 8 (08)
[3]   Machine learning for occupant-behavior-sensitive cooling energy consumption prediction in office buildings [J].
Amasyali, Kadir ;
El-Gohary, Nora .
RENEWABLE & SUSTAINABLE ENERGY REVIEWS, 2021, 142
[4]   A review of data-driven building energy consumption prediction studies [J].
Amasyali, Kadir ;
El-Gohary, Nora M. .
RENEWABLE & SUSTAINABLE ENERGY REVIEWS, 2018, 81 :1192-1205
[5]   Predicting energy consumption in multiple buildings using machine learning for improving energy efficiency and sustainability [J].
Anh-Duc Pham ;
Ngoc-Tri Ngo ;
Thu Ha Truong Thi ;
Nhat-To Huynh ;
Ngoc-Son Truong .
JOURNAL OF CLEANER PRODUCTION, 2020, 260
[6]   Renewable and non-renewable energy consumption-impact on economic growth and CO2 emissions in five emerging market economies [J].
Bhat, Javed Ahmad .
ENVIRONMENTAL SCIENCE AND POLLUTION RESEARCH, 2018, 25 (35) :35515-35530
[7]   Hourly energy consumption prediction of an office building based on ensemble learning and energy consumption pattern classification [J].
Dong, Zhenxiang ;
Liu, Jiangyan ;
Liu, Bin ;
Li, Kuining ;
Li, Xin .
ENERGY AND BUILDINGS, 2021, 241
[8]   Weighted random sampling with a reservoir [J].
Efraimidis, PS ;
Spirakis, PG .
INFORMATION PROCESSING LETTERS, 2006, 97 (05) :181-185
[9]   Red-tailed hawk algorithm for numerical optimization and real-world problems [J].
Ferahtia, Seydali ;
Houari, Azeddine ;
Rezk, Hegazy ;
Djerioui, Ali ;
Machmoum, Mohamed ;
Motahhir, Saad ;
Ait-Ahmed, Mourad .
SCIENTIFIC REPORTS, 2023, 13 (01)
[10]   BOOSTING A WEAK LEARNING ALGORITHM BY MAJORITY [J].
FREUND, Y .
INFORMATION AND COMPUTATION, 1995, 121 (02) :256-285