2011
DOI: 10.1002/etep.605
|View full text |Cite
|
Sign up to set email alerts
|

Generation companies' adaptive bidding strategies using finite‐state automata in a single‐sided electricity market

Abstract: SUMMARY This paper explores the use of genetic algorithms (GAs) in the development of the bidding strategies used by generation companies under two different market clearing mechanisms, uniform pricing and pay‐as‐bid pricing. The bidding strategies are represented by two modifications of a classical data processing structure known as finite‐state automata. Semi‐fixed fitness function and co‐evolutionary fitness function were incorporated in our GA. A third simple representation to obtain a comparison baseline … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2012
2012
2015
2015

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(3 citation statements)
references
References 15 publications
0
3
0
Order By: Relevance
“…Although it is common to assume ζ re = [0.05,0.1] in an L R − I learning algorithm and in this sort of problems , for confidence, the test systems proposed in and the spinning tree problem (which is similar to the optimal feeder routing) are assumed. Then, percentage of the converged runs (PCR) to the expected results (or better than them) for different values of learning rate is calculated for 50 independent runs.…”
Section: Numerical Resultsmentioning
confidence: 99%
“…Although it is common to assume ζ re = [0.05,0.1] in an L R − I learning algorithm and in this sort of problems , for confidence, the test systems proposed in and the spinning tree problem (which is similar to the optimal feeder routing) are assumed. Then, percentage of the converged runs (PCR) to the expected results (or better than them) for different values of learning rate is calculated for 50 independent runs.…”
Section: Numerical Resultsmentioning
confidence: 99%
“…Veselka et al (2002) defined the agents' learning strategy based on Genetic Algorithm. Sheble and Gutierrez-Alcaraz (2012) used Genetic Algorithm to implement agents' adaptive bidding strategies. Learning strategy is crucial for agents to maximize their profit and reinforcement learning algorithm (Erev and Roth, 1998;Sutton and Barto, 1998) seems to be the most popular choice for designing agents' bidding strategies.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Various methods have been proposed for simulating electricity markets based on multiagent systems, some of which can be found in [2][3][4][5][6][7][8][9][10][11][12][13][14][15][16][17][18]. In the majority of the efforts made, only the energy market was taken into account in the simulations and studies.…”
Section: Introductionmentioning
confidence: 99%