| Title |
Multi-Stage Generation Allocation Game Considering Ramp-rate Constraints |
| Authors |
박용기(Park, Yong-Gi) ; 박종배(Park, Jong-Bae) ; 노재형(Roh, Jae-Hyung) ; 김형중(Kim, Hyeong-Jung) ; 신중린(Shin, Jung-Rin) |
| DOI |
https://doi.org/10.5370/KIEE.2011.60.3.509 |
| Keywords |
Generation allocation game ; Game theory ; Competitive market ; Ramp rate ; Profit maximization |
| Abstract |
This paper studies a novel method to find the profit-maximizing Nash Equilibriums in allocating generation quantities with consideration of ramp-rates under competitive market environment. Each GenCo in a market participates in a game to maximize its profit through competitions and play a game with bidding strategies. In order to find the Nash equilibriums it is necessary to search the feasible combinations of GenCos' strategies which satisfy every participant's profit and no one wants various constraints. During the procedure to find Nash equilibriums, the payoff matrix can be simplified as eliminating the dominated strategies. in each time interval. Because of the ramp-rate, generator's physically or technically limits to increase or decrease outputs in its range, it can restrict the number of bidding strategies of each generator at the next stage. So in this paper, we found the Nash Equilibriums for multi-stage generation allocation game considering the ramp-rate limits of generators. In the case studies, we analyzed the generation allocation game for a 12-hour multi-stage and compared it with the results of dynamic economic dispatch. Both of the two cases were considered generator's ramp-rate effects. |