@article{HumpolaJoormannOucherifetal., author = {Humpola, Jesco and Joormann, Imke and Oucherif, Djamal and Pfetsch, Marc and Schewe, Lars and Schmidt, Martin and Schwarz, Robert}, title = {GasLib - A Library of Gas Network Instances}, series = {Optimization Online}, journal = {Optimization Online}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-57950}, abstract = {The development of mathematical simulation and optimization models and algorithms for solving gas transport problems is an active field of research. In order to test and compare these models and algorithms, gas network instances together with demand data are needed. The goal of GasLib is to provide a set of publicly available gas network instances that can be used by researchers in the field of gas transport. The advantages are that researchers save time by using these instances and that different models and algorithms can be compared on the same specified test sets. The library instances are encoded in an XML format. In this paper, we explain this format and present the instances that are available in the library.}, language = {en} } @misc{Humpola, author = {Humpola, Jesco}, title = {Sufficient Pruning Conditions for MINLP in Gas Network Design}, doi = {10.1007/s13675-016-0077-8}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-53489}, abstract = {One quarter of Europe's energy demand is provided by natural gas distributed through a vast pipeline network covering the whole of Europe. At a cost of 1 million Euros per kilometer the extension of the European pipeline network is already a multi billion Euro business. Therefore, automatic planning tools that support the decision process are desired. We model the topology extension problem in gas networks by a mixed-integer nonlinear program (MINLP). This gives rise to a so-called active transmission problem, a continuous nonlinear non-convex feasibility problem which emerges from the MINLP model by fixing all integral variables. In this article we offer novel sufficient conditions for proving the infeasibility of this active transmission problem. These conditions can be expressed in the form of a mixed-integer program (MILP), i.e., the infeasibility of a non-convex NLP can be certified by solving an MILP. These results provide an efficient bounding procedure in a branch-and-bound algorithm. Our computational results demonstrate a substantial speed-up for the necessary computations.}, language = {en} } @incollection{HillerHumpolaLehmannetal., author = {Hiller, Benjamin and Humpola, Jesco and Lehmann, Thomas and Lenz, Ralf and Morsi, Antonio and Pfetsch, Marc and Schewe, Lars and Schmidt, Martin and Schwarz, Robert and Schweiger, Jonas and Stangl, Claudia and Willert, Bernhard}, title = {Computational results for validation of nominations}, series = {Evaluating Gas Network Capacities}, volume = {SIAM-MOS series on Optimization}, booktitle = {Evaluating Gas Network Capacities}, isbn = {9781611973686}, abstract = {The different approaches to solve the validation of nomination problem presented in the previous chapters are evaluated computationally in this chapter. Each approach is analyzed individually, as well as the complete solvers for these problems. We demonstrate that the presented approaches can successfully solve large-scale real-world instances.}, language = {en} } @incollection{HumpolaFuegenschuhHilleretal., author = {Humpola, Jesco and F{\"u}genschuh, Armin and Hiller, Benjamin and Koch, Thorsten and Lehmann, Thomas and Lenz, Ralf and Schwarz, Robert and Schweiger, Jonas}, title = {The Specialized MINLP Approach}, series = {Evaluating Gas Network Capacities}, volume = {SIAM-MOS series on Optimization}, booktitle = {Evaluating Gas Network Capacities}, isbn = {9781611973686}, abstract = {We propose an approach to solve the validation of nominations problem using mixed-integer nonlinear programming (MINLP) methods. Our approach handles both the discrete settings and the nonlinear aspects of gas physics. Our main contribution is an innovative coupling of mixed-integer (linear) programming (MILP) methods with nonlinear programming (NLP) that exploits the special structure of a suitable approximation of gas physics, resulting in a global optimization method for this type of problem.}, language = {en} } @article{HumpolaLehmannFuegenschuh, author = {Humpola, Jesco and Lehmann, Thomas and F{\"u}genschuh, Armin}, title = {A primal heuristic for optimizing the topology of gas networks based on dual information}, series = {EURO Journal on Computational Optimization}, volume = {3}, journal = {EURO Journal on Computational Optimization}, number = {1}, doi = {10.1007/s13675-014-0029-0}, pages = {53 -- 78}, abstract = {We present a novel heuristic to identify feasible solutions of a mixed-integer nonlinear programming problem arising in natural gas transportation: the selection of new pipelines to enhance the network's capacity to a desired level in a cost-efficient way. We solve this problem in a linear programming based branch-and-cut approach, where we deal with the nonlinearities by linear outer approximation and spatial branching. At certain nodes of the branching tree, we compute a KKT point of a nonlinear relaxation. Based on the information from the KKT point we alter some of the binary variables in a locally promising way exploiting our problem-specific structure. On a test set of real-world instances, we are able to increase the chance of identifying feasible solutions by some order of magnitude compared to standard MINLP heuristics that are already built in the general-purpose MINLP solver SCIP.}, language = {en} } @incollection{HaynHumpolaKochetal., author = {Hayn, Christine and Humpola, Jesco and Koch, Thorsten and Schewe, Lars and Schweiger, Jonas and Spreckelsen, Klaus}, title = {Perspectives}, series = {Evaluating Gas Network Capacities}, volume = {SIAM-MOS series on Optimization}, booktitle = {Evaluating Gas Network Capacities}, isbn = {9781611973686}, abstract = {After we discussed approaches to validate nominations and to verify bookings, we consider possible future research paths. This includes determining technical capacities and planning of network extensions.}, language = {en} } @article{HumpolaFuegenschuh, author = {Humpola, Jesco and F{\"u}genschuh, Armin}, title = {Convex reformulations for solving a nonlinear network design problem}, series = {Computational Optimization and Applications}, volume = {62}, journal = {Computational Optimization and Applications}, number = {3}, publisher = {Springer US}, doi = {10.1007/s10589-015-9756-2}, pages = {717 -- 759}, abstract = {We consider a nonlinear nonconvex network design problem that arises, for example, in natural gas or water transmission networks. Given is such a network with active and passive components, that is, valves, compressors, control valves (active) and pipelines (passive), and a desired amount of flow at certain specified entry and exit nodes in the network. The active elements are associated with costs when used. Besides flow conservation constraints in the nodes, the flow must fulfill nonlinear nonconvex pressure loss constraints on the arcs subject to potential values (i.e., pressure levels) in both end nodes of each arc. The problem is to compute a cost minimal setting of the active components and numerical values for the flow and node potentials. We examine different (convex) relaxations for a subproblem of the design problem and benefit from them within a branch-and-bound approach. We compare different approaches based on nonlinear optimization numerically on a set of test instances.}, language = {en} }