A new iterative approach to the corrective security-constrained optimal power flow problem

This paper deals with techniques to solve the corrective security-constrained
optimal power flow (CSCOPF) problem. To this end, we propose
a new iterative approach that comprises four modules: a CSCOPF which
considers only a subset of potentially binding contingencies among
the postulated ones, a (steady-state) security analysis (SSSA), a
contingency filtering (CF) technique, and an OPF variant to check
post-contingency state feasibility when taking into account
post-contingency corrective actions. We compare performances of our
approach and its possible variants with classical CSCOPF approaches such
as the direct approach and Benders decomposition (BD), on three systems
of 60, 118, and 1203 buses.