.png){kind=icon}
返回
Scalable Security-Constrained Unit Commitment Under Uncertainty via Cone Programming Relaxation
.png){kind=icon}
OA
AI
DOI：10.1109/TPWRS.2021.3062203.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper is concerned with the problem of Security-Constrained Unit Commitment (SCUC) which is a long-standing challenge in power system engineering faced by system operators and utility companies on a daily basis. We consider a detailed variant of this problem that suffers from complexities posed by the presence of binary variables, the uncertainty of renewable sources and security constraints. A convex relaxation is formulated which is capable of finding feasible solutions within a provable distance from global optimality. We demonstrate the performance of this approach on detailed and challenging instances of SCUC with IEEE and PEGASE benchmark cases from Matpower . The proposed approach is able to handle over 12,000 binary variables and 2 million continuous variables with significant improvement in solution quality over commonly-used off-the-shelf solvers and other methods of convex relaxation.
Keyword:
Contracts
Uncertainty
Programming
Generators
Stochastic processes
Complexity theory
Benchmark testing
Optimization methods
power generation scheduling
power system security
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.2
论文数:
1.1W
被引数:
5.0W
机构
引用论文
.png){kind=icon}
MATPOWER: Steady-State Operations, Planning, and Analysis Tools for Power Systems Research and EducationMATPOWER: 用于电力系统研究和教育的稳态操作，规划和分析工具
OAAI
OAAI分享收藏分享收藏
查看更多内容