Irjet V4i5122 PDF

International Research Journal of Engineering and Technology (IRJET) e-ISSN: 2395 -0056
Volume: 04 Issue: 05 | May -2017 www.irjet.net p-ISSN: 2395-0072
ARTIFICIAL BEE COLONY ALGORITHM FOR PROFIT BASED UNIT

COMMITMENT USING MODIFIED PRE-PREPARED POWER DEMAND TABLE
Kuldip Deka1, Dr. Barnali Goswami2

1M.E.
student, Assam Engineering College
2Associate professor, Dept. of Electrical Engineering, Jorhat Engineering College
---------------------------------------------------------------------***---------------------------------------------------------------------
Abstract - The electric power industry has been economical way. So it is necessary for the utility companies
experiencing a procedure of restructuring since the nineties to plan for generation in hourly basis for the whole day. The
decade. The restructuring process of electrical power system unit commitment (UC) can be defined as the selection of
specifies the splitting of vertically integrated utilities to generating units i.e. start up and shut down arrangement
generation, transmission and distribution companies with a which supply power to the load of the system at a minimum
system coordinator known as independent system operator cost over a specified time period as well as providing a fixed
(ISO). Restructuring process leads into a competitive climate amount of reserve, known as spinning reserve. The unit
among power generation companies. The generation commitment selects units which are to be turned on or
companies i.e. GENCOs plan their generators to maximize turned off and generate the power and the reserve margin
profit as opposed to fulfill load demand request. Scheduling of for each unit. In general the commitment and the generating
power generations and reserve generations, planning for arrangement are done on hourly basis. Unit commitment
operation, maintenance etc. are crucial aspects in power determines the on/off status as well as the active power
system. Unit commitment decision concerns of identifying the output of the generator while satisfying the objective
units which are to be committed or de-committed during each function subjects to some constraints. Unit commitment is
hour over a specified period, by considering some constraints considered as a standout amongst the most noteworthy
such as power demand constraint, power generation optimization task in the operation of energy framework. Unit
constraint, reserve constraints, constraints on the startup and commitment assumes an imperative part for the financially
shut down of units etc. So, in the profit based unit commitment utilization of energy creating unit in the power framework.
the main objective is to maximize the profit which can be There was a general expert to control all exercises of
obtained by subtracting the cost from the revenue rather than generation, transmission and distribution of power, which is
minimization of cost as in traditional unit commitment. There known as vertically integrated market. So it was tough to
are many optimization techniques which can be used for unit split the cost involved in generation, transmission and
commitment problem. Here, Modified Pre-Prepared Power distribution. Since nineties decade the electric power
Demand (MPPD) table is used for scheduling of units which are industry has been experiencing a continuous procedure of
to be committed over the specified period. Artificial Bee Colony move and rebuilding. The restructuring procedure includes
(ABC) algorithm is used to solve for the generation of the the detachment of generation, transmission and distribution
committed units in each and every hour. The suggested companies from the vertically integrated utilities, with a
method has been analyzed on a system having 10 units with a central coordinator known as Independent System Operator
scheduling period of 24 hours. (ISO) to balance supply and demand in real time and to
maintain system reliability and security. The restructuring
Key Words: Restructuring process, Competitive process has been introduced in all the power activities. In
climate, Power generation, Reserve generation, Profit deregulated environment, the unit commitment problem has
based unit commitment, Modified Pre-prepared Power a different objective that includes the electricity market than
Demand table, Artificial Bee Colony algorithm that of traditional system. The main objective is to maximize
the profit of the individual generating companies i.e. GENCOs
1. INTRODUCTION and that profit can be found by subtracting the total cost of
In power system planning, operation, maintenance generation from the revenue. The unit commitment under
and scheduling of generation are vital angles. The power deregulated environment changes its objective from
demand varies all the day and the load curve shows power minimization of the cost to maximization of profit. GENCOs
demand variation with respect to time during the course of made a schedule which generates power less than the
the day. The load pattern of many utilities varies between forecasted load demand but create maximum profit.
peak and off peak hours. It is not economical that all the
units are on-line for the whole duration. Therefore, there is a For power industry reliability is an important aspect. There
problem of Unit Commitment for the generating companies should be provision of backup power for power failure.
so that they can meet the varying power demand in Therefore reserve generation is included in the unit
2017, IRJET | Impact Factor value: 5.181 | ISO 9001:2008 Certified Journal | Page 620
commitment formulation under deregulated environment. In RV= + (2.2)

