4th Int’l Conf.
on Recent Advances in Information Technology | RAIT-2018 |
Optimal DG Allocation for Minimizing Active Power
Loss with Better Computational Speed and High
Accuracy
Arnab Pal, Ajoy Kumar Chakraborty, Arup Ratan Bhowmik, Bhaskar Bhattacharya
Department of Electrical Engineering
National Institute of Technology, Agartala
Jirania, Agartala, Tripura, India
arnabpal1994@gmail.com, akcalll@yahoo.co.in, arup.ee_nita@yahoo.com, bhaskarohmm@gmail.com
Abstract—This paper presents the optimal allocation of
Distributed Generation (DG) units in a distribution network for
minimization of active power loss with less execution time and
with better accuracy. The DG allocation problem is formulated
as a non-linear constrained optimization problem where power
loss has been taken as objective and various constraints have
been considered into the formulation. In this work, a new
algorithm, one by one search algorithm (OBOSA), to find out the
DG locations for minimum power loss has been proposed. To
show the effectiveness of the proposed algorithm, it has been
tested on a standard IEEE 33 and 69 radial distribution test bus
systems. The performance of OBOSA is compared with the
results found by grey wolf optimization (GWO) and ant lion
optimization (ALO) based techniques. Numerical results
demonstrate the tangible superiority of the proposed method in
achieving the optimum DG allocation with better computational
speed and high accuracy.
Index Terms— Active power loss minimization; Ant lion
optimization; DG allocation; Grey wolf optimization.
I. INTRODUCTION
Growth of electrical power demand is one of the largest
challenge for environment and economic. In this term DG is
having powerful impact in electric power system. DG is small
scale generation, scattered throughout a distribution network.
DG may be both type of source renewable and conventional. It
can supply power directly to consumer and grid also. For this
case no need to travel power through long transmission line
because of it situated at load side, that’s why power loss due to
transmit is minimized. Allocation of DG at non optimal place
can results in overvoltage or low voltage. Penetration level of
DG is a challenge for system planning engineers because up to
5% penetration level has negligible effects on the system and
up to 30% will cause serious effects [1].
Nowadays the soft computing techniques are mostly
employed tool for solving the optimization problems such as,
in [2] using particle swarm optimization (PSO) multiple DGs
has placed in a microgrid, combination of genetic algorithm
978-1-5386-3039-6/18/$31.00©2018 IEEE
and simulated annealing is used in [3] to find out the optimal
DG location and compared with simple genetic algorithm, ant
lion optimization (ALO) [4] is used for optimal locations and
size for renewable DG, tabu search [5], For placing DG in
radial distribution system an improved multi-objective
harmony search (HS) has been used in [6]. Using a newly
proposed hybrid grey wolf optimization [7] by solving non-
convex, discrete problem, loss has been minimized and bus
voltage was improved by optimal allocation of DGs. A method
for finding optimal allocation and sizing basically for
renewable energy to minimize total power losses in radial
distribution systems has been proposed in [10]. The problem
formulation has done as a single objective nonlinear mixed
integer-constrained optimization problem and it has solved
with combination the objective function and the nonlinear
constraints by using the augmented Lagrangian genetic
algorithm (ALGA). Majidi et al. [11] presented an optimal DG
allocation and sizing approach in a traditional distribution
network where the whole year load variation is taken into
account using cuckoo search algorithm. Most of these
techniques are optimization based. There is no guarantee that
solution gives same or best results for every time and situation.
If number of DG is more or for large network system they are
decreasing the accuracy and taking more time to converge to
give better results.
In this paper a newly developed OBOSA algorithm has
been proposed by which it is possible to find out that bus
numbers, where DGs should connect to get minimum power
loss. It is giving same and better results in every time. Each DG
size considered as 50 kW generations, and 5 and 10 number of
DGs has been allocated on IEEE 33 and 69 radial distribution
bus systems.
II. PROBLEM FORMULATION
A. Objective function
The total active power loss minimization is the objective
function.
4th Int’l Conf. on Recent Advances in Information Technology | RAIT-2018 |

Min. f = min(Ploss ) . (1) Step 1: Initialization: initialize the number of search

