.png){kind=icon}
返回
Stochastic optimization of unit commitment: A new decomposition framework
.png){kind=icon}
PRE
AI
DOI：10.1109/59.496196.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper presents a new stochastic decomposition method well-suited to deal with large-scale unit commitment problems. In this approach, random disturbances are modeled as scenario trees. Optimization consists in minimizing the average generation cost over this ''tree-shaped future''. An augmented Lagrangian technique is applied to this problem. At each iteration, nonseparable terms introduced by the augmentation are linearized so as to obtain a decomposition algorithm. This algorithm may he considered as a generalization of price decomposition methods, which are now classical in this field, to the stochastic framework. At each iteration, for each unit, a stochastic dynamic subproblem has to be solved. Prices attached to nodes of the scenario trees are updated by the coordination level. This method has been applied to a daily generation scheduling problem. The use of an augmented Lagrangian technique, provides satisfactory convergence proper ties to the decomposition algorithm. Moreover, numerical simulations show that compared to a classical deterministic optimization with reserve constraints, this new approach achieves substantial savings.
Keyword:
ELECTRICITE
FRANCE
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.2
论文数:
1.1W
被引数:
5.0W
机构
暂无机构信息
引用论文
Optimization of lag time underlies antibiotic tolerance in evolved bacterial populations.png)
Nature
NatureIF0
PREAI
分享收藏
查看更多内容