.png){kind=icon}
返回
Data-Driven Screening of Network Constraints for Unit Commitment
.png){kind=icon}
OA
AI
DOI：10.1109/TPWRS.2020.2980212.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The transmission-constrained unit commitment (TC-UC) problem is one of the most relevant problems solved by independent system operators for the daily operation of power systems. Given its computational complexity, this problem is usually not solved to global optimality for real-size power systems. In this paper, we propose a data-driven method that leverages historical information to screen out network constraints in the TC-UC problem. First, past data on demand and renewable generation throughout the network are used to learn the congestion status of transmission lines. Then, we infer the lines that will not become congested for upcoming operating conditions based on such learning and disregard their capacity constraints. This way, we formulate a reduced TC-UC problem that is easier to solve. Numerical results on a medium- and a large-size power system show that the proposed approach outperforms existing ones by significantly reducing the computational time while obtaining solutions that are equal or close to the one obtained with the original TC-UC problem. Furthermore, the purely data-driven method we propose can be seamlessly complemented with a constraint generation procedure to guarantee that the optimal solution to the original TC-UC problem is eventually recovered.
Keyword:
Optimization
Linear programming
Power transmission lines
Security
Two dimensional displays
Computational modeling
Unit commitment
transmission line congestion
machine learning
network reduction
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.2
论文数:
1.1W
被引数:
5.0W
机构
引用论文
.png){kind=icon}
Tight and Compact MILP Formulation of Start-Up and Shut-Down Ramping in Unit Commitment机组投入中启动和关闭斜坡的紧密和紧凑的MILP公式
PREAI
分享收藏
查看更多内容