Neural based tabu search method for solving unit commitment problem

Author(s):  
C.C. Asir Rajan
2011 ◽  
Vol 62 (1) ◽  
pp. 11-18 ◽  
Author(s):  
C. Christober ◽  
Asir Rajan

An Evolutionary Programming Based Tabu Search Method for Unit Commitment Problem with Cooling-Banking Constraints 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.


Sign in / Sign up

Export Citation Format

Share Document