A Decomposition Algorithm with Fast Identification of Critical Contingencies for Large-Scale Security-Constrained AC-OPF
Abstract
A decomposition algorithm for solving large-scale security-constrained AC optimal power flow problems is presented. The formulation considered is the one used in the Advanced Research Projects Agency-Energy Grid Optimization Competition, Challenge 1, held from November 2018 through October 2019. Algorithmic strategies are proposed for contingency selection, fast contingency evaluation, handling complementarity constraints, avoiding issues related to degeneracy, and exploiting parallelism. The results of numerical experiments are provided to demonstrate the effectiveness of the proposed techniques as compared with alternative strategies.
History: This paper has been accepted for the Operations Research Special Issue on Computational Advances in Short-Term Power System Operations.
Funding: This work was supported by the Advanced Research Projects Agency-Energy [Grant DE-AR0001073].
