AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
PDF (9.8 MB)
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Article | Open Access

Requirements and Constraints of Forecasting Algorithms Required in Local Flexibility Markets

Alex Segura( )Joaquim Meléndez
Department of Electrical, Electronic and Automatic Engineering, University of Girona, Girona, 17003, Spain
Show Author Information

Abstract

The increasing use of renewable energy sources, combined with the increase in electricity demand, has highlighted the importance of energy flexibility management in electrical grids. Energy flexibility is the capacity that generators and consumers have to change production and/or consumption to support grid operation, ensuring the stability and efficiency of the grid. Thus, Local Flexibility Markets (LFMs) are market-oriented mechanisms operated at different time horizons that support flexibility provision and trading at the distribution level, where the Distribution System Operators (DSOs) are the flexibility-demanding actors, and prosumers are the flexibility providers. This paper investigates the requirements and constraints of forecasting algorithms required to participate in LFMs. The paper analyses the adequacy of current load forecasting algorithms to fulfill the requirements of LFMs. The work extracts the forecasting requirements for data granularity, forecasting horizon, participants aggregation, and their relevance for market operation; highlighting the implications of data availability at both training and forecasting stages related to the different local market actors (i.e., DSO, aggregator, prosumer) and market operation timing. The analysis evidences the relevance of load aggregation and forecasting horizon in the performance of forecasting algorithms and their impact on the accuracy, depending on the actors and stages during market operation. It evaluates how data volume, forecasting horizon, and participant aggregation affect the performance of forecasting models. Key findings show that aggregating participants and reducing the forecasting horizon considerably improve forecasting accuracy. The accuracy of DSO forecasting is usually better due to the availability and completeness of aggregated data at the system level (i.e., feeder, transformer, substation). Main findings show that increasing training data further than half a year does not keep improving forecasting accuracy, using a next-hour time horizon achieves around 29% better accuracy than a next-day time horizon, aggregating LFM participants can increase forecasting up to 100% depending on the aggregation number. The findings are discussed in the context of LFM operated with current data infrastructures and provide recommendations for improving the integration of forecasting algorithms to enhance flexibility management.

References

【1】
【1】
 
 
Computer Modeling in Engineering & Sciences
Pages 649-672

{{item.num}}

Comments on this article

Go to comment

< Back to all reports

Review Status: {{reviewData.commendedNum}} Commended , {{reviewData.revisionRequiredNum}} Revision Required , {{reviewData.notCommendedNum}} Not Commended Under Peer Review

Review Comment

Close
Close
Cite this article:
Segura A, Meléndez J. Requirements and Constraints of Forecasting Algorithms Required in Local Flexibility Markets. Computer Modeling in Engineering & Sciences, 2025, 145(1): 649-672. https://doi.org/10.32604/cmes.2025.070954

297

Views

5

Downloads

1

Crossref

0

Web of Science

0

Scopus

Received: 28 July 2025
Accepted: 18 September 2025
Published: 30 October 2025
© The Author 2024.

This work is licensed under a Creative Commons Attribution 4.0 International License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.