Combinatorial network flow methods for instationary gas flows and gas market problems (A07)

• Subject Area: Mathematics
• Term: since 2014
• Project identifier: Deutsche Forschungsgemeinschaft (DFG) - Project number 239904186

The goal of this project is to provide a comprehensive study of the problem of maximizing the welfare in hydrogen or gas network. Welfare is generated by satisfying routing requests where the ability to satisfy requests is limited by the physical capacity of the networks, e.g., in terms of bounds on the maximum pressures at the nodes. These questions are formulated as non-linear packing problems that lead to a coupling of the discrete decision whose requests have to be satisfied and fractional decisions about how the flows are distributed over time and within the network. The project further studies variants of the problem where the requests appear in random order, and/or a mechanism design variant where the welfare of satisfying a request is unknown to the network operator.

• DFG Programme: CRC/Transregios
• Subproject of: TRR 154: Mathematical modelling, simulation and optimization using the example of gas networks
• Applicant Institution: Friedrich-Alexander-Universität Erlangen-Nürnberg
• Project Heads: Professor Dr. Max Klimm; Professor Dr. Marc Emanuel Pfetsch; Professor Dr. Martin Skutella