On Mixed-Integer Programming Formulations for the Unit Commitment Problem

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

doi:10.1287/ijoc.2019.0944

Title: On Mixed-Integer Programming Formulations for the Unit Commitment Problem

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

DOI:https://doi.org/10.1287/ijoc.2019.0944· OSTI ID:1670724

^[1]; Ostrowski, James ^[2]; Watson, Jean-Paul ^[3]

Sandia National Lab. (SNL-NM), Albuquerque, NM (United States). Discrete Math & Optimization
Univ. of Tennessee, Knoxville, TN (United States). Industrial and Systems Engineering
Sandia National Lab. (SNL-CA), Livermore, CA (United States). Data Science & Cyber Analytics

We provide a comprehensive overview of mixed-integer programming formulations for the unit commitment (UC) problem. UC formulations have been an especially active area of research over the past 12 years due to their practical importance in power grid operations, and this paper serves as a capstone for this line of work. We additionally provide publicly available reference implementations of all formulations examined. We computationally test existing and novel UC formulations on a suite of instances drawn from both academic and real-world data sources. Driven by our computational experience from this and previous work, we contribute some additional formulations for both generator production upper bounds and piecewise linear production costs. By composing new UC formulations using existing components found in the literature and new components introduced in this paper, we demonstrate that performance can be significantly improved—and in the process, we identify a new state-of-the-art UC formulation.

View Accepted Manuscript (DOE)

Cite

Export

Save

Research Organization:: Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Sandia National Lab. (SNL-CA), Livermore, CA (United States)

Sponsoring Organization:: USDOE Office of Electricity (OE); USDOE Office of Science (SC), Advanced Scientific Computing Research (ASCR); USDOE National Nuclear Security Administration (NNSA)

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

OSTI ID:: 1670724

Report Number(s):: SAND-2019-13440J; 681098

Journal Information:: INFORMS Journal on Computing, Vol. 32, Issue 4; ISSN 1091-9856

Publisher:: INFORMSCopyright Statement

Country of Publication:: United States

Language:: English

References (32)

