.png){kind=icon}
返回
Two-stage fully distributed approach for unit commitment with consensus ADMM
.png){kind=icon}
PRE
AI
DOI：10.1016/j.epsr.2019.106180.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper discusses a two-stage fully distributed approach for the unit commitment (UC) problem, which solves the UC of each individual unit. This approach, based on the augmented Lagrangian relaxation method (ALR) and alternating direction method of multipliers (ADMM), consists of two stages: the solution of the single-unit optimization problem and the distributed update of the multiplier. In the first stage, using the proximal term to effectively improve the oscillation phenomenon and the convergence speed of the improved distributed augmented Lagrangian relaxation method (ID-ALR). In the second stage of multiplier updating, using ADMM to solve dual subgradient problem in fully distributed way for obtaining subgradients. In addition, the multiplier is updated with the improved multiplier update strategy. Finally, the subgradients are also used to reduce the constraint violation degree of the UC and enhance the soft constraint ability of the ID-ALR. The simulation results show that the ID-ALR can not only obtain high-quality solutions in reasonable times but also obtain good speedup in a parallel environment. The proposed ID-ALR enables each unit to keep its information secret and achieves a fully distributed solution for UC.
Keyword:
Full distributed
Unit commitment
Proximal term
ADMM
Distributed control
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.2
论文数:
1.1W
被引数:
2.2W
机构
引用论文
Outer Approximation and Outer-Inner Approximation Approaches for Unit Commitment Problem单位组合问题的外部逼近和外部-内部逼近方法
.png){kind=icon}
PREAI
分享收藏Implementation of hybrid harmony search/random search algorithm for single area unit commitment problem混合和声搜索/随机搜索算法在单区域单元承诺问题中的实现
PREAI
分享收藏
查看更多内容