首页> 外文期刊>Optimization and Engineering >Maximizing the storage capacity of gas networks: a global MINLP approach
【24h】

Maximizing the storage capacity of gas networks: a global MINLP approach

机译:最大化气体网络的存储容量:全球迷人方法

获取原文
获取原文并翻译 | 示例
       

摘要

In this paper, we study the transient optimization of gas networks, focusing in particular on maximizing the storage capacity of the network. We include nonlinear gas physics and active elements such as valves and compressors, which due to their switching lead to discrete decisions. The former is described by a model derived from the Euler equations that is given by a coupled system of nonlinear parabolic partial differential equations (PDEs). We tackle the resulting mathematical optimization problem by a first-discretize-then-optimize approach. To this end, we introduce a new discretization of the underlying system of parabolic PDEs and prove well-posedness for the resulting nonlinear discretized system. Endowed with this discretization, we model the problem of maximizing the storage capacity as a non-convex mixed-integer nonlinear problem (MINLP). For the numerical solution of the MINLP, we algorithmically extend a well-known relaxation approach that has already been used very successfully in the field of stationary gas network optimization. This method allows us to solve the problem to global optimality by iteratively solving a series of mixed-integer problems. Finally, we present two case studies that illustrate the applicability of our approach.
机译:在本文中,我们研究了气体网络的瞬态优化,特别是最大化网络的存储容量。我们包括非线性气体物理和活性元件,如阀门和压缩机,这是由于它们的开关导致离散的决定。前者由来自由非线性抛物面部分微分方程(PDE)的耦合系统给出的欧拉方程的模型描述。我们通过第一离散化 - 优化方法来解决所产生的数学优化问题。为此,我们介绍了抛物面PDE的底层系统的新离散化,并证明了所得非线性离散化系统的良好姿势。赋予这种离散化,我们模拟了将存储容量最大化为非凸的混合整数非线性问题(MINLP)的问题。对于MINLP的数值解决方案,我们算法展示了一种众所周知的放松方法,该方法已经在固定气体网络优化领域中非常成功地使用。通过迭代解决一系列混合整数问题,该方法允许我们解决全局最优性的问题。最后,我们提出了两个案例研究,说明了我们的方法的适用性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号