AN EVOLUTIONARY PROGRAMMING BASED TABU SEARCH METHOD FOR UNIT COMMITMENT PROBLEM WITH COOLING-BANKING CONSTRAINTS

C. Christober Asir Rajan

   This paper presents a new approach to solve the short-term unit commitment problem using An Evolutionary Programming Based tabu search method with cooling and banking constraints. 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.

Keywords: unit commitment problem, tabu search, evolutionary programming

[full-paper]