Benders Decomposition Applied to Security Constrained Unit Commitment

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.