Security Correction for Medium and Long-term Electricity Energy Transaction based on Security-Constrained Unit Commitment

Medium and long-term market is an important part of power market construction in China. The key feature of medium and long term market is that the transaction in the form of electricity energy. This is significantly different from the spot market trading by electricity power. The energy contract is a physical contract and needs to be implemented in electric power dispatching. It is important to study energy security correction to evaluate whether energy contract is feasible and how to further adjust. This paper presents a novel method for energy security correction by refining the energy to the unit output and power flow. By objective conversion and constraint construct, a optimization model is established based on security-constrained unit commitment (SCUC), which can consider multi component of energy contract for all power plants. The model decomposition strategy for improving the computational efficiency is proposed and the model is solved by commercial software CPLEX. The feasibility of energy contract and the correction suggestion when the energy contract is not feasible are obtained. The multi-period unit commitment and output of all units is obtained at the same time. The feasibility and effectiveness have been proved by the practical application in provincial power grid.

[1]  Mohammad Shahidehpour,et al.  Market operations in electric power systems , 2002 .

[2]  X. Guan,et al.  The conditions for obtaining feasible solutions to security-constrained unit commitment problems , 2005 .

[3]  Wang Gang.  Modeling and Solving for Monthly Security Constrained Unit Commitment Problem , 2011 .

[4]  Wen Fushuan.  Monthly Unit Commitment and Security Assessment Algorithm for Large-scale Power System , 2008 .

[5]  S. M. Shahidehpour,et al.  Short-term generation scheduling with transmission and environmental constraints using an augmented Lagrangian relaxation , 1995 .

[6]  A. J. Svoboda,et al.  Short-term resource scheduling with ramp constraints [power generation scheduling] , 1997 .

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

[8]  J. Usaola,et al.  Security-constrained optimal generation scheduling in large-scale power systems , 2006, IEEE Transactions on Power Systems.

[9]  A.J. Conejo,et al.  Modeling of start-up and shut-down power trajectories of thermal units , 2004, IEEE Transactions on Power Systems.

[10]  S..  SHORT-TERM GENERATION SCHEDULING WITH TRANSMISSION AND ENVIRONMENTAL CONSTRAINTS USING AN AUGMENTED LAGRANGIAN RELAXATION , 2009 .

[11]  F. D. Galiana,et al.  Combined Pool/Bilateral Dispatch-Part 1: Performance of Mixed Trading Strategies , 2001, IEEE Power Engineering Review.

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

[13]  F. Galiana,et al.  Studies of bilateral contracts with respect to steady-state security in a deregulated environment [of electricity supply] , 1998 .

[14]  Marija D. Ilic,et al.  A mathematical framework for the analysis and management of power transactions under open access , 1998 .

[15]  Li Lili,et al.  Model and Algorithm for Security Constrained Economical Dispatch in Equilibrium Power Generation Dispatching Mode , 2010 .

[16]  Allen J. Wood,et al.  Power Generation, Operation, and Control , 1984 .

[17]  Philip G. Hill,et al.  Power generation , 1927, Journal of the A.I.E.E..

[18]  A. Papalexopoulos,et al.  Optimization based methods for unit commitment: Lagrangian relaxation versus general mixed integer programming , 2003, 2003 IEEE Power Engineering Society General Meeting (IEEE Cat. No.03CH37491).

[19]  F. Galiana,et al.  Combined Pool/Bilateral Dispatch, Part II: Curtailment of Firm and Nonfirm Contracts , 2002, IEEE Power Engineering Review.

[20]  Tomonobu Senjyu,et al.  Fast solution technique for large-scale unit commitment problem using genetic algorithm , 2003 .