کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
495938 | 862845 | 2013 | 11 صفحه PDF | دانلود رایگان |

A novel stochastic optimization approach to solve optimal bidding strategy problem in a pool based electricity market using fuzzy adaptive gravitational search algorithm (FAGSA) is presented. Generating companies (suppliers) participate in the bidding process in order to maximize their profits in an electricity market. Each supplier will bid strategically for choosing the bidding coefficients to counter the competitors bidding strategy. The gravitational search algorithm (GSA) is tedious to solve the optimal bidding strategy problem because, the optimum selection of gravitational constant (G). To overcome this problem, FAGSA is applied for the first time to tune the gravitational constant using fuzzy “IF/THEN” rules. The fuzzy rule-based systems are natural candidates to design gravitational constant, because they provide a way to develop decision mechanism based on specific nature of search regions, transitions between their boundaries and completely dependent on the problem. The proposed method is tested on IEEE 30-bus system and 75-bus Indian practical system and compared with GSA, particle swarm optimization (PSO) and genetic algorithm (GA). The results show that, fuzzification of the gravitational constant, improve search behavior, solution quality and reduced computational time compared against standard constant parameter algorithms.
Figure optionsDownload as PowerPoint slideHighlights
► A new paradigm based on fuzzy adaptive gravitational search algorithm is proposed.
► The main drawback of the GSA is the difficulty for the appropriate selection of gravitational constant parameter (G), which controls the search accuracy and may not give a global solution all the time.
► To overcome this drawback, the gravitational constant parameter (G) has been fuzzified. As a result, the agents tend to move toward the best position, which avoids premature convergence and permits a faster convergence.
► The proposed method is numerically verified through computer simulations on IEEE 30-bus system and 75-bus Indian practical system.
► The result shows that the proposed algorithm can generate better quality solution within shorter computational time and stable convergence characteristics compared to GSA, PSO and GA.
Journal: Applied Soft Computing - Volume 13, Issue 5, May 2013, Pages 2445–2455