Absolute stochastic simulated annealing approach to unit commitment problem

This paper presents a new approach to unit commitment problem using absolute stochastic simulated annealing method. In every iteration, a solution is taken with a certain probability. Typically in simulated annealing method, a higher cost feasible solution is accepted with temperature dependent probability, but other solutions are accepted deterministically. That may lead to the near optimization slowly. However in this paper, all the solutions, both higher and lower cost, are associated with acceptance probabilities. Besides, number of bits flipping is decided by appropriate probability distribution. Excess units with system dependent probability distribution handle constraints efficiently. To reduce the economic load dispatch (ELD) calculation, sign bit vector is introduced as well. The proposed method is tested using the reported problem data set. Simulation results for the systems up to 100-unit are compared to previous reported results. Numerical results show an improvement in solution cost and time compared to the results obtained from recent powerful algorithms

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

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

[3]  Arthur I. Cohen,et al.  A Branch-and-Bound Algorithm for Unit Commitment , 1983, IEEE Transactions on Power Apparatus and Systems.

[4]  D. Bertsekas,et al.  Solution of Large-Scale Optimal Unit Commitment Problems , 1982, IEEE Transactions on Power Apparatus and Systems.

[5]  H. H. Happ,et al.  Large Scale Hydro-Thermal Unit Commitment-Method and Results , 1971 .

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

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

[8]  F. Lee.  A Fuel-Constrained Unit Commitment Method , 1989, IEEE Power Engineering Review.

[9]  A. Bakirtzis,et al.  A solution to the unit-commitment problem using integer-coded genetic algorithm , 2004, IEEE Transactions on Power Systems.

[10]  G. Purushothama,et al.  Simulated Annealing with Local Search: A Hybrid Algorithm for Unit Commitment , 2002, IEEE Power Engineering Review.

[11]  Suzannah Yin Wa Wong,et al.  An enhanced simulated annealing approach to unit commitment , 1998 .

[12]  Koichi Nara,et al.  Maintenance scheduling by using simulated annealing method (for power plants) , 1991 .

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

[14]  Shokri Z. Selim,et al.  Integrating genetic algorithms, tabu search, and simulated annealing for the unit commitment problem , 1999 .

[15]  S. Virmani,et al.  Implementation of a Lagrangian Relaxation Based Unit Commitment Problem , 1989, IEEE Power Engineering Review.

[16]  K. M. Dale,et al.  A Study of the Economic Shutdown of Generating Units in Daily Dispatch , 1959, Transactions of the American Institute of Electrical Engineers. Part III: Power Apparatus and Systems.

[17]  Hiroyuki Mori,et al.  Application of Priority-List-Embedded Tabu Search to Unit Commitment in Power Systems , 2001 .

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

[19]  Francisco D. Galiana,et al.  Unit commitment by simulated annealing , 1990 .