Abstract

Security-constrained unit commitment (SCUC) model is used for power system day-ahead scheduling. However, current SCUC model uses a static network to deliver power and meet demand optimally. A dynamic network can provide a lower optimal cost and alleviate network congestion. However, due to the computational complexity and the lack of effective algorithms, network reconfiguration has not been included in the SCUC model yet. This paper presents a novel approach to handle the computational complexity in security-constrained unit commitment (SCUC) with corrective network reconfiguration (CNR) while considering the scalability through accelerated-decomposition approach with fast screening non-critical sub-problems of SCUC-CNR. The proposed approach provides substantial computational benefits and is also applicable to SCUC. Simulation results on the IEEE 24-bus system show that the proposed methods are substantially faster without the loss in solution quality while the scalability benefits are demonstrated using larger cases: the IEEE 73-bus system, IEEE 118-bus system and Polish system.

Index Terms

Accelerated-decomposition approach, Benders decomposition, Corrective transmission switching, Flexible transmission, Mixed-integer linear programming,Network reconfiguration, Post-contingency congestion relief, Securityconstrained unit commitment , Topology control.

Cite this paper:

Arun Venkatesh Ramesh, Xingpeng Li and Kory W. Hedman, “An Accelerated-Decomposition Approach for Security-Constrained Unit Commitment with Corrective Network Reconfiguration,” IEEE Transactions on Power Systems, vol. 37, no. 2, pp. 887-900, Mar. 2022.