Please use this identifier to cite or link to this item:
|Title:||LRGA for solving profit based generation scheduling problem in competitive environment|
Profit-based unit commitment
Regulated power system
|Source:||Logenthiran, T.,Srinivasan, D. (2011). LRGA for solving profit based generation scheduling problem in competitive environment. 2011 IEEE Congress of Evolutionary Computation, CEC 2011 : 1148-1154. ScholarBank@NUS Repository. https://doi.org/10.1109/CEC.2011.5949746|
|Abstract:||Deregulated power industries increase the efficiency of electricity production and distribution, and offer higher quality, secure, and more reliable electricity at low prices. In a deregulated environment, utilities are not required to meet the total load demand. Generation companies (GENCOs) schedule the generators that produce less than the predicted load demand and reserve, but aim to deliver maximum profits. The scheduling of generators depends on the market price. More number of generating units are committed when the market price is higher. When more number of generating units are brought in the deregulated market, more profit can be achieved by producing higher amount of power. This paper present a hybrid algorithm to solve a profit based unit commitment problem in a deregulated environment. The proposed algorithm has been developed from generation company's point of view. It maximizes the profit of the generation company in the deregulated power and reserve markets. A hybrid methodology between Lagrangian Relaxation and Generic Algorithm (LRGA) is used to solve generation scheduling in a day-ahead competitive electricity market. The results obtained are quite encouraging and useful in deregulated market optimization. © 2011 IEEE.|
|Source Title:||2011 IEEE Congress of Evolutionary Computation, CEC 2011|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 13, 2017
checked on Dec 9, 2017
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.