.png){kind=icon}
返回
Multistage Stochastic Unit Commitment Using Stochastic Dual Dynamic Integer Programming
.png){kind=icon}
OA
AI
DOI：10.1109/TPWRS.2018.2880996.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Unit commitment (UC) is a key operational problem in power systems for the optimal schedule of daily generation commitment. Incorporating uncertainty in this already difficult mixedinteger optimization problem introduces significant computational challenges. Most existing stochastic UC models consider either a two-stage decision structure, where the commitment schedule for the entire planning horizon is decided before the uncertainty is realized, or a multistage stochastic programming model with relatively small scenario trees to ensure tractability. We propose a new type of decomposition algorithm, based on the recently proposed framework of stochastic dual dynamic integer programming (SDDiP), to solve the multistage stochastic unit commitment (MSUC) problem. We propose a variety of computational enhancements to SDDiP, and conduct systematic and extensive computational experiments to demonstrate that the proposed method is able to handle elaborate stochastic processes and can solve MSUCs with a huge number of scenarios that are impossible to handle by existing methods.
Keyword:
Unit commitment
multistage stochastic integer programming
stochastic dual dynamic integer programming
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.2
论文数:
1.1W
被引数:
5.7W
机构
引用论文
.png){kind=icon}
Tight and Compact MILP Formulation for the Thermal Unit Commitment Problem用于热单元承诺问题的紧密而紧凑的MILP公式
PREAI
分享收藏
查看更多内容