Influence of feasibility constrains on the bidding strategy selection in a day-ahead electricity market session

Large part of liberalized electricity markets, including the Italian one, features an auction mechanism, called day-ahead energy market, which matches producers’ and buyers’ simple bids, consisting of energy quantity and price pairs. The match is achieved by a merit-order economic dispatch procedure independently applied for each of the hours of the following day. Power plants operation should, however, take into account several technical constraints, such as maximum and minimum production bounds, ramp constraints and minimum up and downs times, as well as no-load and startup costs. The presence of these constraints forces to adjust the scheduling provided by the market in order to obtain a feasible scheduling. The paper presents an analysis of the possibility and the limits of taking into account the power plants technical constraints in the bidding strategy selection procedure of generating companies (Gencos). The analysis is carried out by using a computer procedure based both on a simple static game-theory approach and on a cost-minimization unit-commitment algorithm. For illustrative purposes, we present the results obtained for a system with three Gencos, each owning several power plants, trying to model the bidding behaviour of every generator in the system. This approach, although complex from the computational point of view, allows an analysis of both price and quantity bidding strategies and appears to be applicable to markets having different rules and features.