a deregulated environment all the generators, loads and TC= +
Independent System Operator (ISO) have the ability to sell or
purchase the reserve generation. The reserve market is r +ST (2.3)
different from the spot market one. The power traded in the
spot market are scheduled in advanced while reserve power Method B: Payment for Reserve Allocated
will be available on-line when a system contingency occur. In this strategy the power producers receive reserve price
Although the reserve price are different from the spot price for all the time whether the reserve power is allocated or
but it is directly depends on the spot price. There are mainly not. Here the reserve price is much lowered than the spot
three methods for reserve generation payments and they are price.
payment for power delivered in which reserve price is RV= + +
higher than spot price, payment for reserve allocated in
r. ) (2.4)
which reserve price is lowered than the spot price and price
process for reserve price [1]. In the first method, the power TC= +
producers receive the reserve price for that reserve only if r +ST (2.5)
the reserve power is actually used. In the second method, the
Where,
producers receive the reserve price for all the time whether
(2.6)
the reserve is allocated or not. In deregulated environment
for profit maximization the possibility of generator failure PF= Total profit of the generating companies
should also be included i.e. the profit depends on the RV= Total revenue of the generating companies
probability of failure. Thus the economical balance is TC= Total operating cost of the generating companies
maintained for backup generation for the system. T= Number of time period considered
N= Number of generating units considered
In this work, an Artificial Bee Colony (ABC) algorithm has r= Probability that the reserve is called and generated
been proposed to address the profit based unit commitment = Real power output of generator hour
problem (PBUC) under deregulated environment. Here, the = Reserve power generation of generator at hour
unit commitment scheduling has been done by Modified Pre-
prepared Power Demand (MPPD) table while Artificial Bee = Forecasted spot price at hour
Colony (ABC) algorithm is utilized to solve the economic = Forecasted reserve price at hour
dispatch problem.
= On/off status of generating unit at hour
2. FORMULATION OF THERMAL UNIT = Fuel cost function of generating unit at hour
COMMITMENT PRROBLEM , , = Cost coefficient of generator
Unit commitment can be defined mathematically as ST= Startup cost
optimal power flow problem as follows: The startup cost is given as
2.1 Objective function
(t)= ; (2.7)
The main objective of the unit commitment under
deregulated environment is to maximize the profit fulfilling (t)= ; > (2.8)
the system constraint. The profit can be found by subtracting Where,
the total operating cost of the company from the revenue
which can be obtained from sale of energy with market price. = Minimum time that the unit has been continuously
The total operating cost over the entire scheduling period is offline
the sum of the running cost and the startup/shutdown cost = +
for all the generating units. Here the shutdown cost is
considered as negligible. The overall objective function is The minimum down time of the unit
given as = hot start cost of generator
Maximize PF= RV-TC (2.1) = cold start cost of generator
In deregulated environment there are two markets i.e. spot
market and reserve market. Spot market is used for selling = cold start hour of generator
power and reserve market is used for selling reserve power. 2.2 Constraints
Here we will use mainly two methods for profit calculation 1) Load demand constraint: The generated power
considering both the market. from all the committed units must be less than or
Method A: Payment for power delivered equal to the system load demand and the equation
Here the power producer receives reserve price only for the is
time when the reserve is used. Therefore the reserve price is ; 1 t T (2.9)
higher than the spot price in this method. Where,
= Forecasted system demand during hour t

