SearcharxivSearch

arXiv · 2206.12242

Intersecting near-optimal spaces: European power systems with more resilience to weather variability

Abstract

We suggest a new methodology for designing robust energy systems. For this, we investigate so-called near-optimal solutions to energy system optimisation models; solutions whose objective values deviate only marginally from the optimum. Using a refined method for obtaining explicit geometric descriptions of these near-optimal feasible spaces, we find designs that are as robust as possible to perturbations. This contributes to the ongoing debate on how to define and work with robustness in energy systems modelling. We apply our methods in an investigation using multiple decades of weather data. For the first time, we run a capacity expansion model of the European power system (one node per country) with a 3-hourly temporal resolution with 41 years of weather data. While an optimisation with 41 weather years is at the limits of computational feasibility, we use the near-optimal feasible spaces of single years to gain an understanding of the design space over the full time period. Specifically, we intersect all near-optimal feasible spaces for the individual years in order to get designs that are likely to be feasible over the entire time period. We find significant potential for investment flexibility, and verify the feasibility of these designs by simulating the resulting dispatch problem with four decades of weather data. They are characterised by a shift towards more onshore wind and solar power, while emitting up to 50% less $CO_2$ than a cost-optimal solution over that period. Our work builds on recent developments in the field, including techniques such as Modelling to Generate Alternatives and Modelling All Alternatives, and provides new insights into the geometry of near-optimal feasible spaces and the importance of multi-decade weather variability for energy systems design. We also provide an effective way of working with a multi-decade time frame in a highly parallelised manner.

Explore related subjects

Keep this discovery

BibTeXRIS

Aleksander Grochowicz, Koen van Greevenbroek, Fred Espen Benth, Marianne Zeyringer. 2022-06-24. Intersecting near-optimal spaces: European power systems with more resilience to weather variability. https://doi.org/10.1016/j.eneco.2022.106496

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Deterministic and Random Bipartite Matching on General Networks: Convex Flow Reformulation, Asymptotic Properties, and Fast Algorithms

Minimum-distance bipartite matching on general networks has numerous applications various fields. This paper first focuses on deterministic problems and presents an exact edgewise-separable convex-flow reformulation. By introducing a smooth monotone rearrangement approximation of the edge-wise imbalance profiles, the convex-flow reformulation's can be solved efficiently. If we further conduct a first-order resistance-based approximation of the convex program, a one-step Laplacian-based estimator can be analytically derived in closed forms. The paper also studies random problems where supply and demand points are randomly distributed. We show that the expected optimal matching distance scales with the square root of the number of points if the supply/demand point distributions are identical, or linearly otherwise. In the former case, the optimal flow is proven to be centered, symmetric, and sub-Gaussian. In the latter case, the limiting resistance network characterizes how supply-demand imbalance is redistributed and motivates a fast algorithm that approximate the optimal flow based on the limiting resistance. Numerical experiments show that the proposed estimators closely approximate the exact matching cost while substantially reducing computation time. The proven theoretical properties of the random matching solution are numerically verified by large-scale Monte Carlo simulations.

math.OC

Conformal-DRO: Distributionally Robust Optimization with Conformalized Ambiguity Set

Data-driven distributionally robust optimization (DRO) typically treats the conditional outcome law as fixed and uses ambiguity sets to capture estimation error. This paper studies latent distributional heterogeneity, where each instance has an unobserved law but contributes only one observation, so uncertainty persists even if the mixture law is known. We propose Conformal-DRO, which uses nested conformal regions to construct an ambiguity set for the future latent law. Under exchangeability, the set covers this law with probability at least $1-\alpha$ in finite samples, without estimating underlying latent laws or their mixing mechanism. The conformal path induces a data-driven transport geometry, while $\alpha$ determines the radius. The worst-case problem reduces to a finite linear program over conformal shells and admits sparse adversarial solutions. The resulting robust value provides a finite-sample certificate for the selected decision's expected cost.

math.OC

The best approximation tuple: an extension of the Cheney-Goldstein algorithm and results to the multiple sets case

In this paper we extend the algorithm and several results published in the celebrated 1959 paper of Cheney and Goldstein about the best approximation pair (BAP) problem in two separate directions. One is the consideration of more than two sets. The other is the ability to handle each set as an intersections of a finite family of sets. We call the resulting problem the "Best Approximation Tuple (BAT) problem". The fundamental observation that leads to this generalizations is to recognize and handle one set (the "pivot set") as different from the remaining sets (the "satellite sets") instead of seeking cycles as the minimizers of a target functional. This enable us to overcome a certain theoretical obstacle related to cycles and minimizers of general functionals. We prove the convergence of the algorithm to the unique solution of the problem in the Euclidean case with strictly convex and compact satellite sets. Because of the lack of Fej\'er monotonicity, our convergence analysis is not standard, and is based on almost unknown properties of orthogonal projections regarding equality and inequality in the definition of nonexpansiveness.

math.OC