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 (extensible markup language) format. In this paper, we explain this format and present the instances that are available in the library.Data Set: http://gaslib.zib.de Data Set License: CC BY 3.0 Keywords: gas transport; networks; problem instances; mixed-integer nonlinear optimization; GasLib MSC: 90-08; 90C90; 90B10 SummaryThe mathematical simulation and optimization of gas transport through pipeline systems is an important field of research with a large practical impact. Over the last decades, many different mathematical models on different levels of accuracy for different components of gas networks have been developed. On the basis of these models, several simulation and optimization algorithms have been proposed. We refer to [1][2][3] and the references therein for more information. With GasLib, we provide a set of network instances that can be used to test and compare such models and the algorithms for solving them.
Optimization problems under uncertain conditions abound in many real-life applications. While solution approaches for probabilistic constraints are often developed in case the uncertainties can be assumed to follow a certain probability distribution, robust approaches are usually applied in case solutions are sought that are feasible for all realizations of uncertainties within some predefined uncertainty set. As many applications contain different types of uncertainties that require robust as well as probabilistic treatments, we deal with a class of joint probabilistic/robust constraints. Focusing on complex uncertain gas network optimization problems, we show the relevance of this class of problems for the task of maximizing free booked capacities in an algebraic model for a stationary gas network. We furthermore present approaches for finding their solution. Finally, we study the problem of controlling a transient system that is governed by the wave equation. The task consists in determining controls such that a certain robustness measure remains below some given upper bound with high probability.
We study gas network problems with compressors and control valves under uncertainty that can be formulated as two‐stage robust optimization problems. Uncertain data are present in the physical parameters of the pipes as well as in the overall demand. We show how to exploit the special decomposable structure of the problem to reformulate the two‐stage problem as a single‐stage robust optimization problem. The right‐hand side of the single‐stage problem can be precomputed by solving a series of optimization problems and multiple elements of the right‐hand side can be combined into one optimization task. The practical feasibility and effectiveness of our approach is demonstrated with benchmarks on several gas network instances, among them a realistic model of the Greek natural gas network. Overall, aggregation and preprocessing allow us to quickly solve large gas network instances under uncertainty for the price of slightly more conservative solutions.
In this paper we study feasibility and infeasibility of nonlinear two-stage fully adjustable robust feasibility problems with an empty first stage. This is equivalent to deciding whether the uncertainty set is contained within the projection of the feasible region onto the uncertaintyspace. Moreover, the considered sets are assumed to be described by polynomials. For answering this question, two very general approaches using methods from polynomial optimization are presented -one for showing feasibility and one for showing infeasibility. The developed methods are approximated through sum of squares polynomials and solved using semidefinite programs. Deciding robust feasibility and infeasibility is important for gas network operations, which is a nonconvex feasibility problem where the feasible set is described by a composition of polynomials with the absolute value function. Concerning the gas network problem, different topologies are considered. It is shown that a tree structured network can be decided exactly using linear programming. Furthermore, a method is presented to reduce a tree network with one additional arc to a single cycle network. In this case, the problem can be decided by eliminating the absolute value functions and solving the resulting linearly many polynomial optimization problems. Lastly, the effectivity of the methods is tested on a variety of small cyclic networks. It turns out that for instances where robust feasibility or infeasibility can be decided successfully, level 2 or level 3 of the Lasserre relaxation hierarchy typically is sufficient.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.