4.8 Article

The Pareto-optimal temporal aggregation of energy system models

期刊

APPLIED ENERGY
卷 315, 期 -, 页码 -

出版社

ELSEVIER SCI LTD
DOI: 10.1016/j.apenergy.2022.119029

关键词

Typical days; Segmentation; Time slices; Energy system models; Time series aggregation; Temporal aggregation; Temporal resolution; Renewable energy systems; Clustering; Computation time; Pareto optimality

资金

  1. Federal Ministry for Economic Af-fairs and Climate Action of Germany as part of the METIS project [03ET4064A]

向作者/读者索取更多资源

This study introduces clustering techniques that can be applied to different energy system models to improve efficiency and accuracy, without requiring deep knowledge of the individual models.
The growing share of intermittent renewable energy sources, storage technologies, and the increasing degree of so-called sector coupling necessitates optimization-based energy system models with high temporal and spatial resolutions, which significantly increases their runtimes and limits their maximum sizes. In order to maintain the computational viability of these models for large-scale application cases, temporal aggregation has emerged as a technique for reducing the number of considered time steps by reducing the original time horizon down to fewer, more representative ones.This study presents advanced but generally applicable clustering techniques that allow for ad-hoc improvements of current approaches without requiring profound knowledge of the individual energy system model. These improvements comprise a method to find the optimal tradeoff between the number of typical days and inner-daily temporal resolutions, and a representation method that can reproduce the value distribution of the original time series. We prove the superiority of these approaches by applying them to two fundamentally different model types and benchmarking them against state-of-the-art approaches. This is performed for a variety of temporal resolutions, which leads to many hundreds of model runs.The results show that the proposed improvements on current methods strictly dominate the status quo with respect to Pareto-optimality in terms of runtime and accuracy. Although a speeding up factor of one magnitude could be achieved using traditional aggregation methods within a cost deviation range of two percent, the algorithms proposed herein achieve this accuracy with a runtime speedup by a factor of two orders of magnitude.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.8
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据