安全约束最优传输切换问题中连通性的公式化
Formulating Connectedness in Security-Constrained Optimal Transmission Switching Problems
摘要：
研究了具有安全约束的输电线路最优切换问题中的网络连通性问题，该问题因支路故障和线路校正切换而变得复杂。首先提出了在合理范围内尽可能保持NC的两个准则。通过扩展基于电流的NC约束，推导出一个命题，将NC的不同情况与线性规划的最优性联系起来，得到了NC准则的数学表达式。通过Karush-Kuhn-Tucker条件，将该公式进一步转化为一个易于处理的形式，该形式可以与现有的SCOTs模型相结合，而不影响原求解方法的适用性。最后，各种网络和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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
