论文标题
天然气最大载荷输送用于多通用分析
Natural Gas Maximal Load Delivery for Multi-contingency Analysis
论文作者
论文摘要
随着可再生能源生成的使用增加,电力系统已越来越依赖天然气燃料的发电厂,作为快速升值来源,以满足波动的大量电源需求。这种依赖性为电网引入了新的漏洞,包括对天然和人为灾难的气体传输网络中断。为了应对这些破坏而引起的操作挑战,我们考虑确定损坏的气管线网络可行的稳态操作点的任务,同时确保负载的最大交付。我们制定了混合企业非凸最大负载输送(MLD)问题,这证明很难在大规模网络上解决。为了应对这一挑战,我们提出了MLD问题的混合成员凸松弛,并使用它来确定气管道系统的运输能力的界限。为了证明放松的有效性,比较了九个天然气管道网络网络模型的大量随机损坏场景的确切和松弛的配方,范围为11至4197个连接。还提供了概念验证,该证明是在一组合成产生的地震中假设网络损害,以证明在自然灾害风险评估的背景下,提出的基于优化的能力评估的实用性。对于除最大网络以外的所有人,基于放松的方法被发现适合用于评估多键率网络中断的影响,通常会在不到十秒钟内融合到松弛配方的最佳解决方案。
As the use of renewable generation has increased, electric power systems have become increasingly reliant on natural gas-fired power plants as fast ramping sources for meeting fluctuating bulk power demands. This dependence has introduced new vulnerabilities to the power grid, including disruptions to gas transmission networks from natural and man-made disasters. To address the operational challenges arising from these disruptions, we consider the task of determining a feasible steady-state operating point for a damaged gas pipeline network while ensuring the maximal delivery of load. We formulate the mixed-integer nonconvex maximal load delivery (MLD) problem, which proves difficult to solve on large-scale networks. To address this challenge, we present a mixed-integer convex relaxation of the MLD problem and use it to determine bounds on the transport capacity of a gas pipeline system. To demonstrate the effectiveness of the relaxation, the exact and relaxed formulations are compared across a large number of randomized damage scenarios on nine natural gas pipeline network models ranging in size from 11 to 4197 junctions. A proof of concept application, which assumes network damage from a set of synthetically generated earthquakes, is also presented to demonstrate the utility of the proposed optimization-based capacity evaluation in the context of risk assessment for natural disasters. For all but the largest network, the relaxation-based method is found to be suitable for use in evaluating the impacts of multi-contingency network disruptions, often converging to the optimal solution of the relaxed formulation in less than ten seconds.