Symmetry issues in mixed integer programming based Unit Commitment

详细信息    查看全文

• 作者：J. Alemany ; F. Magnago ; D. Moitre ; H. Pinto
• 关键词：Identical generators ; Mixed Integer Linear Programming ; Security Constrained Unit Commitment ; Symmetry ; Unit Commitment
• 刊名：International Journal of Electrical Power and Energy Systems
• 出版年：2014
• 出版时间：January, 2014
• 年：2014
• 卷：54
• 期：Complete
• 页码：86-90
• 全文大小：303 K

文摘

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.