The solution of generation scheduling (GS) problems
involves the determination of the unit commitment (UC) and
economic dispatch (ED) for each generator in a power system at
each time interval in the scheduling period. The solution
procedure requires the simultaneous consideration of these two
decisions. In recent years researchers have focused much
attention on new solution techniques to GS. This paper proposes
the application of a variety of genetic algorithm (GA) based
approaches and investigates how these techniques may be
improved in order to more quickly obtain the optimum or near
optimum solution for the GS problem. The results obtained show
that the GA-based hybrid approach offers an effective alternative
for solving realistic GS problems within a realistic timeframe.
| Identifer | oai:union.ndltd.org:BRADFORD/oai:bradscholars.brad.ac.uk:10454/2598 |
| Date | January 2001 |
| Creators | Dahal, Keshav P., Galloway, S.J., Burt, G.M., McDonald, J.R. |
| Publisher | IEEE |
| Source Sets | Bradford Scholars |
| Language | English |
| Detected Language | English |
| Type | Conference paper, published version paper |
| Rights | Copyright © [2001] IEEE. Reprinted from Proceedings of Large Engineering Systems Conference on Power Engineering (LESCOPE2001). This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of the University of Bradford's products or services. Internal or 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 must be obtained from the IEEE by writing to pubspermissions@ ieee.org. By choosing to view this document, you agree to all provisions of the copyright laws protecting it. |
Page generated in 0.0015 seconds