agents (NSA), number of iterations (itmax), and the dimension
(dim) of the problem.
Where, Ploss is the total active power loss in the distribution
Step 2: Grey wolf positions generation: randomly
bus system. generate search agent population which is DG locations by
GWO and the alpha, beta, delta wolves positions are
nb −1 initialized, and then calculate the objective function based on
Ploss = ¦ I i 2 ×Ri . (2) the load flow method for each search agent.
i =1 Step 3: Quality solution: check the constraints of each
search agent. If any constraint is not satisfied the results are
th discarded, otherwise, proceed to calculate objective function.
Where, nb = number of bus, I i = i branch current,
R = i th branch resistance. Step 4: Best positions: Alpha, beta, delta wolves positions
are updated, keep out the omega wolf and then including it, to
determine the best solution.
B. Constraints
• Voltage constraint Step 5: Search agent’s new positions calculation:
determine the new position of search agents and repeated the
Each and every bus should have a voltage limit, otherwise whole process.
DG may cause over or low voltage.
Step 6: Termination: when reached maximum iterations,
stop the process. Get results of optimum locations for DGs
Vmin ≤ V i ≤ Vmax for i=1 to nb . (3) which satisfy all the constraints.
The major steps have been shown by a flowchart in Fig. 1.
Where, Vmin = 0.91 and Vmax = 1.05
• DG penetration level
DG should not inject power more that penetration level in
the distribution system. The total active power load on 33bus
system is 3717kW. Considering the 20% penetration level of
total load is 743kW and for 69bus, the total load is 3802.3kW.
So, we can penetrate DG maximum 760.47kW.

nDG

¦P
i =1
i
DG
≤ 743kW . (4)

• Power equality constraint

Total power supply by utility and DG should be balance
with total load and

PU + PDG − Ploss − Pload = 0 (5)

Where, PU = power supply from utility, PDG = power

generate by all DG, Ploss = total power loss in network, Pload =
total load in network.

III. ALGORITHMS USED

A. Grey Wolf Optimization

Different steps have taken to apply GWO for optimal
allocation of DG location. The steps are as follows:

Fig. 1. Grey Wolf Optimization [9]

978-1-5386-3039-6/18/$31.00©2018 IEEE
4th Int’l Conf. on Recent Advances in Information Technology | RAIT-2018 |
B. Ant Lion Optimization
To solve optimal DG allocation by ALO, many steps has
been followed. The major steps have been shown by a
flowchart in Fig. 2.
Fig. 2. Ant lion optimizer [8]
C. One by One Search Algorithm
The taken steps for DG allocation of the proposed one by
one search algorithm are:
Step 1: Initialize nDG= the number of DG, pen_lv =
penetration level and PL min = total loss without DG.
Step 2: Set i = 2 to nb, where nb = number of bus.
Step 3: Read the system’s bus data and line data, like
branch impedance, branch resistance, load on each bus.
978-1-5386-3039-6/18/$31.00©2018 IEEE
Step 4: By subtracting 50kW from that bus’s load, connect
only one DG at ith bus.
Step 5: Run the backward forward load flow and calculate
the total active power loss ( Ploss ) and bus voltages.
Step 6: If the total active power loss is less than PL min ,
(3), (4) and (5) are satisfied, store the total active power loss
to PL min , voltages to Vlim , and DG bus numbers to DGloc array.
Step 7: Increase i to next number and go to Step 3.
Step 8: Stop this process after calculate for up to i having
it’s last number.
Step 9: Check DGloc array and connect DG at those
locations permanently by changing bus data permanently.
Step 10: Set i = 2 to nb
Case1: Except that number at which buses DG is already
connected permanently. And go to Step 4.
Case2: Go to Step 4 to allow connect DG at that bus which
already has connected DG.
Step 11: Stop this total process when size of DGloc array
size becomes equal to number of DG (nDG). And see the
results DGloc , PL min , Vlim .
This algorithm searches one after one best location, first it
is searching for one DG where it should connect for which loss
is minimum and then without that previous location. Then it is
searching another one new best location among remaining
buses (for Case 1) or all the buses (for Case 2) in the network
system and then so on. Finally it gives nDG number of
locations.
IV. RESULTS AND DISCUSSION
The programs for GWO, ALO and OBOSA have been
written in MATLAB-7.7.0.471 (R2008b) language on a
computer having 2.27 GHz Intel core (TM) i3 CPU M 350
with 3-GB RAM.
TABLE I. POWER LOSSES OF IEEE 33 AND 69 BUSES WITHOUT DG
Distribution Active power loss Reactive power loss
systems (kW) (kVar)
69 bus 224.9827 102.1584
33 bus 202.4733 135.0311
Table I shows the total active and reactive power losses in
the IEEE 33 and 69 test bus radial distribution systems without
using DG. Results have been taken using backward-forward
sweep load flow technique.
In Table II and Table III, Because of soft computing
techniques give little bit different result for each time run, the
best result has taken by using GWO and ALO after the
multiple times of run. For OBOSA, there is no need to compute
multiple times, results has taken by only one time run, because
OBOSA gives same result for every time.
4th Int’l Conf. on Recent Advances in Information Technology | RAIT-2018 |
TABLE II. DG ALLOCATION ON 33 BUS SYSTEM Table IV is presented two different cases. Case 2 is giving
DG
little better results than case 1. For case 1, there is no repetition
5 10 of bus numbers. In case 2, for same number of DG it is giving
No
Algor repeated bus numbers. For 5 DG allocation it is suggests to
GWO ALO OBOSA GWO ALO OBOSA
ithm connect 2 DGs on bus number 18 and remaining 3 DGs on
16,33,
33,1 10,17,32 28,32,1
18,17,16,3 deferent buses. Same for 10 DG allocation it is better to
DG 7,18, 18,17,16 ,13,9,18, 4,18,12 connect 2 DGs on bus number 18 and 3 DGs on bus number 32
18,32, 3,32,15,31
buses 14,1 ,33,32 11,33,31 ,30,10,
17
2 ,16 15,33,8
,14,13,30 and remaining 5 DGs on other different buses, so total number
Loss 171.3 171. 171.307 148.210 149.62 of DGs is same with minimum loss. In practical aspect it is
146.6382 possible to marge 2 or 3 DG to make one DG on a bus, by
(kW) 072 9415 2 8 75
Time( 223.2 23.9 4.12004 300.465 22.045
6.331574
doing this cost minimization may also be possible.
Sec) 930 5976 4 7 36
Case1: Using OBOSA, where it is not allowed to connect
Table II shows the comparison of best solutions for active one more DG when there is already one DG in that bus. So,
power loss minimization for IEEE 33 radial distribution test result bus numbers is unique to each other’s.
bus system, offered by proposed OBOSA with other
evolutionary meta-heuristic techniques reported in the recent Case2: Using OBOSA, where it is allowed to connect DG
literature, like ALO and GWO respectively. For that, 5 and 10 on that bus in next iteration in which DG is already connected
number of DGs has been allocated and each DG size has been by any previous iteration. By this it can search that, which is
considered as 50 kW. To allocate 5 DGs, GWO and OBOSA is better between these two, 1. Connect DG on remaining buses is
giving same result which is better than ALO’s result. But ALO giving less loss or 2. Again connect one more DG on that bus
is taking less time compare to GWO. OBOSA is taking very which already having DG is giving less loss.
less time than other two methods and also provides good
results. Even to allocate 10 DGs, it is giving better results than
GWO and ALO both with consuming only few seconds.