2) Spinning Reserve constraint: The sum of reserve 3. SOLUTION METHODOLOGY FOR UNIT
power of all committed units during the planning COMMITMENT
period must be less than or equal to total spinning The unit commitment problem can be considered as
reserve of power plants and it can be a two linked optimization sub problem. Here the unit
mathematically be defined as commitment scheduling is obtained from the Modified Pre-
; 1 t T (2.10) prepared Power Demand (MPPD) table and economic load
Where, dispatch is carried out by using Artificial Bee Colony (ABC)
algorithm.
= Reserve power of generating unit at
3.1 Unit commitment scheduling by MPPD table
hour All the steps which are involved to form the
= Spinning reserve during hour Modified Pre-Prepared Power Demand (MPPD) table are
3) Generator and Reserve power limits constraint: described below:
The equations are Step 1: For each generating units, the minimum and
; 1 i N (2.11) maximum values of lambda () at their minimum and
maximum output power i.e. and are calculated
- ; 1 i N (2.12)
by using the equations
+ ; 1 i N (2.13)
Where, . = (3.1)
=Real power generation of generating unit
=Reserve power generation of generating unit
= Maximum limit of generating unit . = (3.2)
= Minimum limit of generating unit
4) Minimum up/down time constraints: There is a Step 2: Now these lambda values are arranged in
certain time for which the running unit must be on. ascending order and index them as , where j=1,2,2N
This time is known as minimum up time. On the
other hand when a unit is de-committed, there is and N is the number of generating units.
also a minimum time to recommit the unit. This Step 3: For each value, the output powers of all
time is known as minimum down time. These generators are calculated using the equation
constraints can be represented as = (3.3)
; i=1,2,N (2.14)
Step 4: The minimum and maximum output powers
; i=1,2,N (2.15) of each generator are fixed as follows:
Where, For minimum output power limit
= Minimum time that the unit has been If < then put =0 (3.4)
continuously online If = then put = (3.5)
=Minimum time that the unit has been For maximum output power limit
continuously offline If > then put = (3.6)
The minimum up time of the unit
The minimum down time of the unit Step 5: Lambda () value, output powers ( ) and
5) Unit initial status: Generally the initial status of the sum of output powers (SOP) for each are recorded in a
units is represented by either positive or negative table in ascending request. This table is referred to as
value. The positive number indicates that the Modified Pre-Prepared Power Demand (MPPD) table.
corresponding unit is committed for those hours. Step 6: In this step we prepare the Reduced
Similarly if it is a negative number, it means that the Modified Pre-Prepared Power Demand (RMPPD) table.
unit is put off during that period. Profit is gotten just when the forecasted price at the
6) Must run unit: Generally in a power system, some given hour is more than the incremental fuel cost of the
of the units are given a must run status in order to given unit. The forecasted energy price plays an important
provide voltage support for the network or for role in preparing the RMPPD table. Therefore, the forecasted
other reasons such as fuel constraints etc. price is taken as the principle file to choose the Reduced
7) Must out units: These are the Units which are on MPPD (RMPPD) table from the MPPD table.
forced outages or maintenance unavailable for Step 7: Now it is required to form the Reduced
commitment. Committed Units (RCU) table which gives the status of
committed units. The RCU table is obtained from RMPPD The intelligent behavior of foraging bees can be summarized
table by substituting the binary values such a way that if any in three steps.
element in the table is non-zero, then it is replaced by 1. At the very first step, the bees start to explore the
Therefore, if the value is 1, then it is indicate that the unit is environment randomly so that they can find a food source.
in on state. Similarly if the binary value is 0, then the unit is At the second step, when the bees find a food source, the bee
in off state. can be referred to as an employed forager. Now the
Step 8: In this step we incorporate the no load cost. employed bees start to exploit the discovered scouts. The
Formulation of MPPD table is based on incremental fuel cost employed bees find the nectar amount and then return to the
(). Therefore no-load cost is not assumed in MPPD table. hive and give the nectar information to other bees. At the
There is a simple procedure to amalgamate the no-load cost. third step, the onlooker bees watch the dance performance
i) Production cost at the average of minimum output of the employed bees and choose a source site depending on
power and maximum output power is the frequency of the dance proportional to the quality of the
evaluated for all units. source.
ii) Now according to the production cost all units are
arranged in ascending order. 3.2.2 Control Parameter of ABC Algorithm
iii) On/off status of the units is also modified according There are for the most part four control parameters
to the ascending order of the production cost. utilized as a part of ABC algorithm and they are the number
iv) Keep going on-state unit at every hour is of employed bees, the number of unemployed or onlooker
distinguished. Status of the units are bees, the limit value and the colony size. Generally, the
supplanted as follows: number of employed or onlooker bees is equivalent to the
If any unit on the left side of the last on-state unit is in off quantity of food source. The value of limit is the quantity of
state then it is converted as on- state unit. trials for discharging a food source.
Step 9: Now it is required to check for the minimum 3.2.3 Steps involved in ABC algorithm
up time and down time constraints. In the event that the off Step 1: Initialization of Food Sources:
time of the unit is not as much as the minimum down time, Initially the food sources are generated by control
the status of the unit will be off. Similarly if the on time of the variable between their boundaries.
unit is more than the up time of the unit, then the unit will be (3.7)
on. This information is applied in the RCU table to perform
the final unit commitment scheduling. Where i=1, 2..SN
SN= Number of food source
J=1, 2. D
3.2 Artificial Bee Colony Algorithm
D= Number of optimization parameter
3.2.1 Introduction Step 2: Searching of Food Source by the Employed Bees:
Artificial Bee Colony (ABC) algorithm was proposed Now the employed bees produce a modification on
by Dervis Karaboga in 2005 which simulates the forging the position of the food source and for this they use the
behavior of a bee colony. This algorithm provides populace following expression.
based inquiry method. Here the food position are changed by
(3.8)
the simulated honey bees with time and the target of the
honey bee is to discover the spots of food source with high Where = Neighbouring food source of
nectar amount lastly the one with most noteworthy nectar. i= 1, 2SN
The food source represents a conceivable solution of the j=1, 2..D
optimization issue. The ABC colony consists of three types of k=1, 2.SN, which is different from i
bees and they are employed bees, onlooker bees and scout is a random number in the range [0,1]
bees. The employed bees occupy one half of the colony and
the onlooker bees occupy the other half. If then (3.9)
At first the employed bees search for the food sources. The If then (3.10)
number of food source and the number of employed bees are
equal. The employed bees find a neighboring food source Step 3: Finding the fitness value
around that area and the corresponding nectar amount of The fitness of the solution i can be found as
the food source is evaluated. Now, the employed bees convey Fitness (i) = 1+abs f(i) , if X<0 (3.11)
this information to other bees by a form of dance in the = 1/(1+f(i)), if X0 (3.12)
dancing area i.e. in the hive. Now, each onlooker bees which Where f(i)= objective function with the value of
is equivalent to the number of food source watches the
The objective function can be directly used as a fitness
dance of employed bees and decide on a food source to
function for maximization problem. The fitness value
exploit based on the information shared by the employed
represents the nectar amount of the food source
bees. Now the abandoned food sources are discovered and
these are replaced with the new food sources which are corresponding to and . If the source at is greater than
discovered by scouts.
in terms of fitness value, the employed bees memorize the 4. RESULTS AND DISCUSSION
new position and forgot the old one. The proposed method has been tested on systems
with 10 units. The unit data and load demand, Reserve and
Step 4: Calculating the Probability value Forecasted Price data for 24 hours for the systems with 10
The onlooker bees assess the nectar information. units has been taken from reference [8]. The final
The onlooker bees pick a food source contingent upon the commitment schedule for 10 units system is shown in the
probability value which is related with the food source. table-1. The comparison of the results obtained by proposed
method with various methods is shown in the table-6.
Probability, = (3.13)
Now for each source a real random number is generated Table-1: Commitment schedule for 10 units system
within the range [0, 1]. If the probability value of that food Hour U1 U2 U3 U4 U5 U6 U7 U8 U9 U10
source is more than this random number then a modification 01 1 1 0 0 0 0 0 0 0 0
on the position of this food source is occurred by the 02 1 1 0 0 0 0 0 0 0 0
onlooker bees. Now the onlooker bees either memorize the 03 1 1 0 0 0 0 0 0 0 0
new position by forgetting the old one or keep the old one. 04 1 1 0 0 0 0 0 0 0 0
05 1 1 0 0 0 0 0 0 0 0
06 1 1 0 1 0 0 0 0 0 0
07 1 1 1 1 0 0 0 0 0 0
08 1 1 1 1 0 0 0 0 0 0
09 1 1 1 1 1 0 0 0 0 0
10 1 1 1 1 1 1 0 0 0 0
11 1 1 1 1 1 1 0 0 0 0
12 1 1 1 1 1 1 0 0 0 0
13 1 1 1 1 1 1 0 0 0 0
14 1 1 1 1 1 0 0 0 0 0
15 1 1 1 1 0 0 0 0 0 0
16 1 1 1 1 0 0 0 0 0 0
17 1 1 0 1 0 0 0 0 0 0
18 1 1 0 1 0 0 0 0 0 0
19 1 1 0 1 0 0 0 0 0 0
20 1 1 0 1 0 0 0 0 0 0
21 1 1 0 1 0 0 0 0 0 0
22 1 1 0 1 0 0 0 0 0 0
23 1 1 0 0 0 0 0 0 0 0
24 1 1 0 0 0 0 0 0 0 0
4.1 Method A: Payment for power delivered

