2015
DOI: 10.1016/j.ijepes.2014.10.053
|View full text |Cite
|
Sign up to set email alerts
|

Optimal bidding strategy for GENCOs based on parametric linear programming considering incomplete information

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
12
0

Year Published

2016
2016
2021
2021

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 21 publications
(12 citation statements)
references
References 24 publications
0
12
0
Order By: Relevance
“…A simulated market model based on double auction is presented in [146,147]. The market model matches consumers and generator bids pairwise [148]. The focus of this simulator is on the learning process of agents' bidding behavior, with the application of the Roth-Erev reinforcement learning algorithm [147] and genetic algorithms [146].…”
Section: Complex Large-scale Simulation Inmentioning
confidence: 99%
“…A simulated market model based on double auction is presented in [146,147]. The market model matches consumers and generator bids pairwise [148]. The focus of this simulator is on the learning process of agents' bidding behavior, with the application of the Roth-Erev reinforcement learning algorithm [147] and genetic algorithms [146].…”
Section: Complex Large-scale Simulation Inmentioning
confidence: 99%
“…When compared with the traditional PSO, the proposed method gave better results, proving that it can be applied to other optimization problems. As in the case of the UC problem, the PCs also solve the ED problem, with the goal of increasing profits in an electricity market environment [31]. In [32], a variation of a traditional PSO was also proposed to solve the ED problem, in which a more realistic swarm behavior was introduced, promoting better communication among several solutions through the inertia of the swarm weights.…”
Section: Literature Reviewmentioning
confidence: 99%
“…In the study performed by Alberto et al [10], the Nash equilibrium of the single-side day-ahead market was analyzed with a static game model considering the transmission constraints. Gao, et al [11] researched on how to find the optimal bidding strategy of a GenCO in the single-side day-ahead electricity market, based on the parametric linear programming method and with the assumption that all GenCOs in the day-ahead market pursue profit maximization. In the papers by Kumar et al [12] and Wang [13], every GenCO in the single-side market optimizes its bidding strategy by evaluating the strategy probability distributions of its rivals with the information about their cost functions (complete information) and their strategies from last game iteration (but imperfect information).…”
Section: Literature Review and Main Contributionsmentioning
confidence: 99%
“…Taking provisions (1)-(4) into consideration, the methods both in [8][9][10][11][12][13][14][15][16][17][18][20][21][22][23] and in [19,[24][25][26][27][28][29][30][31][32][33] are not quite suitable for modeling and simulating the practical day-ahead electricity market exactly, the reason of which is that in the real day-ahead electricity market, every participant can adjust its bidding strategy within a continuous interval of values, but the literatures suitable for provisions (1)- (3) have assumed that the sets for alternative actions (e.g., bidding strategies) or potential states (e.g., historical MCP) are discrete.…”
Section: Literature Review and Main Contributionsmentioning
confidence: 99%
See 1 more Smart Citation