.png){kind=icon}
返回
Temporal Decomposition for Security-Constrained Unit Commitment
.png){kind=icon}
PRE
AI
DOI：10.1109/TPWRS.2019.2947410.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper proposes a temporal decomposition strategy to reduce the computation time of security-constrained unit commitment (SCUC). The novelty of this paper is twofold. The scheduling horizon is decomposed into multiple subhorizons. The concept of coupling intervals is introduced, and a set of auxiliary counting variables and logical expressions along with their equivalent linear models are formulated to handle intertemporal ramp constraints and minimum on/off times between consecutive subhorizons. An accelerated analytical target cascading (A-ATC) algorithm is developed to coordinate SCUC subproblems and find the optimal solution for the whole operation horizon in a distributed manner. An initialization strategy is presented to enhance the convergence performance of A-ATC. The proposed algorithm is tested on four test systems.
Keyword:
Couplings
Processor scheduling
Indexes
Time factors
Acceleration
Distributed algorithms
Economics
Temporal decomposition
security-constrained unit commitment
accelerated analytical target cascading
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.2
论文数:
1.1W
被引数:
5.0W
机构
引用论文
Multi-Area Energy and Reserve Dispatch Under Wind Uncertainty and Equipment Failures风力不确定性和设备故障下的多区域能量和储备调度
OAAI
OAAI分享收藏Brønsted acid-free controlled polymerization of tetrahydrofuran catalyzed by recyclable rare earth triflates in the presence of epoxides.png)
Polymer
PolymerIF0
PREAI
分享收藏A Survey of Distributed Optimization and Control Algorithms for Electric Power Systems电力系统分布式优化与控制算法综述
OAAI
OAAI分享收藏
查看更多内容