.png){kind=icon}
返回
High-Performance Computing Based Fully Parallel Security-Constrained Unit Commitment With Dispatchable Transmission Network
.png){kind=icon}
PRE
AI
DOI：10.1109/TPWRS.2018.2876025.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The co-optimization of security-constrained unit commitment and dispatchable transmission network is a large-scale and computationally complex optimization problem that brings big challenges for the traditional centralized and/or master-slave based decomposition approaches. This paper proposes a fully parallel approach to achieve an efficient and fast solution while considering post-contingency corrective actions. In this paper, the original co-optimization problem is decomposed into six major solution modules for unit commitment, optimal power flow, and transmission switching in base case and contingencies, respectively. Moreover, each major solution module is further decomposed by unit, period, dispatchable line, and/or contingency to make the proposed approach favorable in a fully parallel computing environment. The effectiveness and efficiency of the proposed fully parallel approach are justified using numerical cases on a high-performance computing (HPC) platform.
Keyword:
Unit commitment
dispatchable transmission network
high performance computing
power system operation
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.2
论文数:
1.1W
被引数:
5.0W
机构
引用论文
Co-Optimization of Generation Unit Commitment and Transmission Switching With N-1 Reliability具有N-1可靠性的发电单元组合和传输切换的共同优化
OAAI
OAAI分享收藏Optimization of lag time underlies antibiotic tolerance in evolved bacterial populations.png)
Nature
NatureIF0
PREAI
分享收藏分享收藏
查看更多内容