Symmetry Breaking in MILP Formulations for Unit Commitment Problems
Name:
1-s2.0-S0098135415003622-main.pdf
Size:
706.6Kb
Format:
PDF
Description:
Accepted Manuscript
Type
ArticleAuthors
Lima, Ricardo
Novais, Augusto Q.
Date
2015-12-16Online Publication Date
2015-12-16Print Publication Date
2016-02Permanent link to this record
http://hdl.handle.net/10754/584028
Metadata
Show full item recordAbstract
This 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.Citation
Symmetry Breaking in MILP Formulations for Unit Commitment Problems 2015 Computers & Chemical EngineeringPublisher
Elsevier BVJournal
Computers & Chemical EngineeringAdditional Links
http://linkinghub.elsevier.com/retrieve/pii/S0098135415003622ae974a485f413a2113503eed53cd6c53
10.1016/j.compchemeng.2015.11.004