An Iterative AC-SCOPF Approach Managing the Contingency and Corrective Control Failure Uncertainties With a Probabilistic Guarantee

Abstract

This paper studies an extended formulation of the Security Constrained Optimal Power Flow (SCOPF) problem, which explicitly takes into account the probabilities of contingency events and of potential failures in the operation of post-contingency corrective controls. To manage such threats, we express the requirement that the probability of maintaining all system operational limits, under any circumstance, should remain acceptably high by means of a chance-constraint. Further, representing power flow as per the full AC model, we propose a heuristic solution approach leveraging state-of-the-art methodologies and tools originally developed to tackle the standard, deterministic-constrained SCOPF statement. We exemplify the properties of our proposal by presenting its application on the three area version of the IEEE-RTS96 benchmark, stressing the interpretability of both the chance-constrained reliability management strategy and of the heuristic algorithm proposed to determine it. This work serves to showcase that the first step on the transition towards probabilistic reliability management can be achieved by suitably adapting presently available operational practices and tools.

A Fast Decomposition Method to Solve a Security-Constrained Optimal Power Flow (SCOPF) Problem Through Constraint Handling

“…in [2], [7], [10]. However, most of the proposed formulations for the C-SCOPF problem have not considered the active power droop control, the PV/PQ switching, the lack of modeling of possible corrective control failures, neither the cost of the overall corrective actions [14]- [16].…”

“…Other SCOPF models include risk assessment [1], [17], [18], time constraints [19], and stochastic models [14], [16]. However, many of these models must tackle computational limitations (e.g.…”

“…However, many of these models must tackle computational limitations (e.g. computation time and memory) when solving the SCOPF problem by considering medium-and largescale networks as well as a large number of contingencies [7], [16].…”

A Novel Approximation of Security-Constrained Optimal Power Flow With Incorporation of Generator Frequency and Voltage Control Response

“…Most SCOPF research works consider only continuous variables (NLP problem), shifting their focus towards reducing the problem size [5]- [7]. To achieve this goal, some problem decomposition methods, aimed at the efficient identification of binding constraints in an iterative fashion, have been proposed based on: i) the progressive accumulation of constraints related to only potentially binding contingencies [6], [8]- [10], ii) Bender decomposition [3], [5], iii) the alternating direction method of multipliers [5], or iv) exploiting the problem structure of interior-point methods [7], [9]. Regardless of the approach, a common feature is solving an NLP problem at all outer loops of the decomposition, mostly by interior point algorithms [5]- [7], [9] or sequential linear programming [8].…”

Improved Correction Strategy for Power Flow Control Based on Multi-Machine Sensitivity Analysis

“…The algorithm helps prevent power congestion and balances renewable power generation and loads in power systems. In terms of security-constrained optimal power flow (SCOPF), an extended formula of the SCOPF problem was studied [6], with explicit consideration of the probability of emergency events and potential faults in CC operations after an emergency; however, details of the control strategy were not included. The optimal coordination problem of preventive control (PC) and CC was studied by means of a safetyconstrained power flow prevention-correction optimization model [7].…”