TABLE III. DG ALLOCATION ON 69 BUS SYSTEM

DG
5 10
No
Algor OBOS
GWO ALO GWO ALO OBOSA
ithm A
11,36,
57,35,59,
60,62, 31,60, 59,64, 65,64,63,61,
DG 65,64,6 56,55,58,
61,64, 64,63, 61,60, 62,60,26,21,
buses 3,61,62 61,68,60,
63 65 26,62, 20,16
63
63,13
Loss 187.6 194.5 150.26 174.1
178.693 76.8532
(kW) 803 028 51 302
Time( 1442. 472.1 30.844 1748. 438.8204
61.94736 Fig. 3. 33 system bus voltages without DG
Sec) 38128 0183 69 95873 8

Table III shows the comparison of best solutions for active Fig. 3 and Fig. 4 show each bus voltages in per unit when
power loss minimization for IEEE 69 radial distribution test DG is not connected, for 33 and 69 distribution bus system
bus system, offered by proposed OBOSA with other respectively.
evolutionary meta-heuristic techniques reported in the recent
literature, like ALO and GWO respectively. In this case for
allocating 5 and 10 DGs using proposed OBOSA is giving far
better result in terms of DG placement with less execution time
with respect to GWO and ALO based optimization techniques.

TABLE IV. COMPARISON OF CASE 1 AND CASE 2 FOR IEEE 33 BUS

SYSTEM
DG
Case DG buses Loss(kW) Time(Sec)
No
Case1 18,17,16,33,32 171.3072 4.120044
5
Case2 18,18,17,33,16 171.2667 4.756585
18,17,16,33,32,15,31,1
Case1 146.6382 6.331574
4,13,30
10
18,18,17,33,16,32,32,1
Case2 146.2375 7.322955
5,32,14
Fig. 4. 69 system bus voltages without DG

