Tight and Compact MILP Formulation for the Thermal Unit Commitment Problem

This paper presents a mixed-integer linear programming (MILP) reformulation of the thermal unit commitment (UC) problem. The proposed formulation is simultaneously tight and compact. The tighter characteristic reduces the search space and the more compact characteristic increases the searching speed with which solvers explore that reduced space. Therefore, as a natural consequence, the proposed formulation significantly reduces the computational burden in comparison with analogous MILP-based UC formulations. We provide computational results comparing the proposed formulation with two others which have been recognized as computationally efficient in the literature. The experiments were carried out on 40 different power system mixes and sizes, running from 28 to 1870 generating units.

[1]  L. L. Garver,et al.  Power Generation Scheduling by Integer Programming-Development of Theory , 1962, Transactions of the American Institute of Electrical Engineers. Part III: Power Apparatus and Systems.

[2]  H. P. Williams,et al.  Model Building in Mathematical Programming , 1979 .

[3]  Robert E. Bixby,et al.  MIP: Theory and Practice - Closing the Gap , 1999, System Modelling and Optimization.

[4]  Werner Römisch,et al.  Stochastic Lagrangian Relaxation Applied to Power Scheduling in a Hydro-Thermal System under Uncertainty , 2000, Ann. Oper. Res..

[5]  A. Conejo,et al.  Optimal response of a thermal unit to an electricity spot market , 2000 .

[6]  Martin W. P. Savelsbergh,et al.  Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition , 2000, INFORMS J. Comput..

[7]  J. Hooker,et al.  Logic-Based Methods for Optimization: Combining Optimization and Constraint Satisfaction , 2000 .

[8]  Benjamin F. Hobbs,et al.  Why this Book? New Capabilities and New Needs for Unit Commitment Modeling , 2002 .

[9]  S. Stoft.  Power System Economics: Designing Markets for Electricity , 2002 .

[10]  S. Stoft.  Power System Economics: Designing Markets for Electricity , 2002 .

[11]  Robert E. Bixby,et al.  Solving Real-World Linear Programs: A Decade and More of Progress , 2002, Oper. Res..

[12]  Laurence A. Wolsey,et al.  Strong formulations for mixed integer programs: valid inequalities and extended formulations , 2003, Math. Program..

[13]  N.P. Padhy,et al.  Unit commitment-a bibliographical survey , 2004, IEEE Transactions on Power Systems.

[14]  Robert E. Bixby,et al.  Mixed-Integer Programming: A Progress Report , 2004, The Sharpest Cut.

[15]  Deepak Rajan,et al.  IBM Research Report Minimum Up/Down Polytopes of the Unit Commitment Problem with Start-Up Costs , 2005 .

[16]  A. Conejo,et al.  Market-clearing with stochastic security-part I: formulation , 2005, IEEE Transactions on Power Systems.

[17]  M. Shahidehpour,et al.  Price-based unit commitment: a case of Lagrangian relaxation versus mixed integer programming , 2005, IEEE Transactions on Power Systems.

[18]  M. Carrion,et al.  A computationally efficient mixed-integer linear formulation for the thermal unit commitment problem , 2006, IEEE Transactions on Power Systems.

[19]  Robert E. Bixby,et al.  Progress in computational mixed integer programming—A look back from the other side of the tipping point , 2007, Ann. Oper. Res..

[20]  M. Shahidehpour,et al.  Stochastic Security-Constrained Unit Commitment , 2007, IEEE Transactions on Power Systems.

[21]  S. Oren,et al.  Analyzing valid inequalities of the generation unit commitment problem , 2009, 2009 IEEE/PES Power Systems Conference and Exposition.

[22]  C. Gentile,et al.  Tighter Approximated MILP Formulations for Unit Commitment Problems , 2009, IEEE Transactions on Power Systems.

[23]  Andrew L. Ott,et al.  Evolution of computing requirements in the PJM market: Past and future , 2010, IEEE PES General Meeting.

[24]  Laurence A. Wolsey,et al.  Reformulation and Decomposition of Integer Programs , 2009, 50 Years of Integer Programming.

[25]  Andrea Lodi,et al.  Mixed Integer Programming Computation , 2010, 50 Years of Integer Programming.

[26]  Kory W Hedman,et al.  Co-Optimization of Generation Unit Commitment and Transmission Switching With N-1 Reliability , 2010, IEEE Transactions on Power Systems.

[27]  Michael Ferris,et al.  Co-optimization of generation unit commitment and transmission switching with N-1 reliability , 2010, IEEE PES General Meeting.

[28]  Andrea Lodi,et al.  MIPLIB 2010 , 2011, Math. Program. Comput..

[29]  M. Anjos,et al.  Tight Mixed Integer Linear Programming Formulations for the Unit Commitment Problem , 2012, IEEE Transactions on Power Systems.

[30]  Jesús María Latorre Canteli,et al.  Tight and compact MILP formulation of start-up and shut-down ramping in unit commitment , 2013, PES 2013.

[31]  Andrea Lodi,et al.  Performance Variability in Mixed-Integer Programming , 2013 .

[32]  J. Latorre,et al.  Companion for Tight and Compact MILP Formulation for the Thermal Unit Commitment Problem , 2013 .

[33]  Andres Ramos,et al.  Tight and Compact MILP Formulation of Start-Up and Shut-Down Ramping in Unit Commitment , 2013, IEEE Transactions on Power Systems.