Descomposición de Benders Aplicada al Predespacho con Restricciones de Red (Benders Decomposition applied to Security Constrained Unit Commitment)

Juan M. Alemany (jalmeany@ing.unrc.edu.ar), Fernando Magnago (fmagnago@ing.unrc.edu.ar), Diego Moitre (dmoitre@ing.unrc.edu.ar)


Universidad Nacional de Rio Cuarto
This paper appears in: Revista IEEE América Latina

Publication Date: Feb. 2013
Volume: 11,   Issue: 1 
ISSN: 1548-0992


Abstract:
Security Constrained Unit Commitment is a large scale optimization problem of fundamental application in modern power system operation control centers. Benders decomposition is one of the most applied methodologies on the Security Constrained Unit Commitment Problem. One of the related drawbacks with this methodology is its oscilating behaivior wich in turns affects the convergence of the algorithm. In this work several options to improve the convergence of the Benders algorithm are presented

Index Terms:
Benders Decomposition, Security Constrained Unit Commitment, Short Term Thermal Scheduling   


Documents that cite this document
This function is not implemented yet.


[PDF Full-Text (273)]