Pipe Merging for Transient Gas Network Problems

Please always quote using this URN: urn:nbn:de:0297-zib-82116
  • In practice, transient gas transport problems frequently have to be solved for large-scale gas networks. Gas network optimization problems typically belong to the class of Mixed-Integer Nonlinear Programming Problems (MINLP). However current state-of-the-art MINLP solvers are not yet mature enough to solve large-scale real-world instances. Therefore, an established approach in practice is to solve the problems with respect to a coarser representation of the network and thereby reducing the size of the underlying model. Two well-known aggregation methods that effectively reduce the network size are parallel and serial pipe merges. However, these methods have only been studied in stationary gas transport problems so far. This paper closes this gap and presents parallel and serial pipe merging methods in the context of transient gas transport. To this end, we introduce the concept of equivalent and heuristic subnetwork replacements. For the heuristic methods, we conduct a huge empirical evaluation based on real-world data taken from one of the largest gas networks in Europe. It turns out that both, parallel and serial pipe merging can be considered as appropriate aggregation methods for real-world transient gas flow problems.

Download full text files

Export metadata

Metadaten
Author:Ralf LenzORCiD
Document Type:ZIB-Report
Tag:Gas network optimization; Network aggregation; Nonlinear Programming; Pipe merging; Transient gas flow transport
MSC-Classification:90-XX OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING
Date of first Publication:2021/04/15
Series (Serial Number):ZIB-Report (21-10)
ISSN:1438-0064