A Fast Decomposition Method to Solve a Security-Constrained Optimal Power Flow (SCOPF) Problem Through Constraint Handling
Tomas Valencia-Zuluaga, Daniel Agudelo-Martinez, Dario Arango-Angarita, Camilo A. Acosta-Urrego, Sergio Rivera, Diego Rodriguez-Medina, Juan M. Gers
Abstract
This paper presents a decomposition methodology using constraint handling rules to improve the computation time of a security-constrained optimal power flow (SCOPF) problem. In order to evaluate methodology performance, tests over small (500 buses), medium (4,918 buses), and large scale (11,615 buses) transmission networks were carried out. The methodology consisted in the decomposition of the SCOPF problem into a base case problem and contingency sub-problems using constraint handling rules to solve the complete problem in an iterative fashion. The first stage involved solving an OPF problem using a base case network. The second stage dealt with the modification of the initial base case by updating some of the constraint limits according to the evaluation of potentially relevant contingencies. The entire algorithm resorted to parallel computing tools. The methodology, along with active power re-dispatch through droop control and PV/PQ switching in post-contingency scenarios, successfully solved the tested networks with the set of proposed constraints.