Using and comparing metaheuristic algorithms for optimizing bidding strategy viewpoint of profit maximization of generators

Abstract

With the formation of the competitive electricity markets in the world, optimization of bidding strategies has become one of the main discussions in studies related to market designing. Market design is challenged by multiple objectives that need to be satisfied. The solution of those multi-objective problems is searched often over the combined strategy space, and thus requires the simultaneous optimization of multiple parameters. The problem is formulated analytically using the Nash equilibrium concept for games composed of large numbers of players having discrete and large strategy spaces. The solution methodology is based on a characterization of Nash equilibrium in terms of minima of a function and relies on a metaheuristic optimization approach to find these minima. This paper presents some metaheuristic algorithms to simulate how generators bid in the spot electricity market viewpoint of their profit maximization according to the other generators' strategies, such as genetic algorithm (GA), simulated annealing (SA) and hybrid simulated annealing genetic algorithm (HSAGA) and compares their results. As both GA and SA are generic search methods, HSAGA is also a generic search method. The model based on the actual data is implemented in a peak hour of Tehran's wholesale spot market in 2012. The results of the simulations show that GA outperforms SA and HSAGA on computing time, number of function evaluation and computing stability, as well as the results of calculated Nash equilibriums by GA are less various and different from each other than the other algorithms. Keywords Genetic algorithm (GA) Á Simulated annealing (SA) Á Hybrid simulated annealing genetic algorithm (HSAGA) Á Nash equilibrium Á Bidding strategy

Auction-Based Single-Sided Bidding Electricity Market: An Alternative to the Bilateral Contractual Energy Trading Model in a Grid-Tied Microgrid

“…To facilitate strategic bidding in electricity markets, different researchers have proposed models which utilize dynamic programming [18,19], stochastic optimization [20,21], Two-level optimization [22], Lagrangian relaxation [23], genetic algorithm, fuzzy approach [21], and game theory. These various methods can typically be divided into three categories: (i) Those based on estimating the market clearing price; (ii) Those based on game theory; and (iii) Those based on estimation of competitors' bidding behaviour from their past bidding data.…”

A Comparative Study on System Profit Maximization of a Renewable Combined Deregulated Power System

“…For maximizing a generator's profit based on market clearing price Mousavi, S.H. [133] suggested an optimal bidding strategy model based on the concept of Nash equilibrium. Genetic algorithm (GA), simulated annealing (SA) and hybrid simulated annealing genetic algorithm (HSAGA) were used and compared to judge the performance of the model.…”

Modern Optimization and Simulation Methods in Managerial and Business Economics: A Review

“…In recent years, different models have been developed and implemented for bidding competitive markets based on optimization, gaming theory, and multi-agent models (Mathur et al 2017). Thus, for example, Mousavi et al (2015) develop and compare different metaheuristic algorithms (a GA, a SA, and a hybrid SA-GA) for optimizing bidding strategy. The authors address the problem of computing a pure Nash equilibrium for electricity markets with many players.…”