Show simple item record

dc.contributor.authorLima, Ricardo
dc.contributor.authorNovais, Augusto Q.
dc.date.accessioned2015-12-17T11:55:56Z
dc.date.available2015-12-17T11:55:56Z
dc.date.issued2015-12-16
dc.identifier.citationSymmetry Breaking in MILP Formulations for Unit Commitment Problems 2015 Computers & Chemical Engineering
dc.identifier.issn00981354
dc.identifier.doi10.1016/j.compchemeng.2015.11.004
dc.identifier.urihttp://hdl.handle.net/10754/584028
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.
dc.language.isoen
dc.publisherElsevier BV
dc.relation.urlhttp://linkinghub.elsevier.com/retrieve/pii/S0098135415003622
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.004
dc.subjectScheduling
dc.subjectSymmetry Breaking
dc.subjectMILP
dc.subjectUnit Commitment
dc.titleSymmetry Breaking in MILP Formulations for Unit Commitment Problems
dc.typeArticle
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
dc.identifier.journalComputers & Chemical Engineering
dc.eprint.versionPost-print
dc.contributor.institutionCEG-IST, Instituto Superior Técnico, Universidade de Lisboa, Av. Rovisco Pais, 1049-001 Lisboa, Portugal
dc.contributor.affiliationKing Abdullah University of Science and Technology (KAUST)
kaust.personLima, Ricardo
refterms.dateFOA2017-12-11T00:00:00Z
dc.date.published-online2015-12-16
dc.date.published-print2016-02


Files in this item

Thumbnail
Name:
1-s2.0-S0098135415003622-main.pdf
Size:
706.6Kb
Format:
PDF
Description:
Accepted Manuscript

This item appears in the following Collection(s)

Show simple item record