Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
ongoing
demand
for
power
consumption is leading to serious stability problems in
electric power systems. If there are no impending
construction projects of new power plants or
transmission lines, such an increase can result in large
power losses of the system. DG integration in
distribution system is one of the viable options to
mitigate losses by providing peak shaving, over load
relieving
and
improved
reliability. The advantages of using a DG mainly depend
on its location and size. Therefore, selection of optimal
location and size of the DG is mandatory to maintain the
stability and reliability of existing system. However,
there is still no systematic and cardinal rule for this
issue. In this paper, firstly the optimal locations are
calculated using Single DG Placement Method and a
comparison is performed between three meta-heuristic
techniques like Genetic Algorithm(GA), Artificial Bee
Colony
Algorithm(ABC)
and
Shuffled
Frog
Algorithm(SFA) which are used for finding optimal
sizing of the DG, considering system loss
minimization and voltage profile improvement as
objective functions. This work is tested on IEEE 33 bus
distribution system and the results of each technique
are compared with each other to find out the best one
among the three techniques.
Keywords- ABC; DG Placement; Distribution Systems; GA;
Loss Reduction; Meta heuristic methods; SFA;
I.
INTRODUCTION
THEORETICAL BACKGROUND
PLTotal = I i2 Ri
(1)
i =1
PLa = I ai2 Ri
(2)
i =1
N
PLr = I ri2 Ri
i =1
where
(3)
PDG = Vm I DG
III.
new
ai
= I ai + Di I DG
(4)
Com
= (2 Di I ai I DG + D I ) Ri
2
DG c
(6b)
i =1
is
(7)
D I
i ai
I DG =
Ri
i =1
N
i =1
I R
=
R
ai
D R
corresponding DG sizes.
(5)
i =1
S = PLa PLa
= ( I ai + Di I DG ) 2 Ri
Com
PLa
(9)
(8)
If yes, go to 17.
Step 14: Perform genetic operations.
Step 15: Replace old population by the new population.
Step 16: Increment iteration count.
Step 17: Print the results. Go to 20.
Step 18: If iteration count is less than the max count, go
to Step 6.Else go to Step19.
Step 19: Print Problem is not converged.
Step 20: End of the algorithm.
B. Artificial Bee Colony Algorithm (ABC)
It was introduced in 2005 by Karaboga [15].Initially it
was developed for unconstrained optimization problem and
later it was extended for constrained optimization problem
[16].
Theory:
The
bee
colony
consists
of
three
groups:employed,onlookers and scout bees.The employed
bees randomly search for food source positions and share
the information by dancing with the onlooker bees waiting
in the dancing area at the hive.The dance duration is
proportional to the nectars content(fitness value).Hence the
onlooker bee chooses the food source position proportional
to the quality of that food source(fitness more).Thus if a
food source position is visited fully,it is abandoned by the
employed bee and it becomes onlooker bee where as the
employee bee abandons it with a changed status of
onlooker.If any food source is not visited then it is
abandoned and onlooker bee becomes a scout bee.Thus the
onlooker and employed bee perform the exploitation process
simultaneously where as scouts control this process.
a.
b.
c.
1
1 + Powerloss
(10)
(11)
fiti
fit
SN
F=mn.
Pi =
solutions Xi
n =1
(15)
Then it is updated.
(14)
(13)
(16)
DG Sizes
Active
Power
Losses (M.W)
2.5491
0.042677
Population size
60
ABC
6
2.4874
0.04221
40
TWO DG CASE
SFA
GA
2.5912
0.042184
128
THREE DG CASE
ABC
SFA
GA
ABC
SFA
15
15
15
15
15
15
32
32
32
1.9673
1.9213
0.6789
1.7335
1.9229
0.71385
0.9824
0.9681
1.1574
0.4644
0.5454
0.71385
0.6378
0.4779
0.71385
0.02473
0.02280
0.01849
40
128
0.03911
0.03581
60
40
0.0345
128
60
0.16
0.14
Ploss in 1000KW
0.12
0.1
0.08
GA
ABC
SFLA
0.06
0.04
0.02
0
NO DER
SINGLE DER
TWO DER
No of DER
THREE DER
FIGURE 2. ACTIVE POWER LOSSES COMPARISON BETWEEN GA, ABC AND SFLA
VI.
CONCLUSIONS
[10]
[11]
[12]
REFERENCES
[1]
[2].
[3]
[4]
[5]
[6]
[7]
[8]
[9]
[13]
[14]
[15]
[16]
[17]
[18]