A Novel Approach for Solving Unit Commitment  Problem using Evolutionary Programming Method  with Cooling � Banking Constraints

Nimain Charan Nayak; Dr. C. Christober Asir Rajan

Volume : III, Issue : I, January - 2013

A Novel Approach for Solving Unit Commitment Problem using Evolutionary Programming Method with Cooling � Banking Constraints

Nimain Charan Nayak, Dr. C. Christober Asir Rajan

Abstract :

This paper presents a novel approach for solving Unit Commitment Problem (UCP) using Evolutionary Programming Method (EPM) with Cooling – Banking Constraints. The objective of this paper is to find the generation scheduling by committing the generating units such that the total operating cost can be minimized by satisfying both the forecasted load demand and various operating constraints. An initial population of parent solutions is generated at random. Here the parents are obtained from a pre–defined set of solutions i.e. each and every solution is adjusted to meet the requirements. Then, random recommitment is carried out with respect to the unit’s minimum down times. The best population is selected by Evolutionary Strategy (ES). The numerical results are shown compå the cost solutions and computation time obtained by using the EPM with cooling and banking constraints with conventional methods like Dynamic Programming (DP).