最优潮流的稀疏Tableau公式
Sparse Tableau Formulation for Optimal Power Flow Applications
摘要：
最优潮流（OPF）问题的典型公式依赖于所谓的“母线支路”模型，网络电气行为总结在Ybus导纳矩阵。从电路的角度来看，这种导纳表示限制了网络元件被电压控制，并且Ybus的局限性早已被认识到。一个固定的Ybus不能代表一个理想的断路器，更微妙的限制出现在Transformer建模。在电力系统的说法，更详细的方法来克服这些限制被称为“节点断路器”的表示，但这些往往是繁琐的，并没有广泛使用的OPF。基于稀疏Tableau公式（STF），本文提出了一种适用于OPF的通用网络表示方法，该方法具有以下优点：（i）在公式化约束时概念清晰，允许一组全面的网络电气变量;（ii）在捕获物理行为和工程极限方面提高了保真度;（iii）增加了优化解决方案的灵活性，因为中间变量的消除留给优化算法。STF，然后应用到OPF数值案例研究表明，STF显示很少或没有惩罚的计算速度相比，经典的OPF表示，有时提供了相当大的优势，在计算速度。
英文摘要：
Typical formulations of the optimal power flow (OPF) problem rely on what is termed the "bus-branch" model, with network electrical behavior summarized in the Ybus admittance matrix. From a circuit perspective, this admittance representation restricts network elements to be voltage controlled and limitations of the Ybus have long been recognized. A fixed Ybus is unable to represent an ideal circuit breaker, and more subtle limitations appear in transformer modeling. In power systems parlance, more detailed approaches to overcome these limitations are termed "node-breaker" representations, but these are often cumbersome, and are not widely utilized in OPF. This paper develops a general network representation adapted to the needs of OPF, based on the Sparse Tableau Formulation (STF) with following advantages for OPF: (i) conceptual clarity in formulating constraints, allowing a comprehensive set of network electrical variables; (ii) improved fidelity in capturing physical behavior and engineering limits; (iii) added flexibility in optimization solution, in that elimination of intermediate variables is left to the optimization algorithm. The STF is then applied to OPF numerical case studies which demonstrate that the STF shows little or no penalty in computational speed compared to classic OPF representations, and sometimes provides considerable advantage in computational speed.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
