DR potential probabilistic forecasting model of load aggregators based on ensemble learning

Day-ahead forecasting on the demand response (DR) potential of the load aggregators could provide important reference information for the quotations and volumes of load aggregators in the electricity market, thus reducing decision-making risks. Aiming at the shortcomings of generalization and reliability of a single-point forecasting model, this paper proposes an online DR potential probabilistic forecasting model of load aggregators based on ensemble learning, which can effectively improve the accuracy and generalization ability of the probabilistic forecasting model. Firstly, the multivariate influencing features of the DR potential of load aggregators are extracted, and the support vector machine-based recursive feature elimination (SVM-RFE) method is used to select features. Secondly, multiple single probabilistic forecasting models are proposed based on the non-parametric kernel density estimation. Finally, a DR potential ensemble probabilistic forecasting model of load aggregators based on "repeated game, dynamic update" is established, which adaptively learns the weights of each base model through the idea of game theory and dynamically update the weights over time. Simulation experiments show that the probabilistic forecasting model proposed in this paper has better accuracy and generalization than a single prediction model.

Institutions

Publication Details

Journal
SHILAP Revista de lepidopterología
Published
2025-04-01
DOI
https://doi.org/10.19753/j.issn1001-1390.2025.04.011
Primary Topic
Energy Load and Power Forecasting
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

DR potential probabilistic forecasting model of load aggregators based on ensemble learning

SHILAP Revista de lepidopterología
Energy Load and Power Forecasting
article

DR potential probabilistic forecasting model of load aggregators based on ensemble learning

article en

Abstract

Day-ahead forecasting on the demand response (DR) potential of the load aggregators could provide important reference information for the quotations and volumes of load aggregators in the electricity market, thus reducing decision-making risks. Aiming at the shortcomings of generalization and reliability of a single-point forecasting model, this paper proposes an online DR potential probabilistic forecasting model of load aggregators based on ensemble learning, which can effectively improve the accuracy and generalization ability of the probabilistic forecasting model. Firstly, the multivariate influencing features of the DR potential of load aggregators are extracted, and the support vector machine-based recursive feature elimination (SVM-RFE) method is used to select features. Secondly, multiple single probabilistic forecasting models are proposed based on the non-parametric kernel density estimation. Finally, a DR potential ensemble probabilistic forecasting model of load aggregators based on "repeated game, dynamic update" is established, which adaptively learns the weights of each base model through the idea of game theory and dynamically update the weights over time. Simulation experiments show that the probabilistic forecasting model proposed in this paper has better accuracy and generalization than a single prediction model.

SHILAP Revista de lepidopterología
North China Electric Power University (CN), State Grid Corporation of China (China) (CN)
Peace, Justice and strong institutions
Openalex Percentile: Top 55%
Energy Load and Power Forecasting
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.