A Sparse Tableau Formulation for Node-Breaker Representations in Security-Constrained Optimal Power Flow
A Sparse Tableau Formulation for Node-Breaker Representations in Security-Constrained Optimal Power Flow
复制标题
安全约束最优潮流中节点断路器表示的稀疏 Tableau 公式
DOI：
--
复制
发表时间：
2019
影响因子：
6.6
通讯作者：
C. DeMarco
中科院分区：
文献类型：
--
作者：
Byungkwon Park;Jesse T. Holzer;C. DeMarco
交流最优潮流(ACOPF)中事故的真实表示常常对传统的节点-支路网络模型提出挑战。这种方法源于结点分析，用熟悉的母线导纳矩阵、内联公式和tex-notation=“LaTeX”>；$Y_{\text{bus}}$<；/tex-math>；<；/inline-formula>；.来表示网络约束固定的<；内联公式<；tex数学notation=“LaTeX”>；$Y_{\text{bus}}$<；/tex-math>；<；/inline-formula>；不能表示常见的断路器动作，如母线拆分。行内公式notation=“LaTeX”>；$Y_{\text{bus}}$<；/tex-math>；<；/inline-formula>；-based分析的变通办法通常依赖于拓扑处理，根据断路器设置在不同的行内公式notation=“LaTeX”>；$Y_{\text{bus}}$<；/tex-math>；<；/inline-formula>；矩阵之间进行切换。在本文中，我们提出了一种非常通用的节点断路器方法，采用多端口单元模型并使用稀疏表公式(STF)来表示网络约束。该方法不是将断路器动作视为改变网络拓扑，从而改变基尔霍夫电压定律(KVL)和基尔霍夫电流定律(KCL)方程的结构，而是将断路器的位置表示为仅影响与单个元件相关的约束，从而保持KVL和KCL约束中的固定结构。虽然需要更多的变量，但STF证明比<；内联公式>；<；tex数学notation=“LaTeX”>；$Y_{\text{bus}}$<；/tex-math>；<；/inline-formula>；公式更稀疏。数值算例研究表明，在几百条母线的规模上，STF的计算效率与内联公式notation=“LaTeX”>；$Y_{\text{bus}}$<；/tex-math>；<；/inline-formula>；-based相当，而在一千多条母线的情况下，其计算成本更低。
Realistic representations of contingencies in AC optimal power flow (ACOPF) often challenge traditional bus-branch network models. Derived from nodal analysis, such approaches represent network constraints in terms of the familiar bus admittance matrix, <inline-formula><tex-math notation="LaTeX">$Y_{\text{bus}}$</tex-math></inline-formula>. A fixed <inline-formula><tex-math notation="LaTeX">$Y_{\text{bus}}$</tex-math></inline-formula> is unable to represent common circuit breaker actions such as bus splitting. Work-arounds for <inline-formula><tex-math notation="LaTeX">$Y_{\text{bus}}$</tex-math></inline-formula>-based analysis typically rely on topology processing, switching between different <inline-formula><tex-math notation="LaTeX">$Y_{\text{bus}}$</tex-math></inline-formula> matrices depending on breaker settings. In this paper, we propose a very general node-breaker approach, employing multi-port element models and using a sparse tableau formulation (STF) for network constraints. Instead of treating breaker action as altering network topology, and hence changing the structure of Kirchhoff's voltage law (KVL) and Kirchhoff's current law (KCL) equations, this approach represents a breaker's position as impacting only constraints associated with a single component, thereby maintaining fixed structure in the KVL and KCL constraints. While larger numbers of variables are required, STF proves sparser than <inline-formula><tex-math notation="LaTeX">$Y_{\text{bus}}$</tex-math></inline-formula> formulations. Numerical case studies herein demonstrate that STF provides computational efficiency comparable to a <inline-formula><tex-math notation="LaTeX">$Y_{\text{bus}}$</tex-math></inline-formula>-based ACOPF at the scale of several hundred buses, and lower computational cost in an example of over one thousand buses.