The power generation and reserve generation schedule for
10 units system by using Artificial Bee Colony algorithm is
shown in the table-2 and 3 respectively. Here the value of r
(Probability that the reserve is called and generated) is
taken as 0.05 and the forecasted reserve price at hour i.e.
is calculated by using the equation =5* ,
where is the forecasted spot price at hour. Again the
simulation results showing generation cost, revenue and
profit obtained by ABC algorithm for 10 units systems are
shown in table-4.
Table-2: Power Generation Schedule for 10 units system

Hour U1 U2 U3 U4 U5 U6 U7 U8 U9 U10
01 455 245 0 0 0 0 0 0 0 0
02 455 295 0 0 0 0 0 0 0 0
03 455 395 0 0 0 0 0 0 0 0
Fig-1: Flow chart of proposed algorithm 04 455 455 0 0 0 0 0 0 0 0
05 455 455 0 0 0 0 0 0 0 0
06 455 455 0 126 0 0 0 0 0 0
07 455 435 110 110 0 0 0 0 0 0 4 17353 21521 4168

08 455 455 128 128 0 0 0 0 0 0 5 17353 20248 2894
09 455 437 100 112 142 0 0 0 0 0
10 455 455 123 128 160 079 0 0 0 0 6 20153 23803 3650
11 455 455 130 130 162 080 0 0 0 0 7 22125 25313 3188
12 455 455 130 130 162 079 0 0 0 0
13 455 450 125 123 157 071 0 0 0 0 8 23058 25866 2809
14 455 452 100 127 158 0 0 0 0 0 9 25403 28924 3521
15 455 455 112 130 0 0 0 0 0 0
16 455 335 130 130 0 0 0 0 0 0 10 28838 41175 12337
17 455 415 0 090 0 0 0 0 0 0 11 29036 42556 13519
18 455 455 0 120 0 0 0 0 0 0
19 455 455 0 130 0 0 0 0 0 0 12 29020 44660 15640
20 455 455 0 126 0 0 0 0 0 0 13 28465 34157 5692
21 455 455 0 130 0 0 0 0 0 0
22 455 455 0 119 0 0 0 0 0 0 14 26173 31885 5712
23 455 445 0 0 0 0 0 0 0 0 15 22805 26012 3207
24 455 345 0 0 0 0 0 0 0 0
16 21106 24011 2906
17 18903 21805 2902
Table-3: Reserve allocation Schedule
18 20059 22774 2715
Hour U1 U2 U3 U4 U5 U6 U7 U8 U9 U10
1 0 70 0 0 0 0 0 0 0 0 19 20214 23088 2874
2 0 75 0 0 0 0 0 0 0 0
20 20155 23494 3339
3 0 60 0 0 0 0 0 0 0 0
4 0 0 0 0 0 0 0 0 0 0 21 20213 24023 3810
5 0 0 0 0 0 0 0 0 0 0 22 20043 23686 3643
6 0 0 0 4 0 0 0 0 0 0
7 0 20 20 20 0 0 0 0 0 0 23 17187 20532 3345
8 0 0 2 2 0 0 0 0 0 0 24 15497 18491 2994
9 0 18 30 18 20 0 0 0 0 0
Total 507880 620810 112930
10 0 0 7 2 2 1 0 0 0 0
11 0 0 0 0 0 0 0 0 0 0
12 0 0 0 0 0 1 0 0 0 0
13 0 5 5 7 5 9 0 0 0 0
14 0 3 30 3 4 0 0 0 0 0
15 0 0 18 0 0 0 0 0 0 0
16 0 105 0 0 0 0 0 0 0 0
17 0 40 0 40 0 0 0 0 0 0
18 0 0 0 10 0 0 0 0 0 0
19 0 0 0 0 0 0 0 0 0 0
20 0 0 0 4 0 0 0 0 0 0
21 0 0 0 0 0 0 0 0 0 0
22 0 0 0 11 0 0 0 0 0 0
23 0 10 0 0 0 0 0 0 0 0
24 0 18 0 0 0 0 0 0 0 0
Table-4: Simulation result showing generation cost, revenue

