论文标题

通过纠正网络重新配置的安全受限的单位承诺的加速分类方法 - 第二部分:结果和讨论

An Accelerated-Decomposition Approach for Security-Constrained Unit Commitment with Corrective Network Reconfiguration- Part II: Results and Discussion

论文作者

Ramesh, Arun Venkatesh, Li, Xingpeng, Hedman, Kory W.

论文摘要

本文提出了一种新的方法,可以使用纠正网络重新配置(CNR)来处理安全受限的单元承诺(SCUC)中的计算复杂性,以利用传输网络的灵活性。通过分解SCUC/SCUC-CNR公式,然后快速筛选非关键亚问题,可以考虑可伸缩性。将其与SCUC和SCUC-CNR的广泛制剂进行了比较,以显示提出的典型分解和加速分解方法的优势。 IEEE 24总线系统上的仿真结果表明,所提出的方法在没有溶液质量损失的情况下更快。与各自的广泛的配方和典型的分解方法相比,提出的大型电源系统在IEEE 73-BUS系统和波兰系统的可伸缩性测试中具有出色的性能,可以实现提出的加速分解方法。总体而言,动态的宿舍后网络可以大大减轻网络拥堵并导致最佳成本较低。

This paper presents a novel approach to handle the computational complexity in security-constrained unit commitment (SCUC) with corrective network reconfiguration (CNR) to harness the flexibility in transmission networks. This is achieved with consideration of scalability through decomposing the SCUC/SCUC-CNR formulation and then fast screening non-critical sub-problems. This is compared against the extensive formulations of SCUC and SCUC-CNR to show the advantages of the proposed typical-decomposition and accelerated-decomposition approaches to SCUC and SCUC-CNR respectively. Simulation results on the IEEE 24-bus system show that the proposed methods are substantially faster without the loss in solution quality. The proposed accelerated-decomposition approaches can be implemented for large power systems as they have great performance in the scalability tests on the IEEE 73-bus system and the Polish system when compared against the respective extensive formulations and typical-decomposition approaches. Overall, a dynamic post-contingency network can substantially alleviate network congestion and lead to a lower optimal cost.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源