TY - JOUR
A1 - Pfetsch, Marc
A1 - Fügenschuh, Armin
A1 - Geißler, Björn
A1 - Geißler, Nina
A1 - Gollmer, Ralf
A1 - Hiller, Benjamin
A1 - Humpola, Jesco
A1 - Koch, Thorsten
A1 - Lehmann, Thomas
A1 - Martin, Alexander
A1 - Morsi, Antonio
A1 - Rövekamp, Jessica
A1 - Schewe, Lars
A1 - Schmidt, Martin
A1 - Schultz, Rüdiger
A1 - Schwarz, Robert
A1 - Schweiger, Jonas
A1 - Stangl, Claudia
A1 - Steinbach, Marc
A1 - Vigerske, Stefan
A1 - Willert, Bernhard
T1 - Validation of Nominations in Gas Network Optimization: Models, Methods, and Solutions
T2 - Optimization Methods and Software
N2 - In this article we investigate methods to solve a fundamental task in gas transportation, namely the validation of nomination problem: Given a gas transmission network consisting of passive pipelines and active, controllable elements and given an amount of gas at every entry and exit point of the network, find operational settings for all active elements such that there exists a network state meeting all physical, technical, and legal constraints.
We describe a two-stage approach to solve the resulting complex and numerically difficult feasibility problem. The first phase consists of four distinct algorithms applying linear, and methods for complementarity constraints to compute possible settings for the discrete decisions. The second phase employs a precise continuous programming model of the gas network. Using this setup, we are able to compute high quality solutions to real-world industrial instances that are significantly larger than networks that have appeared in the mathematical programming literature before.
Y1 - 2014
UR - https://opus4.kobv.de/opus4-zib/frontdoor/index/index/docId/4718
PB - Taylor & Francis
ER -