TY - JOUR
T1 - Modeling and solution of the large-scale security-constrained unit commitment
AU - Fu, Yong
AU - Li, Zuyi
AU - Wu, Lei
PY - 2013
Y1 - 2013
N2 - 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.
AB - 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.
KW - Benders decomposition
KW - Lagrangian relaxation
KW - Linear sensitivity factors
KW - Mixed-integer programming
KW - Security-constrained unit commitment (SCUC)
UR - http://www.scopus.com/inward/record.url?scp=84886093110&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84886093110&partnerID=8YFLogxK
U2 - 10.1109/TPWRS.2013.2272518
DO - 10.1109/TPWRS.2013.2272518
M3 - Article
AN - SCOPUS:84886093110
SN - 0885-8950
VL - 28
SP - 3524
EP - 3533
JO - IEEE Transactions on Power Systems
JF - IEEE Transactions on Power Systems
IS - 4
ER -