and profit Fig-2: Convergence characteristics of proposed method
Generation Revenue($) Profit($)

Hour cost ($)
1 13744 15893 2148
2 14620 16912 2293
3 16354 19982 3627
revenue and profit obtained by ABC algorithm for 10 units

systems are shown in table-5.
Table-5: Simulation result showing generation cost, revenue

and profit by method B
Generation Revenue($) Profit($)

Hour cost ($)
1 13689 15528 1839
2 14561 16525 1964
3 16307 19656 3349
4 17353 21521 4168
5 17353 20248 2895
Fig-3: Revenue, Cost and profit for the 10 units system 6 20214 23868 3654
7 22085 25003 2918
8 23009 25792 2783
9 26196 29634 3438
10 28432 40500 12068
11 28772 42098 13326
12 28376 43698 15322
13 28394 33889 5495
14 26184 31857 5673
15 23094 26309 3215
16 21032 23472 2440
Fig-4: Comparison of power generation and power demand 17 19429 22119 2690
18 20214 22932 2718
19 20214 23088 2874
20 20189 23523 3334
21 20166 23960 3794
22 20030 23622 3592
23 17179 20478 3299
24 15434 18067 2633
Total 507906 617387 109481
Table-6: Comparison of the results by TS-RP, LR-EP and the

