PolyU Institutional Repository >
Electronic and Information Engineering >
EIE Conference Papers & Presentations >
Please use this identifier to cite or link to this item:
|Title: ||Improved genetic algorithm for economic load dispatch with valve-point loadings|
|Authors: ||Ling, S. H.|
Lam, H. K.
Leung, Frank H. F.
Lee, Y. S.
|Subjects: ||Economic load dispatch (ELD)|
Genetic algorithm (GA)
|Issue Date: ||2003 |
|Citation: ||IECON'03 : the 29th annual conference of the IEEE Industrial Electronics Society : Roanoke, Virginia, USA, November 2nd (Sunday) to Thursday, November 6th (Thursday) 2003, p. 442-447.|
|Abstract: ||Economic load dispatch is one of the optimization problems in power systems. This paper presents an improved genetic algorithm for economic load dispatch with valve-point loadings. New crossover and mutation operations are introduced. The solutions of the economic load dispatch with valve-point loadings under three cases are solved by the improved genetic algorithm. Test results are given and compared with those from different published genetic algorithms. It will be shown that the proposed improved genetic algorithm performs better than the published genetic algorithms.|
|Rights: ||© 2003 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.|
This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.
|Type: ||Conference Paper|
|Appears in Collections:||EIE Conference Papers & Presentations|
All items in the PolyU Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated.
No item in the PolyU IR may be reproduced for commercial or resale purposes.