Symmetry Breaking in MILP Formulations for Unit Commitment Problems

Handle URI:
http://hdl.handle.net/10754/584028
Title:
Symmetry Breaking in MILP Formulations for Unit Commitment Problems
Authors:
Lima, Ricardo ( 0000-0002-5735-6089 ) ; Novais, Augusto Q.
Abstract:
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.
KAUST Department:
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
Citation:
Symmetry Breaking in MILP Formulations for Unit Commitment Problems 2015 Computers & Chemical Engineering
Publisher:
Elsevier BV
Journal:
Computers & Chemical Engineering
Issue Date:
11-Dec-2015
DOI:
10.1016/j.compchemeng.2015.11.004
Type:
Article
ISSN:
00981354
Additional Links:
http://linkinghub.elsevier.com/retrieve/pii/S0098135415003622
Appears in Collections:
Articles; Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division

Full metadata record

DC FieldValue Language
dc.contributor.authorLima, Ricardoen
dc.contributor.authorNovais, Augusto Q.en
dc.date.accessioned2015-12-17T11:55:56Zen
dc.date.available2015-12-17T11:55:56Zen
dc.date.issued2015-12-11en
dc.identifier.citationSymmetry Breaking in MILP Formulations for Unit Commitment Problems 2015 Computers & Chemical Engineeringen
dc.identifier.issn00981354en
dc.identifier.doi10.1016/j.compchemeng.2015.11.004en
dc.identifier.urihttp://hdl.handle.net/10754/584028en
dc.description.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.en
dc.language.isoenen
dc.publisherElsevier BVen
dc.relation.urlhttp://linkinghub.elsevier.com/retrieve/pii/S0098135415003622en
dc.rightsNOTICE: this is the author’s version of a work that was accepted for publication in Computers & Chemical Engineering. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Computers & Chemical Engineering, 11 December 2015. DOI: 10.1016/j.compchemeng.2015.11.004en
dc.subjectSchedulingen
dc.subjectSymmetry Breakingen
dc.subjectMILPen
dc.subjectUnit Commitmenten
dc.titleSymmetry Breaking in MILP Formulations for Unit Commitment Problemsen
dc.typeArticleen
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Divisionen
dc.identifier.journalComputers & Chemical Engineeringen
dc.eprint.versionPost-printen
dc.contributor.institutionCEG-IST, Instituto Superior Técnico, Universidade de Lisboa, Av. Rovisco Pais, 1049-001 Lisboa, Portugalen
dc.contributor.affiliationKing Abdullah University of Science and Technology (KAUST)en
kaust.authorLima, Ricardoen
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.