Improved merit order and augmented lagrange Hopfield network for unit commitment

This paper proposes an improved merit order (IMO) and augmented Lagrange Hopfield network (ALHN) for unit commitment (UC). IMO is a merit-order method which is based on average production cost of generating units improved by heuristic search algorithms, whereas ALHN is a continuous Hopfield neural network with its energy function based on augmented Lagrange relaxation. The proposed IMO-ALHN solves UC problem in three stages. In the first stage, IMO is applied for unit scheduling. In the second stage, ALHN is used to solve ramp rate constrained economic dispatch (RED) based on the obtained unit schedule, and a strategy for repairing ramp rate constraint violation is performed if a feasible solution is not found. In the last stage, a heuristic search for unit decommitment is applied on the obtained solution from RED for further improvement and ALHN is again applied to solve RED if there is any change in the unit schedule. The proposed method is tested on systems up to 1000 generating units with schedule time horizon up to 168 h. Test results indicate that the proposed method is very attractive and favourable over many other methods due to substantial production cost savings and faster computational times.

[1]  S. M. Shahidehpour,et al.  Effects of ramp-rate limits on unit commitment and economic dispatch , 1993 .

[2]  Mark O'Malley,et al.  Initialisation of the augmented Hopfield network for improved generator scheduling , 2002 .

[3]  Eiichi Tanaka,et al.  An Evolutionary Programming Solution to the Unit Commitment Problem , 1997 .

[4]  Hiroshi Sasaki,et al.  A solution method of unit commitment by artificial neural networks , 1992 .

[5]  Chuan-Ping Cheng,et al.  Unit commitment by Lagrangian relaxation and genetic algorithms , 2000 .

[6]  H. A. Smolleck,et al.  A fuzzy logic approach to unit commitment , 1997 .

[7]  A. H. Mantawy,et al.  Unit commitment by tabu search , 1998 .

[8]  Alice E. Smith,et al.  A Seeded Memetic Algorithm for Large Unit Commitment Problems , 2002, J. Heuristics.

[9]  A. H. Mantawy,et al.  A simulated annealing algorithm for unit commitment , 1998 .

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

[11]  K. Manivannan,et al.  Neural-based tabu search method for solving unit commitment problem , 2003 .

[12]  Jorge Pinho de Sousa,et al.  Using GRASP to Solve the Unit Commitment Problem , 2003, Ann. Oper. Res..

[13]  Gerald B. Sheblé,et al.  Unit commitment literature synopsis , 1994 .

[14]  M. R. Mohan,et al.  An evolutionary programming-based tabu search method for solving the unit commitment problem , 2004, IEEE Transactions on Power Systems.

[15]  G. L. Viviani,et al.  Hierarchical Economic Dispatch for Piecewise Quadratic Cost Functions , 1984, IEEE Transactions on Power Apparatus and Systems.

[16]  Bruce F. Wollenberg,et al.  A unit commitment expert system (power system control) , 1988 .

[17]  J. Momoh Electric Power System Applications of Optimization , 2000 .

[18]  Kwang Y. Lee,et al.  Economic load dispatch for piecewise quadratic cost function using Hopfield neural network , 1993 .

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

[20]  Tomonobu Senjyu,et al.  A unit commitment problem by using genetic algorithm based on unit characteristic classification , 2002, 2002 IEEE Power Engineering Society Winter Meeting. Conference Proceedings (Cat. No.02CH37309).

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

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

[23]  W. Ongsakul,et al.  Hopfield Lagrange for short-term hydrothermal scheduling , 2005, 2005 IEEE Russia Power Tech.

[24]  Cor Bioch,et al.  Constrained optimization with a continuous Hopfield-Lagrange model , 1993 .

[25]  Minqiang Li,et al.  A floating-point genetic algorithm for solving the unit commitment problem , 2007, Eur. J. Oper. Res..

[26]  Chuangxin Guo,et al.  An improved particle swarm optimization algorithm for unit commitment , 2006 .

[27]  Tomonobu Senjyu,et al.  Fast technique for unit commitment by genetic algorithm based on unit clustering , 2005 .

[28]  Chuanwen Jiang,et al.  A matrix real-coded genetic algorithm to the unit commitment problem , 2006 .

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

[30]  Weerakorn Ongsakul,et al.  Enhanced augmented Lagrangian Hopfield network for unit commitment , 2006 .

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

[32]  Tomonobu Senjyu,et al.  Absolutely Stochastic Simulated Annealing Approach to Large Scale Unit Commitment Problem , 2006 .

[33]  H. H. Balci,et al.  Scheduling electric power generators using particle swarm optimization combined with the Lagrangian relaxation method , 2004 .

[34]  Walter L. Snyder,et al.  Dynamic Programming Approach to Unit Commitment , 1987, IEEE Transactions on Power Systems.

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