.png){kind=icon}
返回
An improved dynamic programming algorithm for security-constrained unit commitment under spatial-temporal decomposition framework
.png){kind=icon}
OA
AI
DOI：10.1016/j.ijepes.2023.109652.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The security-constrained unit commitment with AC power flow constraints (AC-SCUC) is a typical NP-hard problem, which is difficult to be solved by traditional methods in a reasonable time. In this paper, it is decomposed into a number of tractable subproblems in both spatial and temporal dimensions, and then solved by an improved dynamic programming (IDP) algorithm. Different from traditional dynamic programming (DP) algorithms, which need to enumerate each unit status at each period, we just need to determine the start and end periods of each consecutive status. Such that the state space can be reduced greatly. Moreover, compared with traditional DP algorithms, which acquire the optimal cost of each decision by iteration, IDP directly obtains them through a closed-form solution technique without iteration, and thus has higher computational efficiency. Case studies on various test systems demonstrate the effectiveness of the proposed algorithm.
Keyword:
Spatial -temporal decomposition
Improved dynamic programming
Closed -form solution
Security -constrained unit commitment
AC power flow
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
I
IF:
5
论文数:
1.1W
被引数:
3.5W
机构
引用论文
.png){kind=icon}
Nonconvex Medium-Term Hydropower Scheduling by Stochastic Dual Dynamic Integer Programming基于随机对偶动态整数规划的非凸中期水电调度OAAI
OAAI分享收藏Large-Scale Maintenance and Unit Commitment: A Decentralized Subgradient Approach大规模维护和机组承诺: 一种分散的次梯度方法OAAI
OAAI分享收藏
查看更多内容