Modeling and solution of the large-scale security-constrained unit commitment

Yong Fu, Zuyi Li, Lei Wu

Research output: Contribution to journalArticlepeer-review

119 Scopus citations

Abstract

Security-constrained unit commitment (SCUC), as one of key components in power system operation, is being widely applied in vertically integrated utilities and restructured power systems. The efficient solution framework is to implement iterations between a master problem (unit commitment) and subproblems (network security evaluations). In industrial applications, both Lagrangian relaxation and mixed-integer programming are commonly applied for the unit commitment problem, and both linear sensitivity factor and Benders cut methods are used to generate additional constraints in the phase of network security evaluations. This paper evaluates capabilities and performances of each algorithm through technical discussion and numerical testing. Special topics on the large-scale SCUC engine development are also discussed in this paper, such as input data screening, inactive constrains elimination, contingency management, infeasibility handling, parallel computing, and model simplification. This paper will benefit academic researchers, software developers, and system operators when they design, develop and assess effective models and algorithms for solving large-scale SCUC problems.

Original languageEnglish
Pages (from-to)3524-3533
Number of pages10
JournalIEEE Transactions on Power Systems
Volume28
Issue number4
DOIs
StatePublished - 2013

Keywords

  • Benders decomposition
  • Lagrangian relaxation
  • Linear sensitivity factors
  • Mixed-integer programming
  • Security-constrained unit commitment (SCUC)

Fingerprint

Dive into the research topics of 'Modeling and solution of the large-scale security-constrained unit commitment'. Together they form a unique fingerprint.

Cite this