Exploiting the Use of DC SCOPF Approximation to Improve Iterative AC SCOPF Algorithms
This paper focuses on improving the solution techniques for the AC SCOPF problem of active power dispatch by using the DC SCOPF approximation within the SCOPF algorithm. Our approach brings two benefits compared with benchmark SCOPF algorithms: it speeds up the solution of an iterative AC SCOPF algo...
| Autores: | , , , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2012 |
| País: | España |
| Institución: | Universidad de Sevilla (US) |
| Repositorio: | idUS. Depósito de Investigación de la Universidad de Sevilla |
| OAI Identifier: | oai:idus.us.es:11441/147284 |
| Acceso en línea: | https://hdl.handle.net/11441/147284 https://doi.org/10.1109/TPWRS.2012.2186469 |
| Access Level: | acceso abierto |
| Palabra clave: | Contingency filtering DC approximation Mixed-integer linear programming (MILP) Nonlinear programming Security-constrained optimal power flow (SCOPF) |
| Sumario: | This paper focuses on improving the solution techniques for the AC SCOPF problem of active power dispatch by using the DC SCOPF approximation within the SCOPF algorithm. Our approach brings two benefits compared with benchmark SCOPF algorithms: it speeds up the solution of an iterative AC SCOPF algorithm thanks to a more efficient identification of binding contingencies and allows improving the objective by an appropriate choice of a limited number of corrective actions for each contingency. The proposed approach is illustrated on five test systems of 60, 118, 300, 1203, and 2746 buses. |
|---|