.png){kind=icon}
返回
Symmetry issues in mixed integer programming based Unit Commitment
.png){kind=icon}
OA
AI
DOI：10.1016/j.ijepes.2013.06.034.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A mixed integer linear problem is called symmetric if the variables can be permuted without changing the structure of the problem. Generally, these problems are difficult to solve due to the redundant solutions which populate the enumeration tree. In Unit Commitment problems the symmetry is present when identical generators have to be scheduled. This article presents a way to reduce the computational burden of the Branch and Cut algorithm by adding appropriate inequalities into the mixed-linear formulation of the Unit Commitment problem. In the examples considered, this approach leads to a substantial reduction in computational effort, without affecting the objective value. (C) 2013 Elsevier Ltd. All rights reserved.
Keyword:
Identical generators
Mixed Integer Linear Programming
Security Constrained Unit Commitment
Symmetry
Unit Commitment
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
I
IF:
5
论文数:
1.1W
被引数:
3.1W
机构
暂无机构信息
引用论文
.png){kind=icon}
查看更多内容