论文标题
在安全受限的最佳传输开关问题中制定连接性
Formulating Connectedness in Security-Constrained Optimal Transmission Switching Problems
论文作者
论文摘要
本文重点介绍了安全受限的最佳传输开关问题中网络连接性（NC）的问题，该问题因分支突发事件和纠正线切换而复杂。首先提出了两个标准，该标准是在合理限制内尽可能保留NC的原则。通过扩展基于电流的NC约束，提出了一个命题，将NC的不同情况与最佳的线性程序相关联，从而得出了NC标准的数学公式。根据Karush-Kuhn-Tucker条件，该公式将进一步转化为可拖动版本，该版本可以与现有的Scots模型合并而不影响原始解决方案方法的适用性。最后，对各种网络和苏格兰人模型的案例研究证明了该方法的功效。
This paper focuses on the issue of network connectedness (NC) in security-constrained optimal transmission switching problems, which is complicated by branch contingencies and corrective line switching. Two criteria are firstly proposed with the principle of preserving NC as much as possible within reasonable limits. By extending the electrical flow based NC constraints, a proposition is derived to associate different cases of NC with the optimum of a linear program, yielding the mathematical formulation of the NC criteria. By Karush-Kuhn-Tucker conditions, this formulation is further transformed into a tractable version which can be incorporated with existing SCOTS models without affecting the applicability of original solution approaches. Finally, case studies on various networks and SCOTS models demonstrate the efficacy of the proposed approach.
