Exploiting Identical Generators in Unit Commitment

Knueven, Ben; Ostrowski, Jim; Watson, Jean -Paul

doi:10.1109/TPWRS.2017.2783850

Title: Exploiting Identical Generators in Unit Commitment

Journal Article · Thu Dec 14 00:00:00 EST 2017 · IEEE Transactions on Power Systems

DOI:https://doi.org/10.1109/TPWRS.2017.2783850· OSTI ID:1421648

Knueven, Ben ^[1]; Ostrowski, Jim ^[1]; Watson, Jean -Paul ^[2]

Univ. of Tennessee, Knoxville, TN (United States)
Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)

Here, we present sufficient conditions under which thermal generators can be aggregated in mixed-integer linear programming (MILP) formulations of the unit commitment (UC) problem, while maintaining feasibility and optimality for the original disaggregated problem. Aggregating thermal generators with identical characteristics (e.g., minimum/maximum power output, minimum up/down-time, and cost curves) into a single unit reduces redundancy in the search space induced by both exact symmetry (permutations of generator schedules) and certain classes of mutually non-dominated solutions. We study the impact of aggregation on two large-scale UC instances, one from the academic literature and another based on real-world operator data. Our computational tests demonstrate that when present, identical generators can negatively affect the performance of modern MILP solvers on UC formulations. Further, we show that our reformation of the UC MILP through aggregation is an effective method for mitigating this source of computational difficulty.

View Accepted Manuscript (DOE)

Cite

Export

Save

Research Organization:: Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Univ. of Tennessee, Knoxville, TN (United States)

Sponsoring Organization:: USDOE Office of Science (SC), Workforce Development for Teachers and Scientists (WDTS); USDOE Office of Science (SC), Advanced Scientific Computing Research (ASCR)

Grant/Contract Number:: AC04-94AL85000; SC0018175

OSTI ID:: 1421648

Alternate ID(s):: OSTI ID: 2339861

Report Number(s):: SAND-2018-0031J; 659726

Journal Information:: IEEE Transactions on Power Systems, Vol. 33, Issue 4; ISSN 0885-8950

Publisher:: IEEECopyright Statement

Country of Publication:: United States

Language:: English

Citation Metrics:

Cited by: 12 works

Citation information provided by
Web of Science

References (23)

