Hostname: page-component-76d6cb85b7-lcgwf Total loading time: 0 Render date: 2026-07-13T09:42:27.789Z Has data issue: false hasContentIssue false

Optimal transport on gas networks

Published online by Cambridge University Press:  16 April 2025

Ariane Fazeny*
Affiliation:
Helmholtz Imaging, Deutsches Elektronen-Synchrotron DESY, Hamburg, Germany
Martin Burger
Affiliation:
Helmholtz Imaging, Deutsches Elektronen-Synchrotron DESY, Hamburg, Germany Fachbereich Mathematik, Universität Hamburg, Hamburg, Germany
Jan-F. Pietschmann
Affiliation:
Institute of Mathematics, Institut für Mathematik, Universität Augsburg, Augsburg, Germany Centre for Advanced Analytics and Predictive Sciences (CAAPS), University of Augsburg, Augsburg, Germany
*
Corresponding author: Ariane Fazeny; Email: ariane.fazeny@desy.de
Rights & Permissions [Opens in a new window]

Abstract

Optimal transport tasks naturally arise in gas networks, which include a variety of constraints such as physical plausibility of the transport and the avoidance of extreme pressure fluctuations. To define feasible optimal transport plans, we utilize a $p$-Wasserstein metric and similar dynamic formulations minimizing the kinetic energy necessary for moving gas through the network, which we combine with suitable versions of Kirchhoff’s law as the coupling condition at nodes. In contrast to existing literature, we especially focus on the non-standard case $p \neq 2$ to derive an overdamped isothermal model for gases through $p$-Wasserstein gradient flows in order to uncover and analyze underlying dynamics. We introduce different options for modelling the gas network as an oriented graph including the possibility to store gas at interior vertices and to put in or take out gas at boundary vertices.

Information

Type
Papers
Creative Commons
Creative Common License - CCCreative Common License - BY
This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution and reproduction, provided the original article is properly cited.
Copyright
© The Author(s), 2025. Published by Cambridge University Press
Figure 0

Table 1. Contributions to the total mass

Figure 1

Algorithm 1: Primal-dual algorithm for the solution of the optimal transport problems.

Figure 2

Figure 1. Sketch of the graph used in the first example for branching geodesics. Here, no in- or outflux via the boundary is assumed (i.e.$\partial ^+ \mathcal {V} = \partial ^- \mathcal {V} = \emptyset$∂+V=∂−V=∅).

Figure 3

Figure 2. Branching geodesic without vertex dynamic: Snapshots of the dynamics of the densities$\rho _e$ρeat different times.

Figure 4

Figure 3. Branching geodesic with vertex dynamic: Snapshots of the dynamics of the densities$\rho _e$ρeand$\gamma _{\nu }$γν at different times.

Figure 5

Figure 4. Sketch of the graph used in the second example. We set$\partial ^+ \mathcal {V} = \{\nu _1\}$∂+V={ν1}, $\partial ^- \mathcal {V} = \{\nu _3,\,\nu _4\}$∂−V={ν3,ν4}and$\stackrel{\small\circ}{\mathcal {V}} = \{\nu _2\}$V∘={ν2}.

Figure 6

Figure 5. Snapshots of the dynamics of the densities$\rho _e$ρeand$\gamma _{\nu }$γνwith symmetric boundary conditions (InOutSym) at different times.

Figure 7

Figure 6. Snapshots of the dynamics of the densities$\rho _e$ρeand$\gamma _{\nu }$γνwith asymmetric boundary conditions (InOutAsym) at different times.