An evolutionary programming based simulated annealing method for solving the unit commitment problem

Abstract This paper presents a new approach to solve the short-term unit commitment problem using an evolutionary programming based simulated annealing method. The objective of this paper is to find the generation scheduling such that the total operating cost can be minimized, when subjected to a variety of constraints. This also means that it is desirable to find the optimal generating unit commitment in the power system for the next H hours. Evolutionary programming, which happens to be a global optimisation technique for solving unit commitment Problem, operates on a system, which is designed to encode each unit’s operating schedule with regard to its minimum up/down time. In this, the unit commitment schedule is coded as a string of symbols. An initial population of parent solutions is generated at random. Here, each schedule is formed by committing all the units according to their initial status (“flat start”). Here the parents are obtained from a pre-defined set of solution’s, i.e. each and every solution is adjusted to meet the requirements. Then, a random recommitment is carried out with respect to the unit’s minimum down times. And SA improves the status. The best population is selected by evolutionary strategy. The Neyveli Thermal Power Station (NTPS) Unit-II in India demonstrates the effectiveness of the proposed approach; extensive studies have also been performed for different power systems consists of 10, 26, 34 generating units. Numerical results are shown comparing the cost solutions and computation time obtained by using the Evolutionary Programming method and other conventional methods like Dynamic Programming, Lagrangian Relaxation and Simulated Annealing and Tabu Search in reaching proper unit commitment.

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

[2]  David B. Fogel,et al.  Evolutionary Computation: Towards a New Philosophy of Machine Intelligence , 1995 .

[3]  S. M. Shahidehpour,et al.  Short-term unit commitment expert system , 1990 .

[4]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[5]  Narayana Prasad Padhy,et al.  Unit commitment using hybrid models: a comparative study for dynamic programming, expert system, fuzzy system and genetic algorithms , 2001 .

[6]  K. W. Edwin,et al.  Integer Programming Approach to the Problem of Optimal Unit Commitment with Probabilistic Reserve Determination , 1978, IEEE Transactions on Power Apparatus and Systems.

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

[8]  Hong-Tzer Yang,et al.  Evolutionary programming based economic dispatch for units with non-smooth fuel cost functions , 1996 .

[9]  A. G. Bakirtzis,et al.  Lambda of Lagrangian relaxation solution to unit commitment problem , 2000 .

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

[11]  Thomas Bäck,et al.  Evolutionary Algorithms in Theory and Practice , 1996 .

[12]  R. Nieva,et al.  Lagrangian Reduction of Search-Range for Large-Scale Unit Commitment , 1987, IEEE Power Engineering Review.

[13]  S. M. Shahidehpour,et al.  Hydro-thermal, scheduling by tabu search and decomposition method , 1996 .

[14]  Whei-Min Lin,et al.  An Improved Tabu Search for Economic Dispatch with Multiple Minima , 2002, IEEE Power Engineering Review.

[15]  Y. Y. Hong,et al.  Genetic Algorithms Based Economic Dispatch for Cogeneration Units Considering Multiplant Multibuyer Wheeling , 2002, IEEE Power Engineering Review.

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

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

[18]  Shokri Z. Selim,et al.  A simulated annealing algorithm for the clustering problem , 1991, Pattern Recognit..

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

[20]  Kit Po Wong,et al.  Combined genetic algorithm/simulated annealing/fuzzy set approach to short-term generation scheduling with take-or-pay fuel contract , 1996 .

[21]  Tharam S. Dillon,et al.  An Experimental Method of Determination of Optimal Maintenance Schedules in Power Systems Using the Branch-and-Bound Technique , 1976, IEEE Transactions on Systems, Man, and Cybernetics.

[22]  Lawrence J. Fogel,et al.  Artificial Intelligence through Simulated Evolution , 1966 .

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

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

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

[26]  M. R. Mohan,et al.  Optimal short-term hydrothermal scheduling using decomposition approach and linear programming method , 1992 .

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

[28]  J. M. Ngundam,et al.  Optimal scheduling of large-scale hydrothermal power systems using the Lagrangian relaxation technique , 2000 .

[29]  Yong-Gang Wu,et al.  A diploid genetic approach to short-term scheduling of hydro-thermal system , 2000 .

[30]  J. Birge,et al.  Using integer programming to refine Lagrangian-based unit commitment solutions , 2000 .

[31]  Chiang-Tsung Huang,et al.  Dynamic security constrained multi-area unit commitment , 1991 .