.png){kind=icon}
返回
Security-constrained unit commitment with AC constraints
.png){kind=icon}
PRE
AI
DOI：10.1109/TPWRS.2005.854375.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In a restructured power market, the independent system operator (ISO) executes the security-constrained unit commitment (SCUC) program to plan a secure and economical hourly generation schedule for the day-ahead market. This paper introduces an efficient SCUC approach with ac constraints that obtains the minimum system operating cost while maintaining the security of power systems. The proposed approach applies the Benders decomposition for separating the unit commitment (UC) in the master problem from the network security check in sub-problems. The master problem applies the augmented Lagrangian relaxation (LR) method and dynamic programming (DP) to solve UC. The subproblem checks ac network security constraints for the UC solution to determine whether a converged and secure ac power flow can be obtained. If any network violations arise, corresponding Benders cuts will be formed and added to the master problem for solving the next iteration of UC. The iterative process will continue until ac violations are eliminated and a converged optimal solution is found. In this paper, a six-bus system and the IEEE 118-bus system with 54 units are analyzed to exhibit the effectiveness of the proposed approach.
Keyword:
augmented Lagrangian relaxation
Benders decomposition
network security constraints
restructured power markets
security-constrained unit commitment (SCUC)
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.2
论文数:
1.1W
被引数:
5.4W
机构
暂无机构信息
引用论文
Experiences with mixed integer linear programming based approaches on short-term hydro scheduling
PREAI
分享收藏分享收藏Analysis of the quality, reliability, and popularity of information on strabismus on YouTube.png)
Strabismus
StrabismusIF0
PREAI
分享收藏
查看更多内容