skip to main content
DOE PAGES title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: A novel matching formulation for startup costs in unit commitment

Abstract

We present a novel formulation for startup cost computation in the unit commitment problem (UC). Both our proposed formulation and existing formulations in the literature are placed in a formal, theoretical dominance hierarchy based on their respective linear programming relaxations. Our proposed formulation is tested empirically against existing formulations on large-scale UC instances drawn from real-world data. While requiring more variables than the current state-of-the-art formulation, our proposed formulation requires fewer constraints, and is empirically demonstrated to be as tight as a perfect formulation for startup costs. This tightening can reduce the computational burden in comparison to existing formulations, especially for UC instances with large reserve margins and high penetration levels of renewables.

Authors:
 [1];  [2];  [3]
  1. Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)
  2. Univ. of Tennessee, Knoxville, TN (United States)
  3. Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)
Publication Date:
Research Org.:
Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Sandia National Lab. (SNL-CA), Livermore, CA (United States)
Sponsoring Org.:
USDOE National Nuclear Security Administration (NNSA)
OSTI Identifier:
1607497
Report Number(s):
SAND2020-0327J
Journal ID: ISSN 1867-2949; 681741
Grant/Contract Number:  
AC04-94AL85000
Resource Type:
Accepted Manuscript
Journal Name:
Mathematical Programming Computation
Additional Journal Information:
Journal Name: Mathematical Programming Computation; Journal ID: ISSN 1867-2949
Publisher:
Springer
Country of Publication:
United States
Language:
English

Citation Formats

Knueven, Bernard, Ostrowski, James, and Watson, Jean-Paul. A novel matching formulation for startup costs in unit commitment. United States: N. p., 2020. Web. doi:10.1007/s12532-020-00176-5.
Knueven, Bernard, Ostrowski, James, & Watson, Jean-Paul. A novel matching formulation for startup costs in unit commitment. United States. doi:https://doi.org/10.1007/s12532-020-00176-5
Knueven, Bernard, Ostrowski, James, and Watson, Jean-Paul. Mon . "A novel matching formulation for startup costs in unit commitment". United States. doi:https://doi.org/10.1007/s12532-020-00176-5. https://www.osti.gov/servlets/purl/1607497.
@article{osti_1607497,
title = {A novel matching formulation for startup costs in unit commitment},
author = {Knueven, Bernard and Ostrowski, James and Watson, Jean-Paul},
abstractNote = {We present a novel formulation for startup cost computation in the unit commitment problem (UC). Both our proposed formulation and existing formulations in the literature are placed in a formal, theoretical dominance hierarchy based on their respective linear programming relaxations. Our proposed formulation is tested empirically against existing formulations on large-scale UC instances drawn from real-world data. While requiring more variables than the current state-of-the-art formulation, our proposed formulation requires fewer constraints, and is empirically demonstrated to be as tight as a perfect formulation for startup costs. This tightening can reduce the computational burden in comparison to existing formulations, especially for UC instances with large reserve margins and high penetration levels of renewables.},
doi = {10.1007/s12532-020-00176-5},
journal = {Mathematical Programming Computation},
number = ,
volume = ,
place = {United States},
year = {2020},
month = {2}
}

Journal Article:
Free Publicly Available Full Text
Publisher's Version of Record

Save / Share:

Works referenced in this record:

A Computationally Efficient Mixed-Integer Linear Formulation for the Thermal Unit Commitment Problem
journal, August 2006


Obtaining lower bounds from the progressive hedging algorithm for stochastic mixed-integer programs
journal, April 2016

  • Gade, Dinakar; Hackebeil, Gabriel; Ryan, Sarah M.
  • Mathematical Programming, Vol. 157, Issue 1
  • DOI: 10.1007/s10107-016-1000-z

Large-scale decentralized unit commitment
journal, December 2015

  • Feizollahi, Mohammad Javad; Costley, Mitch; Ahmed, Shabbir
  • International Journal of Electrical Power & Energy Systems, Vol. 73
  • DOI: 10.1016/j.ijepes.2015.04.009

