Matching Supply and Demand of Electricity Network- Supportive Flexibility: A Case Study with Three Comprehensible Matching Algorithms

Due to an ongoing energy transition, electricity networks are increasingly challenged by situations where local electrical power demands are high but local generation is low and vice versa. This finally leads to a growing number of technical problems. To solve these problems in the short-term, the e...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:MAGKS - Joint Discussion Paper Series in Economics (Band 10-2021)
Autoren: Heilmann, Erik, Zeiselmair, Andreas, Erstermann, Thomas
Format: Artikel
Sprache:Englisch
Veröffentlicht: Philipps-Universität Marburg 2021
Schlagworte:
Online Zugang:PDF-Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Due to an ongoing energy transition, electricity networks are increasingly challenged by situations where local electrical power demands are high but local generation is low and vice versa. This finally leads to a growing number of technical problems. To solve these problems in the short-term, the electrical power of load and generation must be adjusted as available flexibility. In zonal electricity systems, one often discussed concept to utilize flexibility is local flexibility markets. Based on auction theory, we provide a comprehensible framework for the use of network-supportive flexibility in general. In this context, we discuss the problem of matching supply and demand. We introduce three matching approaches that can be applied and adapted for different network situations. In addition to a qualitative description of the three approaches, we present a case study of an exemplary distribution network and explore different scenarios to demonstrate the utility of the algorithms. We compare the three approaches on a qualitative level with quantitative inputs from the case study. The comparison considers the specific cost, flexible energy, ensured demand coverage, data minimization, computational effort and the transferability of the three approaches.
Umfang:29 Seiten
ISSN:1867-3678
DOI:10.17192/es2024.0686