David Cardona-Vasquez

arXiv2026

Towards Exact Temporal Aggregation of Time-Coupled Energy Storage Models via Active Constraint Set Identification and Machine Learning

Time series aggregation (TSA) aims to construct temporally aggregated optimization models that accurately represent the output space of their full-scale counterparts while using a significantly reduced temporal dimensionality. This paper presents a theoretical approach that achieves exact temporal aggregation of full-scale power system models -- even in the presence of energy storage time-coupling constraints -- by leveraging active constraint sets and dual information. This advances the state of the art beyond existing TSA methods, which typically cannot guarantee solution accuracy or rely on iterative procedures to determine the required number of representative periods. To bridge the gap between this theoretical analysis and practical application, we employ machine learning, i.e., classification and clustering, to inform TSA in models that co-schedule variable renewable energy sources and energy storage. Numerical results show substantially improved computational performance relative to the full-scale model, while maintaining a favorable trade-off between solution accuracy and complexity.

math.OC↗

arXiv2023

Enhancing Time Series Aggregation For Power System Optimization Models: Incorporating Network and Ramping Constraints

Power system optimization models are large mathematical models used by researchers and policymakers that pose tractability issues when representing real-world systems. Several aggregation techniques have been proposed to address these computational challenges and it remains a relevant topic in power systems research. In this paper, we extend a recently developed Basis-Oriented time series aggregation approach used for power system optimization models that aggregates time steps within their Simplex basis. This has proven to be an exact aggregation for simple economic dispatch problems. We extend this methodology to include network and ramping constraints; for the latter (and to handle temporal linking), we develop a heuristic algorithm that finds an exact partition of the input data, which is then aggregated. Our numerical results, for a simple 3-Bus system, indicate that: with network constraints only, we can achieve a computational reduction by a factor of 1747 (measured in the number of variables of the optimization model), and of 12 with ramping constraints. Moreover, our findings indicate that with temporal linking constraints, aggregations of variable length must be employed to obtain an exact result (the same objective function value in the aggregated model) while maintaining the computational tractability, this implies that the duration of the aggregations does not necessarily correspond to commonly used lengths like days or weeks. Finally, our results support previous research concerning the importance of extreme periods on model results.

math.OC↗