Firefly algorithm based optimization of Strategic bidding to maximize Profit and Benefit of Competitive Electricity market

K. Asokan(1*), R. Ashok Kumar(2)

(1) Power Systems with distinction from Annamalai University, Annamalainagar,
(2) Electrical Engineering, Annamalai University, India,
(*) Corresponding author


DOI's assignment:
the author of the article can submit here a request for assignment of a DOI number to this resource!
Cost of the service: euros 10,00 (for a DOI)

Abstract


The reconstruction of electric power industry may have significant effect on issues pertaining to economic and reliable operation of electric power system. Generation companies and large consumers are experiencing a different task of designing the proper handling methodologies. Therefore the systematic development of optimal bidding strategy becomes a major concern of Generation companies and power consumers.  In this paper an innovative approach for defining optimal bidding strategy is presented as a multi objective stochastic optimization problem and solved by Firefly algorithm (FA). The Firefly Algorithm is a Meta heuristic, nature inspired, optimization algorithm which is based on the social flashing behavior of fireflies and has been introduced for the bidding problem to obtain the global optimal solution. The proposed Firefly algorithm effectively maximizes the GENCOs profit and benefit of large consumers. A numerical example with six suppliers and two large consumers is considered to illustrate the salient features of the proposed method and test results are presented. The simulation result shows that these approaches effectively maximize the Profit and Benefit of Power suppliers and Large Consumers, converge much faster and more reliable when compared with available methods.
Copyright © 2014 Praise Worthy Prize - All rights reserved.

Keywords


Electricity market, Optimal bidding, Profit maximization, Customer benefit, firefly algorithm.

Full Text:

PDF


Refbacks

  • There are currently no refbacks.



Please send any question about this web site to info@praiseworthyprize.com
Copyright © 2005-2022 Praise Worthy Prize