Tight polyhedral approximation for mixed-integer linear programming unit commitment formulations Jabr, R. A. IET Generation, Transmission & Distribution, Vol. 6, Issue 11 https://doi.org/10.1049/iet-gtd.2012.0218	journal	November 2012
Tighter Approximated MILP Formulations for Unit Commitment Problems Frangioni, A.; Gentile, C.; Lacalandra, F. IEEE Transactions on Power Systems, Vol. 24, Issue 1 https://doi.org/10.1109/TPWRS.2008.2004744	journal	February 2009
A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes Frangioni, A.; Gentile, C. Operations Research Letters, Vol. 37, Issue 3 https://doi.org/10.1016/j.orl.2009.02.003	journal	May 2009
Solving unit commitment problems with general ramp constraints Frangioni, Antonio; Gentile, Claudio; Lacalandra, Fabrizio International Journal of Electrical Power & Energy Systems, Vol. 30, Issue 5 https://doi.org/10.1016/j.ijepes.2007.10.003	journal	June 2008
Large-scale decentralized unit commitment Feizollahi, Mohammad Javad; Costley, Mitch; Ahmed, Shabbir International Journal of Electrical Power & Energy Systems, Vol. 73 https://doi.org/10.1016/j.ijepes.2015.04.009	journal	December 2015
Projected mixed integer programming formulations for unit commitment problem Yang, Linfeng; Jian, Jinbao; Wang, Yuanyuan International Journal of Electrical Power & Energy Systems, Vol. 68 https://doi.org/10.1016/j.ijepes.2014.12.054	journal	June 2015
Tight Relaxation Method for Unit Commitment Problem Using Reformulation and Lift-and-Project Yang, Linfeng; Jian, Jinbao; Zhu, Yunan IEEE Transactions on Power Systems, Vol. 30, Issue 1 https://doi.org/10.1109/TPWRS.2014.2326920	journal	January 2015
Symmetry breaking in MILP formulations for Unit Commitment problems Lima, Ricardo M.; Novais, Augusto Q. Computers & Chemical Engineering, Vol. 85 https://doi.org/10.1016/j.compchemeng.2015.11.004	journal	February 2016
Toward scalable stochastic unit commitment: Part 2: solver configuration and performance assessment Cheung, Kwok; Gade, Dinakar; Silva-Monroy, César Energy Systems, Vol. 6, Issue 3 https://doi.org/10.1007/s12667-015-0148-6	journal	April 2015
Orbital branching Ostrowski, James; Linderoth, Jeff; Rossi, Fabrizio Mathematical Programming, Vol. 126, Issue 1 https://doi.org/10.1007/s10107-009-0273-x	journal	March 2009
Stochastic Joint Optimization of Wind Generation and Pumped-Storage Units in an Electricity Market Garcia-Gonzalez, Javier; de la Muela, RocÍo Moraga Ruiz; Santos, Luz Matres IEEE Transactions on Power Systems, Vol. 23, Issue 2 https://doi.org/10.1109/TPWRS.2008.919430	journal	May 2008
Impact of variable generation in generation resource planning models Shortt, Aonghus; O'Malley, Mark IEEE PES General Meeting https://doi.org/10.1109/PES.2010.5589461	conference	July 2010
Impact of unit commitment constraints on generation expansion planning with renewables Palmintier, Bryan; Webster, Mort 2011 IEEE Power & Energy Society General Meeting, 2011 IEEE Power and Energy Society General Meeting https://doi.org/10.1109/PES.2011.6038963	conference	July 2011
Lagrangian heuristics based on disaggregated bundle methods for hydrothermal unit commitment Borghetti, A.; Frangioni, A.; Lacalandra, F. IEEE Transactions on Power Systems, Vol. 18, Issue 1 https://doi.org/10.1109/TPWRS.2002.807114	journal	February 2003
Tight Mixed Integer Linear Programming Formulations for the Unit Commitment Problem Ostrowski, James; Anjos, Miguel F.; Vannelli, Anthony IEEE Transactions on Power Systems, Vol. 27, Issue 1 https://doi.org/10.1109/TPWRS.2011.2162008	journal	February 2012
A tight MIP formulation of the unit commitment problem with start-up and shut-down constraints Gentile, C.; Morales-España, G.; Ramos, A. EURO Journal on Computational Optimization, Vol. 5, Issue 1-2 https://doi.org/10.1007/s13675-016-0066-y	journal	April 2016
Perspective cuts for a class of convex 0–1 mixed integer programs Frangioni, A.; Gentile, C. Mathematical Programming, Vol. 106, Issue 2 https://doi.org/10.1007/s10107-005-0594-3	journal	July 2005
Tight and Compact MILP Formulation for the Thermal Unit Commitment Problem IEEE Transactions on Power Systems, Vol. 28, Issue 4 https://doi.org/10.1109/TPWRS.2013.2251373	journal	November 2013
Tight MIP formulations of the power-based unit commitment problem Morales-España, Germán; Gentile, Claudio; Ramos, Andres OR Spectrum, Vol. 37, Issue 4 https://doi.org/10.1007/s00291-015-0400-4	journal	May 2015
Modified orbital branching for structured symmetry with an application to unit commitment Ostrowski, James; Anjos, Miguel F.; Vannelli, Anthony Mathematical Programming, Vol. 150, Issue 1 https://doi.org/10.1007/s10107-014-0812-y	journal	September 2014
Min-up/min-down polytopes Lee, Jon; Leung, Janny; Margot, François Discrete Optimization, Vol. 1, Issue 1 https://doi.org/10.1016/j.disopt.2003.12.001	journal	June 2004
A Computationally Efficient Mixed-Integer Linear Formulation for the Thermal Unit Commitment Problem Carrion, M.; Arroyo, J. M. IEEE Transactions on Power Systems, Vol. 21, Issue 3 https://doi.org/10.1109/TPWRS.2006.876672	journal	August 2006
A genetic algorithm solution to the unit commitment problem Kazarlis, S. A.; Bakirtzis, A. G.; Petridis, V. IEEE Transactions on Power Systems, Vol. 11, Issue 1 https://doi.org/10.1109/59.485989	journal	January 1996

Cited By (3)

Sub-Symmetry-Breaking Inequalities for ILP with Structured Symmetry Bendotti, Pascale; Fouilhoux, Pierre; Rottner, Cécile Integer Programming and Combinatorial Optimization https://doi.org/10.1007/978-3-030-17953-3_5	book	January 2019
Orbitopal fixing for the full (sub-)orbitope and application to the Unit Commitment Problem Bendotti, Pascale; Fouilhoux, Pierre; Rottner, Cécile Mathematical Programming https://doi.org/10.1007/s10107-019-01457-1	journal	December 2019
Orbitopal fixing for the full (sub)-orbitope and application to the Unit Commitment Problem Bendotti, Pascale; Fouilhoux, Pierre; Rottner, Cécile arXiv https://doi.org/10.48550/arxiv.1710.10189	preprint	January 2017

Similar Records

Solving the Unit Commitment Problem: Polyhedral Theory, Symmetry, and Power Flow

Conference · Tue Jan 17 00:00:00 EST 2023 · OSTI ID:1421648

Knueven, Bernard

On Mixed-Integer Programming Formulations for the Unit Commitment Problem

Journal Article · Thu Jun 25 00:00:00 EDT 2020 · INFORMS Journal on Computing · OSTI ID:1421648

Knueven, Bernard; Ostrowski, James; Watson, Jean-Paul

On Mixed Integer Programming Formulations for the Unit Commitment Problem

Journal Article · Sun Nov 18 00:00:00 EST 2018 · Optimization Online Repository · OSTI ID:1421648

Knueven, Bernard; Ostrowski, James; Watson, Jean-Paul

Related Subjects

97 MATHEMATICS AND COMPUTING
mixed-integer linear programming (MILP)
unit commitment (UC)
optimization
symmetry

Title: Exploiting Identical Generators in Unit Commitment

Citation Formats

References (23)

Cited By (3)

Similar Records

Related Subjects