By Topic

An evolutionary programming based simulated annealing method for unit commitment problem with cooling-banking constraints

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Christober, C. ; Dept. of Electr. & Electron. Eng., Pondicherry Eng. Coll., India ; Asir Rajan

This paper presents a new approach to solve the short-term unit commitment problem using an evolutionary programming based simulated annealing method with cooling and banking constraints. 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 optimization 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 solutions, i.e. each and every solution is adjusted to meet the requirements. Then, a random decommitment is carried out with respect to the unit's minimum down times. And TS improves the status by avoiding entrapment in local minima. The best population is selected by evolutionary strategy: 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.

Published in:

India Annual Conference, 2004. Proceedings of the IEEE INDICON 2004. First

Date of Conference:

20-22 Dec. 2004