Projected mixed integer programming formulations for unit commitment problem

Abstract The thermal unit commitment (UC) problem is a large-scale mixed integer quadratic programming (MIQP), which is difficult to solve efficiently, especially for large-scale instances. This paper presents a projected reformulation for UC problem. After projecting the power output of unit onto [0,1], a novel MIQP reformulation, denoted as P-MIQP, can be formed. The obtained P-MIQP is tighter than traditional MIQP formulation of UC problem. And the reduced problem of P-MIQP, which is eventually solved by solvers such as CPLEX, is compacter than that of traditional MIQP. In addition, two mixed integer linear programming (MILP) formulations can be obtained from traditional MIQP and our P-MIQP of UC by replacing the quadratic terms in the objective functions with a sequence of piece-wise perspective-cuts. Projected MILP is also tighter and compacter than the traditional MILP due to the same reason of MIQP. The simulation results for realistic instances that range in size from 10 to 200 units over a scheduling period of 24 h show that the projected reformulation yields tight and compact mixed integer programming UC formulations, which are competitive with currently traditional ones.

[1]  J. Jian,et al.  Outer Approximation and Outer-Inner Approximation Approaches for Unit Commitment Problem , 2014, IEEE Transactions on Power Systems.

[2]  Provas Kumar Roy,et al.  Solution of unit commitment problem using gravitational search algorithm , 2013 .

[3]  Antonio J. Conejo,et al.  A Parallel Repair Genetic Algorithm to Solve the Unit Commitment Problem , 2002, IEEE Power Engineering Review.

[4]  Chern-Lin Chen,et al.  Branch-and-bound scheduling for thermal generating units , 1993 .

[5]  Yuan-Yih Hsu,et al.  Fuzzy dynamic programming: an application to unit commitment , 1991 .

[6]  Tomonobu Senjyu,et al.  A fast technique for unit commitment problem by extended priority list , 2003 .

[7]  Wu Jiekang,et al.  A Hybrid Method for Optimal Scheduling of Short-Term Electric Power Generation of Cascaded Hydroelectric Plants Based on Particle Swarm Optimization and Chance-Constrained Programming , 2008, IEEE Transactions on Power Systems.

[8]  Claudio Gentile,et al.  A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes , 2009, Oper. Res. Lett..

[9]  C. Gentile,et al.  Sequential Lagrangian-MILP Approaches for Unit Commitment Problems , 2011 .

[10]  R. Jabr.  Tight polyhedral approximation for mixed-integer linear programming unit commitment formulations , 2012 .

[11]  Oktay Günlük,et al.  Perspective reformulations of mixed integer nonlinear programs with indicator variables , 2010, Math. Program..

[12]  Juan Alvarez Lopez,et al.  A MIQCP formulation to solve the unit commitment problem for large-scale power systems , 2011 .

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

[14]  J. Jian,et al.  Tighter relaxation method for unit commitment based on second-order cone programming and valid inequalities , 2014 .

[15]  J. Jian,et al.  Tight Relaxation Method for Unit Commitment Problem Using Reformulation and Lift-and-Project , 2015, IEEE Transactions on Power Systems.

[16]  W. Ongsakul,et al.  Unit commitment by enhanced adaptive Lagrangian relaxation , 2004, IEEE Transactions on Power Systems.

[17]  Claudio Gentile,et al.  Solving Nonlinear Single-Unit Commitment Problems with Ramping Constraints , 2006, Oper. Res..

[18]  Weerakorn Ongsakul,et al.  Improved merit order and augmented lagrange Hopfield network for unit commitment , 2007 .

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

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

[21]  Hassan L. Hijazi,et al.  An Outer-Inner Approximation for Separable Mixed-Integer Nonlinear Programs , 2014, INFORMS J. Comput..

[22]  Jong-Bae Park,et al.  A New Quantum-Inspired Binary PSO: Application to Unit Commitment Problems for Power Systems , 2010, IEEE Transactions on Power Systems.

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

[24]  Kit Po Wong,et al.  An Advanced Quantum-Inspired Evolutionary Algorithm for Unit Commitment , 2011, IEEE Transactions on Power Systems.

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

[26]  Chun-Lung Chen,et al.  Optimal Wind–Thermal Generating Unit Commitment , 2008, IEEE Transactions on Energy Conversion.

[27]  T. Niknam,et al.  A new decomposition approach for the thermal unit commitment problem , 2009 .

[28]  Costas Vournas,et al.  Unit commitment by an enhanced simulated annealing algorithm , 2006 .

[29]  R. Jabr.  Rank-constrained semidefinite program for unit commitment , 2013 .

[30]  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.

[31]  Eugenio Mijangos,et al.  A new optimal electricity market bid model solved through perspective cuts , 2013 .

[32]  Jianhui Wang,et al.  Outer-approximation method for security constrained unit commitment , 2013 .

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

[34]  Yongchuan Zhang,et al.  An adaptive chaotic artificial bee colony algorithm for short-term hydrothermal generation scheduling , 2013 .