Targeted demand response for flexible energy communities using clustering techniques

• URL: http://arxiv.org/abs/2303.00186v3
• Date: Mon, 25 Sep 2023 14:30:48 GMT
• Title: Targeted demand response for flexible energy communities using clustering techniques
• Authors: Sotiris Pelekis, Angelos Pipergias, Evangelos Karakolis, Spiros Mouzakitis, Francesca Santori, Mohammad Ghoreishi, Dimitris Askounis
• Abstract summary: The goal is to alter the consumption behavior of the prosumers within a distributed energy community in Italy. Three popular machine learning algorithms are employed, namely k-means, k-medoids and agglomerative clustering. We evaluate the methods using multiple metrics including a novel metric proposed within this study, namely peak performance score (PPS)
• Score: 2.572906392867547
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The present study proposes clustering techniques for designing demand response (DR) programs for commercial and residential prosumers. The goal is to alter the consumption behavior of the prosumers within a distributed energy community in Italy. This aggregation aims to: a) minimize the reverse power flow at the primary substation, occuring when generation from solar panels in the local grid exceeds consumption, and b) shift the system wide peak demand, that typically occurs during late afternoon. Regarding the clustering stage, we consider daily prosumer load profiles and divide them across the extracted clusters. Three popular machine learning algorithms are employed, namely k-means, k-medoids and agglomerative clustering. We evaluate the methods using multiple metrics including a novel metric proposed within this study, namely peak performance score (PPS). The k-means algorithm with dynamic time warping distance considering 14 clusters exhibits the highest performance with a PPS of 0.689. Subsequently, we analyze each extracted cluster with respect to load shape, entropy, and load types. These characteristics are used to distinguish the clusters that have the potential to serve the optimization objectives by matching them to proper DR schemes including time of use, critical peak pricing, and real-time pricing. Our results confirm the effectiveness of the proposed clustering algorithm in generating meaningful flexibility clusters, while the derived DR pricing policy encourages consumption during off-peak hours. The developed methodology is robust to the low availability and quality of training datasets and can be used by aggregator companies for segmenting energy communities and developing personalized DR policies.

Related papers

• GCC: Generative Calibration Clustering [55.44944397168619]
  We propose a novel Generative Clustering (GCC) method to incorporate feature learning and augmentation into clustering procedure. First, we develop a discrimirative feature alignment mechanism to discover intrinsic relationship across real and generated samples. Second, we design a self-supervised metric learning to generate more reliable cluster assignment.
  arXiv  Detail & Related papers  (2024-04-14T01:51:11Z)
• A Hybrid SOM and K-means Model for Time Series Energy Consumption Clustering [0.0]
  This paper introduces a novel approach to effectively cluster monthly energy consumption patterns by integrating two powerful techniques: Self-organizing maps and K-means clustering. The main focus of this study is on a selection of time series energy consumption data from the Smart meters in London dataset.
  arXiv  Detail & Related papers  (2023-11-25T16:55:19Z)
• A Machine Learning-Based Framework for Clustering Residential Electricity Load Profiles to Enhance Demand Response Programs [0.0]
  We present a novel machine learning based framework in order to achieve optimal load profiling through a real case study. In this paper, we present a novel machine learning based framework in order to achieve optimal load profiling through a real case study.
  arXiv  Detail & Related papers  (2023-10-31T11:23:26Z)
• Dynamic Scheduling for Federated Edge Learning with Streaming Data [56.91063444859008]
  We consider a Federated Edge Learning (FEEL) system where training data are randomly generated over time at a set of distributed edge devices with long-term energy constraints. Due to limited communication resources and latency requirements, only a subset of devices is scheduled for participating in the local training process in every iteration.
  arXiv  Detail & Related papers  (2023-05-02T07:41:16Z)
• Agglomerative Hierarchical Clustering with Dynamic Time Warping for Household Load Curve Clustering [0.0]
  Classifying clients according to their consumption patterns enables targeting specific groups of consumers for demand response (DR) programs. We propose a shape-based approach that combines Agglomerative Hierarchical Clustering (AHC) with Dynamic Time Warping (DTW) We show that AHC using DTW outperformed other clustering algorithms and needed fewer clusters.
  arXiv  Detail & Related papers  (2022-10-18T01:30:25Z)
• Cluster-and-Conquer: A Framework For Time-Series Forecasting [94.63501563413725]
  We propose a three-stage framework for forecasting high-dimensional time-series data. Our framework is highly general, allowing for any time-series forecasting and clustering method to be used in each step. When instantiated with simple linear autoregressive models, we are able to achieve state-of-the-art results on several benchmark datasets.
  arXiv  Detail & Related papers  (2021-10-26T20:41:19Z)
• Decision-making Oriented Clustering: Application to Pricing and Power Consumption Scheduling [61.062312682535755]
  We formulate the framework of decision-making oriented clustering and propose an algorithm providing a decision-based partition of the data space and good representative decisions. By applying this novel framework and algorithm to a typical problem of real-time pricing and that of power consumption scheduling, we obtain several insightful analytical results.
  arXiv  Detail & Related papers  (2021-06-02T08:41:04Z)
• Scalable Hierarchical Agglomerative Clustering [65.66407726145619]
  Existing scalable hierarchical clustering methods sacrifice quality for speed. We present a scalable, agglomerative method for hierarchical clustering that does not sacrifice quality and scales to billions of data points.
  arXiv  Detail & Related papers  (2020-10-22T15:58:35Z)
• Topology-based Clusterwise Regression for User Segmentation and Demand Forecasting [63.78344280962136]
  Using a public and a novel proprietary data set of commercial data, this research shows that the proposed system enables analysts to both cluster their user base and plan demand at a granular level. This work seeks to introduce TDA-based clustering of time series and clusterwise regression with matrix factorization methods as viable tools for the practitioner.
  arXiv  Detail & Related papers  (2020-09-08T12:10:10Z)
• Two-stage building energy consumption clustering based on temporal and peak demand patterns [3.364554138758565]
  We introduce a two-stage clustering method that more accurately captures load shape temporal patterns and peak demands. In the first stage, load shapes are clustered by allowing a large number of clusters to accurately capture variations in energy use patterns. In the second stage, clusters of similar centroid and power magnitude range are merged by using Dynamic Time Warping.
  arXiv  Detail & Related papers  (2020-08-10T17:42:48Z)
• Simulating Tariff Impact in Electrical Energy Consumption Profiles with Conditional Variational Autoencoders [0.0]
  This paper proposes a novel method based on conditional variational autoencoders (CVAE) to generate daily consumption profiles of consumers. The main contribution from this new method is the capacity to reproduce rebound and side effects in the generated consumption profiles.
  arXiv  Detail & Related papers  (2020-06-10T08:05:35Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.