A State Transition MIP Formulation for the Unit Commitment Problem Atakan, Semih; Lulli, Guglielmo; Sen, Suvrajeet IEEE Transactions on Power Systems, Vol. 33, Issue 1 https://doi.org/10.1109/TPWRS.2017.2695964	journal	January 2018
Analyzing valid inequalities of the generation unit commitment problem Hedman, Kory W.; O'Neill, Richard P.; Oren, Shmuel S. 2009 IEEE/PES Power Systems Conference and Exposition (PSCE) https://doi.org/10.1109/PSCE.2009.4840214	conference	March 2009
MIP formulation improvement for large scale security constrained unit commitment with configuration based combined cycle modeling Chen, Yonghong; Wang, Fengyu Electric Power Systems Research, Vol. 148 https://doi.org/10.1016/j.epsr.2017.03.018	journal	July 2017
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 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
The summed start-up costs in a unit commitment problem Brandenberg, René; Huber, Matthias; Silbernagl, Matthias EURO Journal on Computational Optimization, Vol. 5, Issue 1-2 https://doi.org/10.1007/s13675-016-0062-2	journal	March 2016
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
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
The IEEE Reliability Test System: A Proposed 2019 Update Barrows, Clayton; Preston, Eugene; Staid, Andrea IEEE Transactions on Power Systems, Vol. 35, Issue 1 https://doi.org/10.1109/TPWRS.2019.2925557	journal	January 2020
Improving Large Scale Day-Ahead Security Constrained Unit Commitment Performance Chen, Yonghong; Casto, Aaron; Wang, Fengyu IEEE Transactions on Power Systems, Vol. 31, Issue 6 https://doi.org/10.1109/TPWRS.2016.2530811	journal	November 2016
Accelerating NCUC Via Binary Variable-Based Locally Ideal Formulation and Dynamic Global Cuts Wu, Lei IEEE Transactions on Power Systems, Vol. 31, Issue 5 https://doi.org/10.1109/TPWRS.2015.2502594	journal	September 2016
Incorporating Fuel Constraints and Electricity Spot Prices into the Stochastic Unit Commitment Problem Takriti, Samer; Krasenbrink, Benedikt; Wu, Lilian S. -Y. Operations Research, Vol. 48, Issue 2 https://doi.org/10.1287/opre.48.2.268.12379	journal	April 2000
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
Pyomo — Optimization Modeling in Python Hart, William E.; Laird, Carl D.; Watson, Jean-Paul Springer Optimization and Its Applications https://doi.org/10.1007/978-3-319-58821-6	book	January 2017
Improving Accuracy and Efficiency of Start-Up Cost Formulations in MIP Unit Commitment by Modeling Power Plant Temperatures Silbernagl, Matthias; Huber, Matthias; Brandenberg, Rene IEEE Transactions on Power Systems, Vol. 31, Issue 4 https://doi.org/10.1109/TPWRS.2015.2450776	journal	July 2016
A Convex Primal Formulation for Convex Hull Pricing Hua, Bowen; Baldick, Ross IEEE Transactions on Power Systems, Vol. 32, Issue 5 https://doi.org/10.1109/TPWRS.2016.2637718	journal	September 2017
Stochastic Lagrangian Relaxation Applied to Power Scheduling in a Hydro-Thermal System under Uncertainty Nowak, Matthias P.; Römisch, Werner Annals of Operations Research, Vol. 100, Issue 1/4, p. 251-272 https://doi.org/10.1023/A:1019248506301	journal	January 2000
Locally ideal formulations for piecewise linear functions with indicator variables Sridhar, Srikrishna; Linderoth, Jeff; Luedtke, James Operations Research Letters, Vol. 41, Issue 6 https://doi.org/10.1016/j.orl.2013.08.010	journal	November 2013
The Unit Commitment Problem With AC Optimal Power Flow Constraints Castillo, Anya; Laird, Carl; Silva-Monroy, Cesar A. IEEE Transactions on Power Systems, Vol. 31, Issue 6 https://doi.org/10.1109/TPWRS.2015.2511010	journal	November 2016
A novel projected two-binary-variable formulation for unit commitment in power systems Yang, Linfeng; Zhang, Chen; Jian, Jinbao Applied Energy, Vol. 187 https://doi.org/10.1016/j.apenergy.2016.11.096	journal	February 2017
Exploiting Identical Generators in Unit Commitment Knueven, Ben; Ostrowski, Jim; Watson, Jean-Paul IEEE Transactions on Power Systems, Vol. 33, Issue 4 https://doi.org/10.1109/TPWRS.2017.2783850	journal	July 2018
An Application of Mixed-Integer Programming Duality to Scheduling Thermal Generating Systems Muckstadt, John; Wilson, Richard IEEE Transactions on Power Apparatus and Systems, Vol. PAS-87, Issue 12 https://doi.org/10.1109/TPAS.1968.292156	journal	December 1968
The Ramping Polytope and Cut Generation for the Unit Commitment Problem Knueven, Ben; Ostrowski, Jim; Wang, Jianhui INFORMS Journal on Computing, Vol. 30, Issue 4 https://doi.org/10.1287/ijoc.2017.0802	journal	November 2018
Optimal Self-Scheduling of a Thermal Producer in Short-Term Electricity Markets by MILP Simoglou, Christos K.; Biskas, Pandelis N.; Bakirtzis, Anastasios G. IEEE Transactions on Power Systems, Vol. 25, Issue 4 https://doi.org/10.1109/TPWRS.2010.2050011	journal	November 2010
Optimal response of a thermal unit to an electricity spot market Arroyo, J. M.; Conejo, A. J. IEEE Transactions on Power Systems, Vol. 15, Issue 3 https://doi.org/10.1109/59.871739	journal	January 2000
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
Polynomial time algorithms and extended formulations for unit commitment problems Guan, Yongpei; Pan, Kai; Zhou, Kezhuo IISE Transactions, Vol. 50, Issue 8 https://doi.org/10.1080/24725854.2017.1397303	journal	January 2018
Pyomo: modeling and solving mathematical programs in Python Hart, William E.; Watson, Jean-Paul; Woodruff, David L. Mathematical Programming Computation, Vol. 3, Issue 3 https://doi.org/10.1007/s12532-011-0026-8	journal	August 2011
Tight and Compact MILP Formulation of Start-Up and Shut-Down Ramping in Unit Commitment Morales-Espana, German; Latorre, Jesus M.; Ramos, Andres IEEE Transactions on Power Systems, Vol. 28, Issue 2 https://doi.org/10.1109/TPWRS.2012.2222938	journal	May 2013
Tight MIP formulations for bounded up/down times and interval-dependent start-ups Queyranne, Maurice; Wolsey, Laurence A. Mathematical Programming, Vol. 164, Issue 1-2 https://doi.org/10.1007/s10107-016-1079-2	journal	October 2016
A polyhedral study of production ramping Damcı-Kurt, Pelin; Küçükyavuz, Simge; Rajan, Deepak Mathematical Programming, Vol. 158, Issue 1-2 https://doi.org/10.1007/s10107-015-0919-9	journal	June 2015
Integer Programming Approach to the Problem of Optimal Unit Commitment with Probabilistic Reserve Determination Dillon, T. S.; Edwin, K. W.; Kochs, H. -D. IEEE Transactions on Power Apparatus and Systems, Vol. PAS-97, Issue 6 https://doi.org/10.1109/TPAS.1978.354719	journal	November 1978

Cited By (2)

The impacts of convex piecewise linear cost formulations on AC optimal power flow Coffrin, Carleton; Knueven, Bernard; Holzer, Jesse Electric Power Systems Research, Vol. 199 https://doi.org/10.1016/j.epsr.2021.107191	journal	October 2021
A New Affinely Adjustable Robust Model for Security Constrained Unit Commitment under Uncertainty Sierra-Aguilar, Juan Esteban; Marín-Cano, Cristian Camilo; López-Lezama, Jesús M. Applied Sciences, Vol. 11, Issue 9 https://doi.org/10.3390/app11093987	journal	April 2021

Similar Records

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:1670724

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

A Novel Matching Formulation for Startup Costs in Unit Commitment

Journal Article · Tue Sep 18 00:00:00 EDT 2018 · Optimization Online Repository · OSTI ID:1670724

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

A novel matching formulation for startup costs in unit commitment

Journal Article · Mon Feb 24 00:00:00 EST 2020 · Mathematical Programming Computation · OSTI ID:1670724

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

Related Subjects

97 MATHEMATICS AND COMPUTING

Title: On Mixed-Integer Programming Formulations for the Unit Commitment Problem

Citation Formats

References (32)

Cited By (2)

Similar Records

Related Subjects