Modeling and Solution of the Large-Scale Security-Constrained Unit Commitment

doi:10.1109/TPWRS.2013.2272518

Return

Modeling and Solution of the Large-Scale Security-Constrained Unit Commitment

2013-11-01

108

PRE

付勇 (Yong Fu) *

Zuyi Li

Lei Wu

DOI：10.1109/TPWRS.2013.2272518

Original

Original request for help

Save

Abstract

En 中文

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.

Keywords:

Benders decomposition

Lagrangian relaxation

linear sensitivity factors

mixed-integer programming

security-constrained unit commitment (SCUC)

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.