By Topic

GA approach to scheduling of generator units

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
$33 $33
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

3 Author(s)
Y. K. Wong ; Dept. of Electr. Eng., Hong Kong Polytech., Hung Hom, China ; T. S. Chung ; K. W. Tuen

This paper presents a genetic algorithm (GA) approach for solving the generators scheduling problem and modifications are adopted to improve the performance of the GA for the scheduling problem. Solving the problem is able to determine a start-up and shut-down schedule for all available generators in a power system over a period of time to meet the forecasted load demand at minimum cost. From the schedule, near optimum production cost is achieved while satisfying a large set of operating constraints. The operating constraints including fuel cost, start-up costs, minimum start-up time and shutdown time must be met for the generators schedule. Owing to the nonconvex and combinatorial nature of the scheduling problem, conventional programming methods are difficult to solve this problem. However, the application of GA is suitable for solving the problem. GAs are adaptive search techniques to determine the global optimal solution of a combinatorial optimization problem which are based on the mechanics of natural genetics and natural selection.

Published in:

Advances in Power System Control, Operation and Management, 2000. APSCOM-00. 2000 International Conference on  (Volume:1 )

Date of Conference:

30 Oct.-1 Nov. 2000