A Fast Decomposition Method to Solve a Security-Constrained Optimal Power Flow (SCOPF) Problem Through Constraint Handling
Autor: | Diego Rodriguez-Medina, Sergio Rivera, Dario Arango-Angarita, Tomas Valencia-Zuluaga, Juan M. Gers, Daniel Agudelo-Martinez, Camilo Acosta-Urrego |
---|---|
Rok vydání: | 2021 |
Předmět: |
Security-constrained optimal power flow (SCOPF)
Constraint Handling Rules Mathematical optimization parallel processing General Computer Science Computer science 020209 energy Computation 020208 electrical & electronic engineering General Engineering real-time optimal power flow (OPF) 02 engineering and technology constraint handling AC power matpower Constraint (information theory) interior point method 0202 electrical engineering electronic engineering information engineering Decomposition (computer science) General Materials Science Voltage droop lcsh:Electrical engineering. Electronics. Nuclear engineering Decomposition method (constraint satisfaction) lcsh:TK1-9971 Interior point method |
Zdroj: | IEEE Access, Vol 9, Pp 52812-52824 (2021) |
ISSN: | 2169-3536 |
Popis: | 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. |
Databáze: | OpenAIRE |
Externí odkaz: |