返回
Transfer-Based Approximate Dynamic Programming for Rolling Security-Constrained Unit Commitment with Uncertainties
DOI:10.23919/PCMP.2023.000140.png)
摘要
En 中文
This paper studies the rolling security-constrained unit commitment (RSCUC) problem with AC power flow and uncertainties. For this NP-hard problem, it is modeled as a Markov decision process, which is then solved by a transfer-based approximate dynamic programming (TADP) algorithm proposed in this paper. Different from traditional approximate dynamic programming (ADP) algorithms, TADP can obtain the commitment states of most units in advance through a decision transfer technique, thus reducing the action space of TADP significantly. Moreover, compared with traditional ADP algorithms, which require to determine the commitment state of each unit, TADP only needs determine the unit with the smallest on-state probability among all on-state units, thus further reducing the action space. The proposed algorithm can also prevent the iterative update of value functions and the reliance on rolling forecast information, which makes more sense in the rolling decision-making process of RSCUC. Finally, numerical simulations are carried out on a modified IEEE 39-bus system and a real 2778-bus system to demonstrate the effectiveness of the proposed algorithm.
Keyword:
Uncertainty
Accuracy
Heuristic algorithms
Scalability
Power system dynamics
Approximation algorithms
Dynamic programming
Rolling security-constrained unit commitment
approximate dynamic programming
decision transfer
probability-based decision priority criterion
uncertainty
期刊
P
IF:
11.9
论文数:
339
被引数:
3.0K
机构
引用论文
Duality-Free Decomposition Based Data-Driven Stochastic Security-Constrained Unit Commitment基于数据驱动的无对偶分解的随机安全约束机组组合
A decomposition method for network-constrained unit commitment with AC power flow constraints
ENERGY
IF9.4
Velocity of the creatine kinase reaction in the neonatal rabbit heart: role of mitochondrial creatine kinase
Biochemistry
IF0

