返回
Modeling and Solution of the Large-Scale Security-Constrained Unit Commitment
DOI:10.1109/TPWRS.2013.2272518.png)
摘要
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.
Keyword:
Benders decomposition
Lagrangian relaxation
linear sensitivity factors
mixed-integer programming
security-constrained unit commitment (SCUC)
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.2
论文数:
1.1W
被引数:
5.0W
机构
引用论文
Transition metal-free cross-dehydrogenative coupling acylation of coumarins by the K2S2O8/Aliquat 336 catalytic system: a versatile strategy towards 4-aroylcoumarin derivatives
RSC Advances
IF0

