This paper presents a methodology to find the profit maximized Nash Equilibriums of each generator(or GenCo), which considers the Ramp-rate of each generator under a competitive market environment. The ramp-rate of a generator is one of the physical o...
This paper presents a methodology to find the profit maximized Nash Equilibriums of each generator(or GenCo), which considers the Ramp-rate of each generator under a competitive market environment. The ramp-rate of a generator is one of the physical or technical constraints of a generator and means the ability to increase or decrease the output instantaneously.
In this paper, we found several Nash Equilibriums of the generation allocation problem through Dynamic Programming in a competitive market. Individual generators participate in a game to maximize its profit through competitions and play a game with bidding strategies of its generation quantities in a spot market.
The ramp-rate physically or technically limits generators to increase or decrease outputs in its range and restricts the number of bidding strategies of each generator. With these restricted strategies, generators participate in the game and finally can find the Nash Equilibriums.
We suggest the Dynamic Programming to find the Nash Equilibriums while removing the inferior strategies in each stage(or each time). At first, in the case studies, we compared it with the results of the Brute-force method to improve the feasibility of this methodology, and then played the generation allocation game for a 12-hour multi-state. Finally, we compare the results with the ones of the economic dispatch considering the ramp-rate.