一种快速且可扩展的迭代求解含两阶段事故后控制的社会经济安全约束最优潮流方法
A Fast and Scalable Iterative Solution of a Socio-Economic Security-Constrained Optimal Power Flow with Two-Stage Post-Contingency Control
AI总结:
提出一种基于问题分解和逆矩阵修正引理的快速可扩展迭代方法,求解含两阶段事故后控制的安全约束最优潮流问题,在10,000节点系统中高效处理12,706个支路事故,兼顾安全性与经济性。
摘要:
本文提出了一种快速且可扩展的迭代方法,用于求解安全约束最优潮流(SCOPF)问题,该方法基于问题分解和逆矩阵修正引理。所提出的SCOPF模型通过考虑短期和长期事故后限制、支路停运概率以及预防性和校正性措施,构建了一个概率性校正SCOPF问题,用于处理系统安全运行规划。通过使用两个事故后状态和事故概率,该SCOPF能够在比仅采用预防性措施的典型“N-1”模型更低的成本下提供良好的系统安全性。此外,基于系统运营商策略的事故后减载限制约束进一步确保了安全性。所提出的方法被应用于一系列测试系统,最大包含10,000个节点,对所有12,706个支路事故的计算时间最高达3375秒。利用逆矩阵修正引理,计算事故潮流仅占总求解时间的1.3%。
英文摘要:
A fast and scalable iterative methodology for solving the security-constrained optimal power flow (SCOPF) problem is proposed using problem decomposition and the inverse matrix modification lemma. The SCOPF formulation tackles system security operational planning by using short- and long-term post-contingency limits, probability of branch outages, and preventive and corrective actions, a probabilistic corrective-SCOPF problem formulation. Using two post-contingency states and contingency probabilities, the SCOPF could provide good system security at a lower cost than only preventive actions as the typical `N-1'-formulation does. Additional security is ensured using a post-contingency load-shedding limit constraint based on system operator policy. The proposed methodology is applied to a range of test systems containing up to 10,000 buses with a computational time of up to 3375 s for all 12,706 branch contingencies. Calculating contingency power flows takes 1.3% of the total solution time using the proposed methodology exploiting the inverse matrix modification lemma.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。