An Application of Mixed-Integer Programming Duality to Scheduling Thermal Generating Systems
journal, December 1968

  • Muckstadt, John; Wilson, Richard
  • IEEE Transactions on Power Apparatus and Systems, Vol. PAS-87, Issue 12
  • DOI: 10.1109/TPAS.1968.292156

Individual Comparisons by Ranking Methods
journal, December 1945

  • Wilcoxon, Frank
  • Biometrics Bulletin, Vol. 1, Issue 6
  • DOI: 10.2307/3001968

Tight and Compact MILP Formulation for the Thermal Unit Commitment Problem
journal, November 2013

  • Morales-Espana, ; Latorre, Jesus M.; Ramos, Andres
  • IEEE Transactions on Power Systems, Vol. 28, Issue 4
  • DOI: 10.1109/TPWRS.2013.2251373

Toward scalable stochastic unit commitment: Part 2: solver configuration and performance assessment
journal, April 2015


The Ramping Polytope and Cut Generation for the Unit Commitment Problem
journal, November 2018

  • Knueven, Ben; Ostrowski, Jim; Wang, Jianhui
  • INFORMS Journal on Computing, Vol. 30, Issue 4
  • DOI: 10.1287/ijoc.2017.0802

Min-up/min-down polytopes
journal, June 2004


Optimal Self-Scheduling of a Thermal Producer in Short-Term Electricity Markets by MILP
journal, November 2010

  • Simoglou, Christos K.; Biskas, Pandelis N.; Bakirtzis, Anastasios G.
  • IEEE Transactions on Power Systems, Vol. 25, Issue 4
  • DOI: 10.1109/TPWRS.2010.2050011

A genetic algorithm solution to the unit commitment problem
journal, January 1996

  • Kazarlis, S. A.; Bakirtzis, A. G.; Petridis, V.
  • IEEE Transactions on Power Systems, Vol. 11, Issue 1
  • DOI: 10.1109/59.485989

Tight Mixed Integer Linear Programming Formulations for the Unit Commitment Problem
journal, February 2012

  • Ostrowski, James; Anjos, Miguel F.; Vannelli, Anthony
  • IEEE Transactions on Power Systems, Vol. 27, Issue 1
  • DOI: 10.1109/TPWRS.2011.2162008

Modified orbital branching for structured symmetry with an application to unit commitment
journal, September 2014

  • Ostrowski, James; Anjos, Miguel F.; Vannelli, Anthony
  • Mathematical Programming, Vol. 150, Issue 1
  • DOI: 10.1007/s10107-014-0812-y

Improving Accuracy and Efficiency of Start-Up Cost Formulations in MIP Unit Commitment by Modeling Power Plant Temperatures
journal, July 2016

  • Silbernagl, Matthias; Huber, Matthias; Brandenberg, Rene
  • IEEE Transactions on Power Systems, Vol. 31, Issue 4
  • DOI: 10.1109/TPWRS.2015.2450776

A stochastic model for the unit commitment problem
journal, January 1996

  • Takriti, S.; Birge, J. R.; Long, E.
  • IEEE Transactions on Power Systems, Vol. 11, Issue 3
  • DOI: 10.1109/59.535691

Tight and Compact MILP Formulation of Start-Up and Shut-Down Ramping in Unit Commitment
journal, May 2013

  • Morales-Espana, German; Latorre, Jesus M.; Ramos, Andres
  • IEEE Transactions on Power Systems, Vol. 28, Issue 2
  • DOI: 10.1109/TPWRS.2012.2222938

A polyhedral study of production ramping
journal, June 2015

  • Damcı-Kurt, Pelin; Küçükyavuz, Simge; Rajan, Deepak
  • Mathematical Programming, Vol. 158, Issue 1-2
  • DOI: 10.1007/s10107-015-0919-9

Asynchronous Decentralized Framework for Unit Commitment in Power Systems
journal, January 2017