Abstract
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 non-classical generation scheduling problems in the newly deregulated and decentralized electricity market place. In this paper a CA 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 new 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
Original language | English |
---|---|
Pages | 1134-1142 |
Number of pages | 9 |
DOIs | |
Publication status | Published - Jun 2004 |
Event | Congress on Evolutionary Computation (CEC 2004) - Portland, United States Duration: 19 Jun 2004 → 23 Jun 2004 |
Conference
Conference | Congress on Evolutionary Computation (CEC 2004) |
---|---|
Country/Territory | United States |
City | Portland |
Period | 19/06/04 → 23/06/04 |
Keywords
- evolutionary
- generation scheduling
- open
- electricity market
- unit commitment
- dispatch
- genetic algorithm