能量系统模型的Pareto最优时间集结
The Pareto-Optimal Temporal Aggregation of Energy System 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 state-of-the-art approaches without requiring profound knowledge of the individual energy system model. These improvements comprise the optimal tradeoff between the number of typical days and inner-daily temporal resolutions, as well as constituting 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, namely a single-node building energy system and a European carbon-neutral energy scenario, and benchmark these 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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。