An improved priority list and neighborhood search method for unit commitment

Abstract This paper presents an improved priority list and neighborhood search (IPL-NS) method for ramp rate constrained unit commitment (RUC). The IPL-NS consists of two steps. At the first step, an IPL based on a mixed integer linear programming (MILP) formulation for UC is proposed to get unit status for UC without ramp rate constraints. At the second step, a neighborhood search (NS) algorithm based on three neighborhoods is produced to get unit status for RUC. The IPL-NS approach is applied to solve several popular test systems of up to 1000 units and the simulation results confirm the superiority of the proposed method. At the same time, the numerical results show that the proposed IPL can commit the most economic unit first much better than other existing PL methods. The results also indicate that the presented NS can handle the ramp rate constraints efficiently.

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

[2]  Xiaohong Guan,et al.  Unit Commitment with Identical Units: Successive Subproblem Solving Method Based on Lagrangian Relaxation , 2002, IEEE Power Engineering Review.

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

[4]  Samer Takriti,et al.  Incorporating Fuel Constraints and Electricity Spot Prices into the Stochastic Unit Commitment Problem , 2000, Oper. Res..

[5]  William D'haeseleer,et al.  Enhanced priority list unit commitment method for power systems with a high share of renewables , 2013 .

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

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

[8]  Claude Le Pape,et al.  Exploring relaxation induced neighborhoods to improve MIP solutions , 2005, Math. Program..

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

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

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

[12]  Zongxiang Lu,et al.  A Consideration of the Wind Power Benefits in Day-Ahead Scheduling of Wind-Coal Intensive Power Systems , 2013, IEEE Transactions on Power Systems.

[13]  Francisco D. Galiana,et al.  Towards a more rigorous and practical unit commitment by Lagrangian relaxation , 1988 .

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

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

[16]  Yongpei Guan,et al.  Two-stage robust optimization for N-k contingency-constrained unit commitment , 2012, IEEE Transactions on Power Systems.

[17]  Claudio Gentile,et al.  Solving unit commitment problems with general ramp constraints , 2008 .

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

[19]  Anastasios G. Bakirtzis,et al.  A genetic algorithm solution to the unit commitment problem , 1996 .

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

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

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

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

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

[25]  Claudio Gentile,et al.  Perspective cuts for a class of convex 0–1 mixed integer programs , 2006, Math. Program..

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

[27]  Tomonobu Senjyu,et al.  Emerging solution of large-scale unit commitment problem by Stochastic Priority List , 2006 .

[28]  Swapan Kumar Goswami,et al.  Differential Evolution Algorithm for Solving Unit Commitment with Ramp Constraints , 2008 .

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

[30]  Xiaoqing Bai,et al.  Semi-definite programming-based method for security-constrained unit commitment with operational and optimal power flow constraints , 2009 .

[31]  Weerakorn Ongsakul,et al.  Ramp rate constrained unit commitment by improved priority list and augmented Lagrange Hopfield network , 2008 .

[32]  Po-Hung Chen,et al.  Two-Level Hierarchical Approach to Unit Commitment Using Expert System and Elite PSO , 2012, IEEE Transactions on Power Systems.

[33]  W. J. Hobbs,et al.  An enhanced dynamic programming approach for unit commitment , 1988 .

[34]  J. Latorre,et al.  Tight and Compact MILP Formulation for the Thermal Unit Commitment Problem , 2013, IEEE Transactions on Power Systems.