SearcharxivSearch

arXiv · 2305.02232

Ramping up the hydrogen sector: An energy system modeling framework

Abstract

With the transition towards a decarbonized society, energy system integration is becoming ever more essential. In this transition, the energy vector hydrogen is expected to play a key role as it can be produced from (renewable) power and utilized in a plethora of applications and processes across sectors. To date, however, there is no infrastructure for the production, storage, and transport of renewable hydrogen, nor is there a demand for it on a larger scale. In order to link production and demand sites, it is planned to re-purpose and expand the existing European gas pipeline network in the future. During the early stages of ramping up the hydrogen sector (2020s and early 2030s), however, blending natural gas with hydrogen for joint pipeline transmission has been suggested. Against this background, this paper studies hydrogen blending from a modeling perspective, both in terms of the implications of considering (or omitting) technical modeling details and in terms of the potential impact on the ramp-up of the hydrogen sector. To this end, we present a highly modular and flexible integrated sector-coupled energy system optimization model of the power, natural gas, and hydrogen sectors with a novel gas flow formulation for modeling blending in the context of steady-state gas flows. A stylized case study illustrates that hydrogen blending has the potential to initiate and to facilitate the ramp-up of the hydrogen sector, while omitting the technical realities of gas flows -- particularly in the context of blending -- can result in suboptimal expansion planning not only in the hydrogen, but also in the power sector, as well as in an operationally infeasible system.

Explore related subjects

Keep this discovery

BibTeXRIS

T. Klatzer, U. Bachhiesl, S. Wogrin, A. Tomasgard. 2023-05-02. Ramping up the hydrogen sector: An energy system modeling framework. https://arxiv.org/abs/2305.02232

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