.png){kind=icon}
返回
A Distributionally Robust Optimization Model for Unit Commitment Based on Kullback-Leibler Divergence
.png){kind=icon}
PRE
AI
DOI：10.1109/TPWRS.2018.2797069.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper proposes a new distance-based distributionally robust unit commitment (DB-DRUC) model via Kullback-Leibler (KL) divergence, considering volatile wind power generation. The objective function of the DB-DRUC model is to minimize the expected cost under the worst case wind distributions restricted in an ambiguity set. The ambiguity set is a family of distributions within a fixed distance from a nominal distribution. The distance between two distributions is measured by KL divergence. The DB-DRUC model is a min-max-min programming model; thus, it is intractable to solve. Applying reformulation methods and stochastic programming technologies, we reformulate this min-max-min DB-DRUC model into a one-level model, referred to as the reformulated DB-DRUC (RDB-DRUC) model. Using the generalized Benders decomposition, we then propose a two-level decomposition method and an iterative algorithm to address the RDB-DRUC model. The iterative algorithm for the RDB-DRUC model guarantees global convergence within finite iterations. Case studies are carried out to demonstrate the effectiveness, global optimality, and finite convergence of a proposed solution strategy.
Keyword:
Distributionally robust
generalized Benders decomposition
unit commitment
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.2
论文数:
1.1W
被引数:
5.0W
机构
引用论文
.png){kind=icon}
Adaptive Robust Optimization for the Security Constrained Unit Commitment Problem安全约束机组组合问题的自适应鲁棒优化
OAAI
OAAI分享收藏Distributionally Robust Solution to the Reserve Scheduling Problem With Partial Information of Wind Power含风电部分信息的备用调度问题的分布式鲁棒解
PREAI
分享收藏
查看更多内容