Fig-5: Comparison of reserve demand and reserve allocation proposed method
Methods TS-RP [7] LR-EP [8] Proposed
method
4.2 Method B: Payment for Reserve Allocated Method A 110407 112818.9 112930
Here the value of r (Probability that the reserve is called and Method B ---------- 107838.5 109481
generated) is taken as 0.005 and the forecasted reserve price
at hour i.e. is calculated by using the equation
=0.01* , where is the forecasted spot price at
hour. The simulation results showing generation cost,
5. CONCLUSION
The generator maintenance planning in
restructuring environment is a testing errand for the power
engineers. So, the reason for this work is to acquire the
optimal solution of unit commitment under deregulated
environment. While tackling the profit based unit
commitment problem, the data with respect to the
forecasted price is known. Here the unit commitment
scheduling is done by Modified Pre-Prepared Power Demand
table and the generation of scheduled unit is tackled by ABC
algorithm. The feasibility of the proposed strategy has been
executed with the frameworks of 10 units in regard to load
demand.
REFERENCES
[1] E. H. Allen and M. D. Ilic, Reserve markets for power
systems reliability, IEEE Trans. Power Syst., vol. 15, pp.
228233, Feb. 2000.
[2] D. Karaboga, An idea based on honey bee swarm for
numerical optimization, Technical Report-TR06,
Erciyes University of Engineering, Faculty of Computer
Engineering Department, 2005.
[3] Karaboga D and Busturk B.A. 2007, Powerful and
efficient algorithm for numerical function optimization:
artificial bee colony optimization, Journal of global
optimization, 39: 459-471.
[4] C.P Cheng, C.WLiu and C.C, Liu, Unit commitment by
Lagrangian relaxation and genetic algorithm, IEEE
Transactions onPower System, Vol.15, No.2, 2000,
pp.707- 714..
[5] Narayana Prasad Padhy, Unit Commitment A
Bibliographical Survey, IEEE Transactions on power
systems, Vol.19, No.2, 2004, pp.1196- 1205.
[6] W.Yuan Xia.ohui, Yuan Yanbin, Wang Cheng and Zhang
Xiaopan, An Improved PSO Approach for Profit-based
Unit Commitment in Electricity Market, IEEE
Transaction on Power Systems, May 2005.
[7] T.A.A. Victoire, A.E. Jeyakumar, Unit commitment by a
Tabu-search-based hybrid-optimization technique, IEE
Proceedings.-Generation, Transmision, Distribution, vol.
152, no. 4, July 2005, Pages: 563-574.
[8] A. Pathom, H. Kita, E. Tanaka and J. Hasegawa, A hybrid
LREP for solving new profit-based UC problem under
competitive environment, IEEE Trans., 2003, PS-18, (1),
pp. 229237.

Irjet V4i5122 PDF

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Irjet V4i5122 PDF

Uploaded by

Copyright:

Available Formats

International Research Journal of Engineering and Technology (IRJET) e-ISSN: 2395 -0056

Volume: 04 Issue: 05 | May -2017 www.irjet.net p-ISSN: 2395-0072

ARTIFICIAL BEE COLONY ALGORITHM FOR PROFIT BASED UNIT

Kuldip Deka1, Dr. Barnali Goswami2

commitment formulation under deregulated environment. In RV= + (2.2)

= Forecasted system demand during hour t

4.1 Method A: Payment for power delivered

Table-2: Power Generation Schedule for 10 units system

07 455 435 110 110 0 0 0 0 0 0 4 17353 21521 4168

Table-4: Simulation result showing generation cost, revenue

Generation Revenue($) Profit($)

revenue and profit obtained by ABC algorithm for 10 units

Table-5: Simulation result showing generation cost, revenue

Generation Revenue($) Profit($)

Table-6: Comparison of the results by TS-RP, LR-EP and the

You might also like