Comprehensive bidding strategies with genetic programming/finite state automata
This research is an extension of the authors' previous work in double auctions aimed at developing bidding strategies for electric utilities which trade electricity competitively. The improvements detailed in this paper come from using data structures which combine genetic programming and finite state automata termed GP-Automata. The strategies developed by the method described here are adaptive--reacting to inputs--whereas the previously developed strategies were only suitable in the particular scenario for which they had been designed. The strategies encoded in the GP-Automata are tested in an auction simulator. The simulator pits them against other distribution companies (distcos) and generation companies (gencos), buying and selling power via double auctions implemented in regional commodity exchanges. The GP-Automata are evolved with a genetic algorithm so that they possess certain characteristics. In addition to designing successful bidding strategies (whose usage would result in higher profits) the resulting strategies can also be designed to imitate certain types of trading behaviors. The resulting strategies can be implemented directly in on-line trading, or can be used as realistic competitors in an off-line trading simulator.
- Research Organization:
- Iowa State Univ., Ames, IA (US)
- OSTI ID:
- 20013158
- Journal Information:
- IEEE Transactions on Power Systems (Institute of Electrical and Electronics Engineers), Journal Name: IEEE Transactions on Power Systems (Institute of Electrical and Electronics Engineers) Journal Issue: 4 Vol. 14; ISSN 0885-8950; ISSN ITPSEG
- Country of Publication:
- United States
- Language:
- English
Similar Records
Bidding strategies that minimize risk with options and futures contracts
Developing strategies for bidding in energy brokerages through simulation