A Decomposition Approach for Optimal Gas Network Extension with a Finite Set of Demand Scenarios

  • Today's gas markets demand more flexibility from the network operators which in turn have to invest into their network infrastructure. As these investments are very cost-intensive and long-living, network extensions should not only focus on a single bottleneck scenario, but should increase the flexibility to fulfill different demand scenarios. In this work, we formulate a model for the network extension problem for multiple demand scenarios and propose a scenario decomposition in order to solve the arising challenging optimization tasks. In fact, each subproblem consists of a mixed-integer nonlinear optimization problem (MINLP). Valid bounds on the objective value are derived even without solving the subproblems to optimality. Furthermore, we develop heuristics that prove capable of improving the initial solutions substantially. Results of computational experiments on realistic network topologies are presented. It turns out that our method is able to solve these challenging instances to optimality within a reasonable amount of time.
Metadaten
Author:Jonas SchweigerORCiD, Frauke Liers
Document Type:Article
Parent Title (English):Optimization and Engineering
Volume:19
Issue:2
First Page:297
Last Page:326
Publisher:Springer
Fulltext Url:https://doi.org/10.1007/s11081-017-9371-4
Year of first publication:2018
Published in:Optimization and Engineering