.png){kind=icon}
返回
Multi-Cuts Outer Approximation Method for Unit Commitment
.png){kind=icon}
PRE
AI
DOI：10.1109/TPWRS.2016.2584862.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This letter introduces a deterministic global optimization methods for unit commitment (UC) problem based on outer approximation method (OAM). The proposed Multi-cuts OAM (MCs-OAM) decomposes the UC problem into a mixed integer linear programming (MILP) master problem and several nonlinear programming (NLP) subproblems, whereas only one NLP in classic OAM. After elaborately designing the terminating criterion for solving the bigger but tighter MILP master problems, MCs-OAM can obtained higher quality solutions with fewer main iterations and less total CPU times, although solving more NLPs consumes more CPU times than OAM. The numerical results on 42 test systems of up to 200 units show that the MCs-OAM is very promising for large scale UC problems because that it can obtain high-quality solutions in reasonable time.
Keyword:
Mixed integer linear programming
multiple cuts
outer approximation
unit commitment
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.2
论文数:
1.1W
被引数:
5.0W
机构
查看更多机构
引用论文
A Tighter Piecewise Linear Approximation of Quadratic Cost Curves for Unit Commitment Problems单位承诺问题的二次成本曲线的更严格的分段线性逼近
.png){kind=icon}
PREAI
分享收藏Revealing the Chemistry and Morphology of Buried Donor/Acceptor Interfaces in Organic Photovoltaics揭示有机光伏中埋藏的供体/受体界面的化学和形态
PREAI
分享收藏Outer Approximation and Outer-Inner Approximation Approaches for Unit Commitment Problem单位组合问题的外部逼近和外部-内部逼近方法
PREAI
分享收藏