Symmetry Breaking in MILP Formulations for Unit Commitment Problems
Online Publication Date2015-12-16
Print Publication Date2016-02
Permanent link to this recordhttp://hdl.handle.net/10754/584028
MetadataShow full item record
AbstractThis paper addresses the study of symmetry in Unit Commitment (UC) problems solved by Mixed Integer Linear Programming (MILP) formulations, and using Linear Programming based Branch & Bound MILP solvers. We propose three sets of symmetry breaking constraints for UC MILP formulations exhibiting symmetry, and its impact on three UC MILP models are studied. The case studies involve the solution of 24 instances by three widely used models in the literature, with and without symmetry breaking constraints. The results show that problems that could not be solved to optimality within hours can be solved with a relatively small computational burden if the symmetry breaking constraints are assumed. The proposed symmetry breaking constraints are also compared with the symmetry breaking methods included in two MILP solvers, and the symmetry breaking constraints derived in this work have a distinct advantage over the methods in the MILP solvers.
CitationSymmetry Breaking in MILP Formulations for Unit Commitment Problems 2015 Computers & Chemical Engineering
JournalComputers & Chemical Engineering