Please use this identifier to cite or link to this item:
http://localhost:8080/xmlui/handle/123456789/2328| Title: | Generation bidding strategy in a pool based electricity market using Shuffled Frog Leaping Algorithm |
| Authors: | Vijaya Kumar, J. Kumar, D.M. Vinod |
| Keywords: | Electricity market Bidding strategies |
| Issue Date: | 2014 |
| Publisher: | Applied Soft Computing Journal |
| Citation: | 10.1016/j.asoc.2014.03.027 |
| Abstract: | In an electricity market generation companies need suitable bidding models to maximize their profits. Therefore, each supplier will bid strategically for choosing the bidding coefficients to counter the competitors bidding strategy. In this paper optimal bidding strategy problem is solved using a novel algorithm based on Shuffled Frog Leaping Algorithm (SFLA). It is memetic meta-heuristic that is designed to seek a global optimal solution by performing a heuristic search. It combines the benefits of the Genetic-based Memetic Algorithm (MA) and the social behavior-based Particle Swarm Optimization (PSO). Due to this it has better precise search which avoids premature convergence and selection of operators. Therefore, the proposed method overcomes the short comings of selection of operators and premature convergence of Genetic Algorithm (GA) and PSO method. Important merit of the proposed SFALA is that faster convergence. The proposed method is numerically verified through computer simulations on IEEE 30-bus system consist of 6 suppliers and practical 75-bus Indian system consist of 15 suppliers. The result shows that SFLA takes less computational time and producing higher profits compared to Fuzzy Adaptive PSO (FAPSO), PSO and GA. |
| Description: | NITW |
| URI: | http://localhost:8080/xmlui/handle/123456789/2328 |
| Appears in Collections: | Electrical Engineering |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Generation bidding strategy in a pool based electricity market using Shuffled Frog Leaping Algorithm.pdf | 692.54 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.