Please use this identifier to cite or link to this item:
Title: GA approach to scheduling of generator units
Authors: Wong, YK
Chung, TS
Tuen, KW
Keywords: Combinatorial mathematics
Genetic algorithms
Power generation economics
Power generation planning
Power generation scheduling
Issue Date: 2000
Publisher: IET
Source: 2000 International Conference on Advances in Power System Control, Operation and Management, 2000 : APSCOM-00, 30 October-1 November 2000, v. 1, p. 129-133 How to cite?
Abstract: 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.
ISBN: 0-85296-791-8
DOI: 10.1049/cp:20000378
Appears in Collections:Conference Paper

View full-text via PolyU eLinks SFX Query
Show full item record

Page view(s)

Last Week
Last month
Citations as of Aug 13, 2018

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.