Picture of person typing on laptop with programming code visible on the laptop screen

World class computing and information science research at Strathclyde...

The Strathprints institutional repository is a digital archive of University of Strathclyde's Open Access research outputs. Strathprints provides access to thousands of Open Access research papers by University of Strathclyde researchers, including by researchers from the Department of Computer & Information Sciences involved in mathematically structured programming, similarity and metric search, computer security, software systems, combinatronics and digital health.

The Department also includes the iSchool Research Group, which performs leading research into socio-technical phenomena and topics such as information retrieval and information seeking behaviour.

Explore

An evolutionary generation scheduling in an open electricity market

Dahal, K. and Siewierski, T. and Galloway, S.J. and Burt, G.M. and McDonald, J.R. (2004) An evolutionary generation scheduling in an open electricity market. In: Congress on Evolutionary Computation (CEC 2004), 2004-06-19 - 2004-06-23.

Full text not available in this repository. Request a copy from the Strathclyde author

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