978-1-5386-3039-6/18/$31.00©2018 IEEE
4th Int’l Conf. on Recent Advances in Information Technology | RAIT-2018 |
Fig. 5. DG allocation on 33 bus
After connect 5 and 10 number of DG on 33 bus system
using GWO, ALO and OBOSA the total active power loss’s
graph presented in Fig. 5 and for 69 bus in Fig. 6. It is seen to
allocate 5 number of DG on 33 bus system the GWO and
OBOSA is equally efficient but when number of DG is 10
OBOSA is giving better results and also when system is large
69 bus system then it can be notice OBOSA is far better result
especially to allocate 10 DG on 69 bus system in Fig. 6.
Fig. 6. DG allocation on 69 bus
Fig. 7. Computation time of different algorithms
978-1-5386-3039-6/18/$31.00©2018 IEEE
Execution time graph for GWO, ALO and OBOSA is
presented in Fig. 7. It is clear from this plot that in every case
time consumed by OBOSA is less. To allocate 5 and 10 DG on
33 bus taken time by ALO is only little more than OBOSA,
But when network is 69 bus system then it is taking more time
to give possible better results. GWO is always talking more
time to converge.
Fig. 8. Comparison between Case 1 & Case 2
In Fig. 8 power loss minimized on 33 bus system for case1
and case2 have shown. To allocate both 5 and 10 DG with
case2 which was allowing connecting multiple DG on a single
bus, is gives more loss minimization.
Fig. 9. Output voltages at a-b-c terminals for a switching state
Fig. 10. Output voltages at a-b-c terminals for a switching state
4th Int’l Conf. on Recent Advances in Information Technology | RAIT-2018 |
Using OBOSA, the bus voltages of that bus at which DG is
connect after the optimal allocation on 33 and 69 bus system is
shown in Fig. 9 and Fig. 10 respectively for 5 number of DG.
V. CONCLUSION
In this paper, the total active power loss of IEEE 33 and 69
bus radial distribution systems has been reduced by optimal
allocation of DG using grey wolf optimization, ant lion
optimization and proposed one-by-one search based algorithm
respectively. Initially, the backward forward sweep load flow
of the test system was performed before allocation of DG.
Then a DG was optimally allocated and sized using GWO,
ALO and OBOSA respectively, such that the loss is minimized
after DG penetration. In this paper, DGs are acting as active
power sources, so only active power loss has been minimized.
But, it can also be possible to reduce reactive power loss with
consideration active and reactive both power source of DG.
From the results, it can also be concluded that, proposed
OBOSA can be efficiently used to resolve large-scale DG
allocation problems in the near future.
REFERENCES
[1] Atwa YM, El-Saadany EF., “Optimal allocation of ESS in distribution
systems with a high penetration of wind energy.” IEEE Trans Power
System, vol. 25, no. 4, pp. 1815–1822, 2010.
[2] Prommee W., Ongsakul W., “Optimal multiple distributed generation
placement in microgrid system by improved reinitialized social
structures particle swarm optimization,” Eur. Trans. Electr. Power, vol.
21, no. 1, pp. 489–504, 2011.
[3] Gandomkar, M., Vakilian, M., Ehsan, M. "A combination of genetic
algorithm and simulated annealing for optimal DG allocation in
978-1-5386-3039-6/18/$31.00©2018 IEEE
distribution networks." IEEE Canadian Conf. of Electrical and
Computer Engineering, 2005.
[4] Ali, E. S., SM Abd Elazim, Abdelaziz, A.Y., "Ant Lion
Optimization Algorithm for optimal location and sizing of
renewable distributed generations." Renewable Energy, vol. 101, pp.
1311-1324, 2017.
[5] Koichi, N., Hayashi, Y., Ikeda, K., Ashizada, T., "Application of tabu
search to optimal placement of distributed generators", IEEE Power
Engineering Society Winter Meeting, 2001.
[6] Nekooei, K., Farsangi, MM., Nezamabadi-Pour, H., Lee, KY., "An
improved multi-objective harmony search for optimal placement of DGs
in distribution systems", IEEE Transactions on smart grid, vol. 4, no.1,
pp. 557-567, 2013.
[7] Sanjay, R., Jayabarathi, T., Raghunathan, T., Ramesh, V.,
Mithulananthan, N., "Optimal Allocation of Distributed Generation
Using Hybrid Grey Wolf Optimizer." IEEE Access, vol. 5, pp. 14807-
14818, 2017.
[8] Reddy, P. Prasasd, D., Veera Reddy, VC., Gowri Manohar, T., "Ant
Lion optimization algorithm for optimal sizing of renewable energy
resources for loss reduction in distribution systems", Journal of
Electrical Systems and Information Technology, in press, 2017.
[9] Sultana, U., Khairuddin, AB., Mokhtar, A.S., Zareen,N., Sultana,B.,
“Grey wolf optimizer based placement and sizing of multiple distributed
generation in the distribution system”, Energy, vol. 111, pp. 525-536,
2016.
[10] Hassan, AA., Fahmy, FH., Abd El-Shafy A. Nafeh, Mohamed, A. Abu-
elmagd, "Genetic single objective optimisation for sizing and allocation
of renewable DG systems", International Journal of Sustainable Energy,
vol. 36, no. 6, pp. 545-562, 2017.
[11] Majidi, M., Ozdemir. A., Ceylan. O., "Optimal DG allocation and sizing
in radial distribution networks by Cuckoo search algorithm." IEEE 19th
International Conference on Intelligent System Application to Power
Systems (ISAP), 2017.