SOLVING VERY LARGE-SCALE SECURITY-CONSTRAINED OPTIMAL POWER FLOW PROBLEMS BY COMBINING ITERATIVE CONTINGENCY SELECTION AND NETWORK COMPRESSION

This paper proposes a practical algorithm for solving very large-scale SCOPF problems, based on the combination of a contingency filtering scheme, used to identify the binding contingencies at the optimum, and a network compression method, used to reduce the complexity of the post-contingency models included in the SCOPF formulation. By combining these two complementary simplifications, it is possible to solve SCOPF problems addressing both preventive and corrective controls on continental sized power system models and with a very large number of contingencies. The proposed algorithms are implemented with state-of-the-art solvers and applied on a model of the European transmission system, of about 15000 buses, and with about 11000 contingencies.