Yes / The classical generation scheduling problem defines on/off decisions (commitment) and dispatch level of all available generators in a power system for each scheduling period. In recent years researchers have focused on developing new approaches to solve nonclassical generation scheduling problems in the newly deregulated and decentralized electricity market place. In this paper a GA-based approach has been developed for a system operator to schedule generation in a market akin to that operating in England and Wales. A generation scheduling problem has been formulated and solved using available trading information at the time of dispatch. The solution is updated after information is obtained in a rolling fashion. The approach is tested for two IEEE network-based problems, and achieves comparable results with a branch and bound technique in reasonable CPU time.
| Identifer | oai:union.ndltd.org:BRADFORD/oai:bradscholars.brad.ac.uk:10454/950 |
| Date | January 2004 |
| Creators | Dahal, Keshav P., Siewierski, T.A., Galloway, S.J., Burt, G.M., McDonald, J.R. |
| Source Sets | Bradford Scholars |
| Language | English |
| Detected Language | English |
| Type | Conference paper |
| Rights | © 2004 IEEE. Reprinted from Proceedings of the Congress on Evolutionary Computation - CEC 2004. 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 pubs-permissions@ieee.org. By choosing to view this document, you agree to all provisions of the copyright laws protecting it. |
Page generated in 0.0025 seconds