A01
Refine
Language
- English (14)
Keywords
- MINLP (2)
- Mixed-Integer Nonlinear Optimization (2)
- Potential networks (2)
- Potential-based flows (2)
- Gas Transport (1)
- GasLib (1)
- Global Optimization (1)
- Maximum flow problem (1)
- Network Optimization (1)
- Network reduction (1)
Document Type
- Article (7)
- Preprint (4)
- Part of a Book (1)
- Conference Proceeding (1)
- Periodical (1)
This paper deals with the mixing of gases in stationary networks. We first derive a model and pressure law for mixing, for which there is empirical evidence for its accuracy. The model is based on the change of the speed of sound in gas mixtures.
We then consider stationary gas networks. The existence result for solutions of single gas flow on networks is extended to mixtures. Further, we establish an easy to check criterion for uniqueness of solutions on the network. This results in a uniqueness proof of solutions on all networks with a mixture of natural gas and low hydrogen percentages. We then develop a solution algorithm that alternates between the solution of a single gas problem and update of the mixture ratios. In a computational study, different model variants and their impact on performance are compared.
Moreover, the increased complexity of solving stationary gas transport problems with mixing is evaluated.
This chapter addresses mathematical models for isothermal mixtures of hydrogen and natural gas, motivated by the need for reliable simulation tools in future low-carbon energy systems. We analyze several classes of mixture models and investigate their convergence properties in the regime of strong interaction between constituents, covering stationary and instationary single-pipe settings as well as network flows. Since mixture models critically depend on the choice of pressure law, we compare the industry-standard GERG equation of state with simplified alternatives that preserve convex energies and reduce computational costs. For network applications, we discuss consistent coupling conditions across model classes, explore optimization of steady flows using the algebraic Weymouth formulation, and provide numerical evidence for its applicability in relevant operating regimes. The study reveals when simplified models are justified and outlines key open challenges for the modeling of gas mixtures.
Potential-based flows provide an algebraic way to model static physical flows
in networks, for example, in gas, water, and lossless DC power networks. The flow on an
arc in the network depends on the difference of the potentials at its end-nodes, possibly
in a nonlinear way. Potential-based flows have several nice properties like uniqueness
and acyclicity. The goal of this paper is to provide an overview of the current knowledge
on these models with a focus on optimization problems on such networks. We cover
basic properties, computational complexity, monotonicity, uncertain parameters, and
the corresponding behavior of the network as well as topology optimization.
The construction of a cost minimal network for flows obeying
physical laws is an important problem for the design of electricity, water,
hydrogen, and natural gas infrastructures. We formulate this problem as
a mixed-integer non-linear program. Its non-convexity, due to the poten-
tial flow, together with the binary variables, indicating the decision to
build a connection, make these problems challenging to solve. We develop
a novel class of valid inequalities on the fractional relaxations of the bi-
nary variables. Further, we show that this class of inequalities can be sep-
arated in polynomial for solutions to a fractional relaxation. This makes
it possible to incorporate these inequalities into a branch-and-bound al-
gorithm. The advantage of these inequalities is lastly demonstrated in a
computational study on the design of real-world gas transport networks.
This paper presents a model for the mixture of gases on
networks in the stationary case. The model is based on an equation
of state for the mixture, the stationary isothermal Euler equations and
coupling conditions for the flow and mixture. The equation of state or
pressure law is based on the change of the speed of sound in a mixture of
gases. We use this model to solve stationary gas flow problems to global
optimality on large networks and present computational results.
Physics informed neural networks have been recently proposed and offer a new promising method to solve differential equations. They have been adapted to many more scenarios and different variations of the original method have been proposed. In this case study we review many of these variations. We focus on variants that can compensate for imbalances in the loss function and perform a comprehensive numerical comparison of these variants with application to gas transport problems. Our case study includes different formulations of the loss function, different algorithmic loss balancing methods, different optimization schemes and different numbers of parameters and sampling points. We conclude that the original PINN approach with specifically chosen constant weights in the loss function gives the best results in our tests. These weights have been obtained by a computationally expensive random-search scheme. We further conclude for our test case that loss balancing methods which were developed for other differential equations have no benefit for gas transport problems, that the control volume physics informed formulation has no benefit against the initial formulation and that the best optimization strategy is the L-BFGS method.
For an infeasible network flow system with supplies and demands, we consider the problem of finding a minimum irreducible infeasible subsystem cover, i.e., a smallest set of constraints that must be dropped to obtain a feasible system. The special cases of covers which only contain flow balance constraints (node cover) or only flow bounds (arc cover) are investigated as well. We show strong NP-hardness of all three variants. Furthermore, we show that finding minimum arc covers for assignment problems is still hard and as hard to approximate as the set covering problem. However, the minimum arc cover problem is polynomially solvable for networks on cactus graphs. This leads to the development of two different fixed parameter algorithms with respect to the number of elementary cycles connected at arcs and the treewidth, respectively. The latter can be adapted for node covers and the general case.
This paper addresses the optimal design of resilient systems, in which components can fail. The system can react to failures and its behavior is described by general mixed integer nonlinear programs, which allows for applications to many (technical) systems. This then leads to a three-level optimization problem. The upper level designs the system minimizing a cost function, the middle level represents worst-case failures of components, i.e., interdicts the system, and the lowest level operates the remaining system. We describe new inequalities that characterize the set of resilient solutions and allow to reformulate the problem. The reformulation can then be solved using a nested branch-and-cut approach. We discuss several improvements, for instance, by taking symmetry into account and strengthening cuts. We demonstrate the effectiveness of our implementation on the optimal design of water networks, robust trusses, and gas networks, in comparison to an approach in which the failure scenarios are directly
included into the model.
Potential-based flows constitute a basic model to represent physical behavior in networks.
Under natural assumptions, the flow in such networks must be acyclic. The goal of this
paper is to exploit this property for the solution of corresponding optimization problems.
To this end, we introduce several combinatorial models for acyclic flows, based on binary
variables for flow directions. We compare these models and introduce a particular model
that tries to capture acyclicity together with the supply/demand behavior. We analyze
properties of this model, including variable fixing rules. Our computational results show
that the usage of the corresponding constraints speeds up solution times by about a factor
of 3 on average and a speed-up of a factor of almost 5 for the time to prove optimality.
Natural gas is important for the energy turnaround in many countries like in Germany, where it serves as a "bridging energy" towards a fossil-free energy supply in the future. About 20% of the total German energy demand is provided by natural gas, which is transported through a complex pipeline network with a total length of about 30000 km and the efficient use of the given transport infrastructure for natural gas is of political, economic, and societal importance.
As a consequence of the liberalization of the European gas market in the last decades, gas trading and transport have been decoupled. This has led to new challenges for gas transport companies, and mathematical optimization is perfectly suited for tackling many of these challenges. However, the underlying mathematical problems are by far too hard to be solved by today's general-purpose software so that novel mathematical theory and algorithms are needed. The industrial research project "ForNe: Research Cooperation Network Optimization" has been initiated and funded by Open Grid Europe in 2009 and brought together experts in mathematical optimization from seven German universities and research institutes, which cover almost the entire range of mathematical optimization: integer and nonlinear optimization as well as optimization under uncertainty.
The mathematical research results have been put together in a software package that has been delivered to Open Grid Europe at the end of the project. Moreover, the research is still continuing - e.g., in the Collaborative Research Center/Transregio 154 "Mathematical Modelling, Simulation and Optimization using the Example of Gas Networks" funded by the German Research Foundation.