Relaxations of AC Maximal Load Delivery for Severe Contingency Analysis
Relaxations of AC Maximal Load Delivery for Severe Contingency Analysis
复制标题
放宽交流最大负载输送以进行严重意外事故分析
DOI：
--
复制
发表时间：
2017
影响因子：
6.6
通讯作者：
S. Backhaus
中科院分区：
文献类型：
--
作者：
Carleton Coffrin;R. Bent;Byron Tasseff;K. Sundar;S. Backhaus
这项工作考虑的任务是找到严重受损的传输网络的交流可行工作点，同时确保可以提供最大量的有功功率负载。这种交流最大负载输送 (AC-MLD) 任务是一个非凸非线性优化问题，在大规模传输系统数据集上解决起来非常具有挑战性。这项工作表明，AC-MLD 问题的凸松弛提供了一种可靠且可扩展的方法，用于寻找 AC-MLD 问题中可提供的有功功率量的高质量界限。为了证明其有效性，本文提出的解决方案方法在 7 个电力网络（规模从 70 到 6000 辆公交车不等）的 1000 个 <inline-formula><tex-math notation="LaTeX">$N$</tex-math></inline-formula>-<inline-formula><tex-math notation="LaTeX">$k$</tex-math></inline-formula> 场景上进行了严格评估。对于所考虑的所有 7000 个场景，AC-MLD 问题最有效的缓解方法是在商用计算硬件上不到 20 秒的时间内收敛。
This work considers the task of finding an ac-feasible operating point of a severely damaged transmission network while ensuring that a maximal amount of active power loads can be delivered. This AC maximal load delivery (AC-MLD) task is a nonconvex nonlinear optimization problem that is incredibly challenging to solve on large-scale transmission system data sets. This work demonstrates that convex relaxations of the AC-MLD problem provide a reliable and scalable method for finding high-quality bounds on the amount of active power that can be delivered in the AC-MLD problem. To demonstrate their effectiveness, the solution methods proposed in this work are rigorously evaluated on 1000 <inline-formula><tex-math notation="LaTeX">$N$</tex-math></inline-formula>-<inline-formula><tex-math notation="LaTeX">$k$</tex-math></inline-formula> scenarios on seven power networks ranging in size from 70 to 6000 buses. The most effective relaxation of the AC-MLD problem converges in less than 20 seconds on commodity computing hardware for all 7000 of the scenarios considered.