• DocumentCode
    25034
  • Title

    Benders Decomposition applied to Security Constrained Unit Commitment

  • Author

    Alemany, J. ; Moitre, D. ; Magnago, F.

  • Author_Institution
    Univ. Nac. de Rio Cuarto (UNRC), Cordoba, Argentina
  • Volume
    11
  • Issue
    1
  • fYear
    2013
  • fDate
    Feb. 2013
  • Firstpage
    421
  • Lastpage
    425
  • 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.
  • Keywords
    decomposition; optimisation; power generation control; power generation dispatch; power generation scheduling; power system security; bender decomposition algprithm; large scale optimization problem; modern power system operation control center; security constrained unit commitment problem; Acceleration; Computational modeling; Optimization; Power systems; Security; Silicon; Vectors; Benders Decomposition; Security Constrained Unit Commitment; Short Term Thermal Scheduling;
  • fLanguage
    English
  • Journal_Title
    Latin America Transactions, IEEE (Revista IEEE America Latina)
  • Publisher
    ieee
  • ISSN
    1548-0992
  • Type

    jour

  • DOI
    10.1109/TLA.2013.6502840
  • Filename
    6502840