Details
| Original language | English |
|---|---|
| Pages (from-to) | 15-53 |
| Number of pages | 39 |
| Journal | Optimization Methods and Software |
| Volume | 30 |
| Issue number | 1 |
| Early online date | 17 Mar 2014 |
| Publication status | Published - 2 Jan 2015 |
Abstract
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 non-convex mixed-integer nonlinear feasibility problem. The first phase consists of four distinct algorithms applying mixed-integer linear, mixed-integer nonlinear, nonlinear, and methods for complementarity constraints to compute possible settings for the discrete decisions. The second phase employs a precise continuous nonlinear 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.
Keywords
- gas network optimization, gas transport optimization, mixed-integer nonlinear programming, nomination
ASJC Scopus subject areas
- Computer Science(all)
- Software
- Mathematics(all)
- Control and Optimization
- Mathematics(all)
- Applied Mathematics
Cite this
- Standard
- Harvard
- Apa
- Vancouver
- BibTeX
- RIS
In: Optimization Methods and Software, Vol. 30, No. 1, 02.01.2015, p. 15-53.
Research output: Contribution to journal › Article › Research › peer review
}
TY - JOUR
T1 - Validation of nominations in gas network optimization
T2 - Models, methods, and solutions
AU - Pfetsch, Marc E.
AU - Fügenschuh, Armin
AU - Geißler, Björn
AU - Geißler, Nina
AU - Gollmer, Ralf
AU - Hiller, Benjamin
AU - Humpola, Jesco
AU - Koch, Thorsten
AU - Lehmann, Thomas
AU - Martin, Alexander
AU - Morsi, Antonio
AU - Rövekamp, Jessica
AU - Schewe, Lars
AU - Schmidt, Martin
AU - Schultz, Rüdiger
AU - Schwarz, Robert
AU - Schweiger, Jonas
AU - Stangl, Claudia
AU - Steinbach, Marc C.
AU - Vigerske, Stefan
AU - Willert, Bernhard M.
N1 - Funding Information: We thank Klaus Spreckelsen from OGE GmbH for his support and Timo Berthold and Stefan Heinz from the MATH-EON B20 project for their support on adapting the SCIP solver. We thank the referees for their constructive comments that helped to improve the presentation of the paper. The coauthor Armin Fügenschuh acknowledges a Konrad-Zuse Fellowship.
PY - 2015/1/2
Y1 - 2015/1/2
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 non-convex mixed-integer nonlinear feasibility problem. The first phase consists of four distinct algorithms applying mixed-integer linear, mixed-integer nonlinear, nonlinear, and methods for complementarity constraints to compute possible settings for the discrete decisions. The second phase employs a precise continuous nonlinear 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.
AB - 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 non-convex mixed-integer nonlinear feasibility problem. The first phase consists of four distinct algorithms applying mixed-integer linear, mixed-integer nonlinear, nonlinear, and methods for complementarity constraints to compute possible settings for the discrete decisions. The second phase employs a precise continuous nonlinear 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.
KW - gas network optimization
KW - gas transport optimization
KW - mixed-integer nonlinear programming
KW - nomination
UR - http://www.scopus.com/inward/record.url?scp=84923550538&partnerID=8YFLogxK
U2 - 10.1080/10556788.2014.888426
DO - 10.1080/10556788.2014.888426
M3 - Article
AN - SCOPUS:84923550538
VL - 30
SP - 15
EP - 53
JO - Optimization Methods and Software
JF - Optimization Methods and Software
SN - 1055-6788
IS - 1
ER -