期刊
MATHEMATICAL METHODS OF OPERATIONS RESEARCH
卷 84, 期 2, 页码 427-457出版社
SPRINGER HEIDELBERG
DOI: 10.1007/s00186-016-0564-y
关键词
Mathematical models for gas pipelines; Nomination validation; Gas network capacity; Uncertainty quantifcation; Optimization under stochastic uncertainty; Spheric-radial decomposition
资金
- Deutsche Forschungsgemeinschaft [Sonderforschungsbereich/Transregio 154]
The paper considers the computation of the probability of feasible load constellations in a stationary gas network with uncertain demand. More precisely, a network with a single entry and several exits with uncertain loads is studied. Feasibility of a load constellation is understood in the sense of an existing flow meeting these loads along with given pressure bounds in the pipes. In a first step, feasibility of deterministic exit loads is characterized algebraically and these general conditions are specified to networks involving at most one cycle. This prerequisite is essential for determining probabilities in a stochastic setting when exit loads are assumed to follow some (joint) Gaussian distribution when modeling uncertain customer demand. The key of our approach is the application of the spheric-radial decomposition of Gaussian random vectors coupled with Quasi Monte-Carlo sampling. This approach requires an efficient algorithmic treatment of the mentioned algebraic relations moreover depending on a scalar parameter. Numerical results are illustrated for different network examples and demonstrate a clear superiority in terms of precision over simple generic Monte-Carlo sampling. They lead to fairly accurate probability values even for moderate sample size.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据