Downloaded from http://iranpaper.

ir
http://www.itrans24.com/landing1.html

Application of Tabu Search to Optimal Placement of Distributed Generators

Koichi Nara Yasuhiro Hayashi Kazushige Ikeda Tomoo Ashizawa

Member, IEEE Member, IEEE Non-member, IEEE Non-member, IEEE
Dept. of Systems Eng. Dept. of Electrical Erg. Transmission & Distribution, Transportation Systems Dept.
Ibwaki University Fukui University Mitsubishi Electric Co.
Hitachi, Japan Fukui, Japan Kobe, Japan

Abstract: Distributed generators (DGs) such as fuel cells, solar In this paper, in Chapter 2, the loss minimum DG
cells, wind mills and micro gas turbines, etc. are going to be allocation problem is formulated. The solution algorithm
installed in demand side of power systems. Such distributed based on the tabu search is shown in Chapter 3, In Chapter
generators can reduce distribution loss if they are placed
4, numerical examples are shown to demonstrate the
appropriately in the distribution system. In this paper, tabu search
method. The validity of the solution algorithm is verified
application for tinding the optimal ‘allocation of DGs from a
viewpoint of loss minimization is illustrated. In other words, the by comparing the calculation results with those by the
authors discuss about an implementation method of tabu search to simulated annealing method.
find how much distribution loss can be reduced if DGs are
optimally allocated at the demand side of a power system. 2. FORMULATION OF THE PROBLEM
Namely, locations and discrete capacities of DGs to minimize the
distribution loss are determined by nested use of the tabu search The problem is to determine allocation and size of DG
algorithm. Numerical examples are shown to demonstrate the which minimizes the distribution loss under the condition
method. that number of DGs and total capacity of DGs are known.
The following assumptions are adopted to formulate the
Kevwords: Tabu search. Distributed zenerator. Distribution problem.
Sy;tem, Optimal allocation problem, Loss minimization. ● Section load is uniformly distributed balanced constant
current load,
● Power factor of section load is 1.0.
I INTRODUCTION ● Candidates of DG installation position for every feeder
section are given.
Recently, many distributed power generation systems c Capacity of distributed generator must be selected among
(DGs) are installed in demand side, and are directly given capacity candidates (discrete values).
connected to the distribution system. In such a power ● One DG can be allocated for one candidate position.
distribution system, many complicated problems may “ Maximum number of installable DGs is given.
occur: for example, voltage increase at the end of a feeder, ● Total installation capacity of DGs is given.
demand supply unbalance in a fault condition, power The problem can be formulated as follows.
quality decline or voltage wave distortion in demand side.
On the other hand, many advantages such as substitution of [Objective function]
large scale (nuclear, for instance) generators, extension of t- .X
Minimize Z = ~ Lo~~;)(J&’) (1)
facility expansion schedule and loss reduction, etc. So far, t-1 ? -1
many papers which discusses about the optimal planning
and operation of the distributed generators have been ID$/= }lBjkg(’) “njk(g)
.
published[l]-[5].
(j=l,2,...,SC, k=l,2,...Jf, t=l,2,...,fJ (2)
In this paper, the authors illustrate an implementation
method of tabu search (TS)’61[7]to investigate how much
distribution loss can be reduced if DGs are optimally [Constraints]
allocated at the demand side of the power system, under the (Total capacity of DGs)
SCMN
conditions that number of DGs and total capacity of DGs
are known. Since power utility cannot control installation
~,~,~,cgnjk(g)
sG (3)

and operational strategies of DGs, the purpose of this (Maximum number of DGs)
io~~e~tigation is only to pKwide the information to the
utility: namely, how math distribution loss can be reduced
through the optimal DG allocation, or what kinds of DG (Only one DG can be installed in one installation position)
installation strategy is effective to reduce the distribution
loss for the utility. In order to investigate the above,
determination method of the optimal allocation and size of
jnjk(g)sl (j=l,2 , . . ...SC. k=l.J4)..J4) (5)
g-l

DGs to minimize the distribution loss based on a nested use (Operational conditions of DGs)
of tabu search is developed. Each tabu search is used for (1) ~ f-g
Bjkg
determining capacity of each DG and for searching a
(j=l,2,...jX, k=l,2,...M, g=l,2,...fl, t=l,2,...,tJ (6)
location of each DG respectively. Brief explanation of
Tabu Search is shown in Appendix 1.

0-7803-6674-3/00/$10.00
0-7803-6672-7/01/$10.00
(C)(C)
2000
2001
IEEE
IEEE 918
 Downloaded from http://iranpaper.ir
http://www.itrans24.com/landing1.html

f ( Bjkg(”,Cg) s O

(j=l,2,...,sc, k=l,2,...Jf, g=l,2,...N, t=l,2,...,ta)a) (7) w

SC! initial installation position
where,

m
./
Lossh(’):distribution loss at section h at time f,
I,,<;./~: output of DG at k-th location in section j on time t, Create neigbborhcmd solution

rrj,~’: O-lvariable for determining whether one DG with g-th

capacity is allocated at k-th location in section j or not (O: Calculate objcctwc function (d,strlbutwn loss)

not allocated, 1: allocated, j=l-sc, k=l-kf. g=l-N):

see Fig.1,
Sc: total number of sections,
N : total number of capacity types of DGs,
No
M: total number of DG location candidates for each section,
t~,: maximum number of time period t,
Update the current solution
c,: capacity of g-th DG(discrete value), 1

r--a
.,

H: total number of installable DGs,

G: maximum capacity of installable DGs
B,~,{’):output of DG at time t which is installed at k-th position of
section j with g-th capacity. No

Scctiun jofa(iistribution fc. d(j=3)

c
A.airlahle inslailal ion position in section j(k.1 - 4) Dctcrminc the optinlai solution (poskion K! c:iptlcily)
~
(ZZ)

722Laz-oc
II
Avair. ble capacity

CJ=0,2[MW]
C,=0,3[MW]
C,={1,4[MWJ
C,=
Capacity

O.5[MW]
of DG:C,
=c1xrr32(’1

—
&
Distribu!cd

Dislril,.
=0.1

!i.
[MW]

gcneralor(DG)

n f.cds
●

●
1 : Discrete

‘ 3 : Discrete

Fig. 2
value of the DG capacity
2 : Diwctevalueof

3.
the DG capacily
value of the DG capacay
is set in al~>rithm
is set in .Ig>rithm
is ..! in .l~?rithm

General flowchart of solution algorithm

SOLUTION ALGORITHM
3
1.
2.

Fig. 1 Relationship between location and output current of a n of Solut ion alggmlhm
distributed generator and variable trj~) (j=3, k=2, g=l) To simplify the solution algorithm, the determination
algorithm of the allocation of DGs and the search algorithm
The above formulation shows that the problem is to of the sizes of DGs are disconnected, and decomposition I
determine O-1 variables, nj/) (allocation and size of DG) to coordination technique is introduced in the algorithm. That
minimize Z in eq.(1) under the constraints of eq.(3)-eq.(7). is, firstly, by TS, allocations of DGs (j and k of O-1
Calculation method of distribution loss in eq.(1) is shown variables nj~@) are temporarily fixed under the conditions
in Appendix 2 when section load is uniformly distributed. of eq.(5) and (6). Next, for the DG allocation obtained by
Eq. (7) shows various operational constraints of DGs. temporarily fixed position ~ and k of 0-1 variables nj~(~’),
From the above formulation, it can easily be found the size(capacity) of each DG( g of O-1 variables nj~’) is
that the problem includes the optimal operational problem calculated by TS which minimizes Z(eq.(1)) under the
to determine Bjk~ ((J. In this paper, it is assumed that l?j~g~c)
is constraints of eq.(4). The above two procedures are
pre-determined by some optimization method as [8]. Here, repeated until specified iteration number reaches.
for simplicity, let us assume that Bj~~(’)=C~for any t. This The general flowchart of the solution algorithm is
assumption shows that DGs are operated with its rated shown in Fig.2. Three kinds of algorithms are
output in any time, and means that eq.(6) & (7) are reduced simultaneously shown in Fig.2 according to the procedure
to %: ‘“=C g. In this case, the rated capacity (discrete value) where rounding operation of DG capacity by TS is
of DGs can be calculated by roundizg the continuous calculated. In algorithm 1, rounding calculation is operated
solution of [~tij~~’) so as to minimize eq.(1) under the whenever installation position (j,k) is fixed. In algorithm 2,
constraint of eq.(3). (’~can be found by solving the
lI)Gjk rounding is done when local minimum is found by seeking
following simultaneous equations (eq.(8)). the installation position (j,k). In algorithm 3, rounding of
DG capacities is done after the optimal installation
positions of DGs are determined. For the all algorithms, as
an initial solution to determine the discrete DG capacity by
Where, Q is a set of (j)k) to which distributed generator is TS, simply rounded values of DGs W3@ ~f)(;,k(’) calculated

connected. In the following chapter, a solution algorithm is by solving a simultaneous equation of eq.(8) are used.
discussed only for a case Bj~$(’)=C~.

0-7803-6674-3/00/$10.00
0-7803-6672-7/01/$10.00
(C)(C)
2000
2001
IEEE
IEEE 919
 Downloaded from http://iranpaper.ir
http://www.itrans24.com/landing1.html

3.2. Definition of neighborhood solution then, the aspiration criterion is satisfied, and the move to
(1) For searching installation position (jjk) the neighborhood solution is permitted even though the
The neighborhood solutions of TS for searching move direction is in the tabu list. In this case, the
installation position of DGs are defined as all of the corresponding tabu direction is removed from the tabu list,
solutions that are created by adding one DG to a new and move to the direction is forced.
position where no DG exists or by deleting one existing
DG, and that satisfy eq.(4) & (5) simultaneously. We can
see the details of neighborhood solutions by using a (jjk)
position matrix shown in Fig.3. In Fig.3, lower left figure
shows a neighborhood created by adding one generator at , 4 , ,0,, 161922’” I 4 7101318 !9220!] 1 4 7 10 13 16 19 22[,]

position (j,k)=(2,1). Lower right figure shows a case where (a) Industrial (b) Commercial (c) Residential
Fig.5 Examples of daily load curve for each section
DG is deleted from (j,k)=(4,4).
All the combinations of the
above may be used as neighborhood solutions for one
iteration of TS.

~~.~mj
Avairablc installation position i“ a swtion

I Feeder3 500 kW
500 kW
(Residential Area)

Feeder4

(k- d@rial Area) _

Current solution (position of DGs)
300 kW
~ 500 kW&
500 kW
add one DC delete one DG
6 OG ❑ %.tio.ahzing SW(Open) F&ctional,zingSW (Close)
A’”
*.)+ .=\ L::ti Fig. 6 (a) Optimal location and capacity (case 1)
L’! f L
:.1 0!0 o 0 .,:1 0 0 0 II
?il 11 !) 1) o 0 0 1)
0[0
.... 0..
............... o .. . .. . .fO. ,,,0.(!
,,.!0., [ Feederl 400 kW
0!0 400 kW
,,,...
,,_ ....!!. ..,!..,, ...!!....
...!!...
...!!+.
%&
0!0 1) o o -,
,,--,4) .,Jl_
,“0. ❑
j .+m oil o 0, j <SC (t 1 0 0 200 k
Tr. 00 kW
Neighborhood solution (candidate of DG installation position) (Coqarcial Oistti:t)

100 kW 400 kW
Feeder3

Fig. 3 An example for creation of DG location

(Industrial Are
Capacily dccrcase
~.,1.2g=3~.4g.5

EEIIEEl $’ IX ❑ S=tionalizing SW (Open) ➤ *’tiOnafizing ~ @JOSe)

*.1*. 18, ,g.4g.5

Fig. 6 (b) Optimal location and capacity (case 2)
010101011
Capacity increase
~ N.ighborh..dSolution >
Table 1. Simulation results for each case
of the Cavacitv
Casel Case2
Fig. 4 An example for creation of installed capacity of DG. Atg.1 Alg.2 Alg.3 Alg.1 Alg.2 Aig.3
Total distribution 1823 lf3~3 1211 129z l~gg
1725
loss [kW]
(2) For searching discrete DG capacity (g,) Number of DGs 10 10 10 20 20 17
Neighborhood solutions are created by deviating Total capacity of ~ooo 4000 4000
4000 4000 4000
DGa [kW]
discrete capacity of each DG of the current solution to the Calculation time
5S72 103 59 15361 216 121
lower and upper adjacent discrete capacities under the [Sec.]
constraint of eq.(3). For instance, in Fig.4, neighborhood
Table 2. Data of distributed generators
solutions of the current capacity (g=4) for a DG located at Caae 1 Case2
(j,k) are g=3 for lower adjacent capacity, and g=5 for upper Maximum number of DGa 10 ’20
adjacent capacity. To create neighborhood solutions for one Upper limit of total DGa capacity [kW] 4000
Number of availab!c instcl!z$iw of ES
iteration of the TS to determine discrete DG capacities, the in a position in one Section
4

above deviations are tried for all the DGs installed in the Number of available kinds of capacity 5
system. Available capacity of DGs [kW] 100, 200, 300, 400, 500
Time period [h] 6 (11:00- 16:00)

3.3. Definition of tabu move and aspiration criterion Table 3. Parameters for solution method
In every iteration of TS, the opposite direction for the Maximum number of iterations (position) 200
Maximum number nf iterations (capacity) 50
selected move is memorized in the tabu list as “tabu Tabu length 5
direction”. If a value of the objective function for a
neighborhood solution is better than the best solution so far,

0-7803-6674-3/00/$10.00
0-7803-6672-7/01/$10.00
(C)(C)
2000
2001
IEEE
IEEE 920
 Downloaded from http://iranpaper.ir
http://www.itrans24.com/landing1.html

4. NUMERICAL EXAMPLES
Table 4. Simulation results for each case
Case 1 Case2
The algorithms (algorithm 1 – algorithm 3) are tested Alg.2 Alg.3 ,Qg,~ .41g.3

by using two example distribution system models in which Total distribution loss
26554 35250 13044 18647
[kW]
industrial, commercial and residential loads coexist. Model
Number of DGs 15 14 30 30
1 (1s/s, 4 feeders and 28 sections) is shown in Fig.6, and Total capacity of DGs
13,7 13.7 14.8 14.9
model 2 (4 SIS, 6 feeders and 78 sections) is shown in Fig.7. &w]
Calculation time ~ in. ] 403 1s4 981 266
Two cases in which number of installable DGs are different
are calculated for two models. For each case, daily load
curves for industrial, commercial and residential areas are
created by randomly changing the curves shown in Fig.5.
The calculation results, parameters for DGs and
-z
parameters for tabu search are shown in Table 1, Table 2 position in one section
Number of available kinds of capacity 5
and Table3 for model 1, Table 4, Table 5 and Table 6 for Available capacity of DGs [kW] 100,200,500,1000,2000
model 2, respectively. From these tables, it can be found Time psriod [h] 6 (11:00-16:00)
that loss for case 2 is better than that of case 1 even though
Table 6. Parameters for solution method
the total installable capacity of DGs is the same. It is Maximum number of iterations (position) 400
because the number of DGs in case 2 is larger than that of Maximum number of iterations (capacity) 100
case 1, and prudent allocation of DGs is available in case 2. Tabu length 40
It can also be found that algorithm 1 can find the most
Table 7. Comparison of the results with SA
accurate solution, and the calculation speed is the fastest in
algorithm 3 as easily estimated from the characteristics of Tabu search
Simulated annealing
the algorithm. Note that calculations of algorithm 1 of Alg.1 .41g.2 “Ng.:1
model 2 did not completed within 72 hours, and the results Total distribution
1964 1’725 1823 1823
are not shown in Table 4. loss pzwq
Calculation time [Sec.] 392378 5872 103 59
Feedwl 500 Feedwi
2oeoW
(Resicbntid ma) 3QO+IkW (lndAfidl are ) Table 8. Parameters of SA
.? L.?
t
Initial temp. Cooling rate
54J3kW I
[1
1 [ 6000 0.99
S03 kW Tr3
(~ ‘b
T, 1 ?.
500 kW D J
Table 7 compares the calculation results of the above
I 1“
algorithms with that of simulated annealing (SA) method.
(h-mm
I Fee&d
dstnct)
10CO kW d Fee&i5
(Residential mea
Parameters for the simulated annealing are shown in Table
8. The calculation results by TS are better than those of SA.
‘- fp- “h -$:4
5e0 kw , 10COkW
500 kw

c
Tr4
Fee&w2
Feedws 6. CONCLUSION
(rqmlw m’kd 6s o
Tr2 d
-7
2000 kW 100Q kW 10XJkW In this paper, detailed implementation method of tabu
■ IX (Cbss) ❑ , WI (@~ E :%dm~ei% SW (UC80) ❑ :SectkmdtiIK SW (@en)
search (TS) algorithm to the optimal placement problem of
Fig.7 (a) Optimal location and capacity (easel)
distributed generators in a distribution system is illustrated.
Several techniques, decomposition/coordination technique
for example, are introduced to implement TS to the
problem. From the numerical examples, it can be found
that the calculation results are better than those of SA, and
the method can be applicable to the problem.

L1
[1] R. C. Dugan, S. A. Thomas et.al.: “Integrating Dispersed
Storage and Generation (DSG) with An Automated
Feed9r3
Distribution System”, IEEE Trans. PAS, ppl 142-ppl 146
- (Mlstlial *.$ (1984)
Tr2
[2] D. T. Rizy, W. T. Jewel] et.al.: “Operational and Design
lmkw Zrmkw Considerations for Electric Distribution Systems with
■ C3(m.w) •~(bt P --~(~) ❑ ~~(w Dispersed Storage and Generation (DSG)”, IEEE Trans.
Fig.7 (b) Optimal location and capacity (case2). PAS, pp2864-2871(1985)

0-7803-6674-3/00/$10.00
0-7803-6672-7/01/$10.00
(C)(C)
2000
2001
IEEE
IEEE 921

0-7803-6674-3/00/$10.00 (C) 2000 IEEE

 Downloaded from http://iranpaper.ir
http://www.itrans24.com/landing1.html

[3] K. Nara, S. Yamashiro,’’Effective Allocation and Operation C( X j : objective function value for solution X .
of Dispersed Energy Storage Devices in Power Systems
Restoration State”, Electrical Eng. in Japan, VO1.1O6, No.1
(1986) In the above algorithm, function OPTIMUM find the
[4] L. Soder.:’’Estimation of Reduced Electrical Distribution minimum solution around the neighborhood of the current
Loss Depending on Dispersed Small Scale Energy solution.
Production”, Proc. of 12’h PSCC, VO1.2, pp.1 229-1234 -1 .
(1996) If we defines’1 as the inverse direction of s , s ]s
[5] N. S. Rau, Y. H. Wan: “Optimal Location of Resources in memorized in the tabu list for t more iterations; that is,
Distribution Planning”, IEEE Trans. PWRS, Vol. 9, No.4 T={s-l:s=sh for h>k-t}
(1994)
[6] F. Glover:’’Tabu search-Part I “, ORSA J. Computing, T is updated in k-th iteration as
Vol.1, No.3 (1989)
[7] F. Glover:’’Tab.u search-Part II “, ORSA J. Computing,
T:= T–s~ft+s~l
VO1.2, No.1 (1990) If necessary, we can add other strategies as aspiration
[8] K. Nara, et.al.: “Loss Minimum Operation of Flexible, criterion, stochastic move etc., although the explanations of
Reliable and Intelligent Electrical Energy Delivery System”,
these strategies are omitted in this APPENDIX because of
Proc. of ICEE 2K, D-2-04 pp.314-317, IGta-kyushu Japan
space limitation.
(2000)

APPENDIX 1: Brief explanation of tabu search[bl APPENDIX 2: Calculation of Distribution Loss when
Distributed Generators Exist in Demand Side
Tabu search explores the whole solution space
For calculating distribution loss, load sections are
randomly based on the local search in which controlled up-
divided into subsections at the branching points and at the
hill move is admitted. In order to inhibit choosing the same
points where DGs exist as shown in App.Fig.l. In this
solution many times and falling into the cycling of the
appendix, this subsection is referred to as “section” here-in-
solutions, the so-called “tabu list” is introduced. The
after. Distribution loss calculation equations can be defined
algorithm searches the optimum point of the solution space
as follows depending on whether reverse power flow exits
by “moving” from the current solution to the next one that
or not[121.
is the optimum in the “neighborhood” of the current se.?bn h
A
solution. In this process, the solutions which attributes are
listed in the tabu list cannot be a candidate of the next
solution.
The basic algorithm of the tabu search for integer
programming problems can be written as the following
steps:
[Simple Tabu Search Algorithm] 10(;, .(:
dismihutecl !$mxator
A
(stepI)Select an initial x GX and let X* : = x ; the App.Fig.l Feeder where DG’s exist
iteration counter k: = O, and begin with tabu list
T empty. (1) In case no reverse power flow exists in section h
(step2)If ~(x ) - T is empty then go to step4, else
find s~(x) = OPTIMUM(S(X)) ,Sk ES(X)-T ; (y+ as shown in App.Fig.2, distribution loss
k:=k+l,
can be calculated by eq.(App.1).
(step3)Letx :=s(x) . Ifc(x)<c(x*) ,then X* :=x .
(step4)If the iteration number exceeds the pre-determined ) = {(lll;J_~,#~
Lo.9$hf’

one either in total or since x* was last improved,

or S(X) – T is empty upon reaching this step
directly fi~fi .stcp2, tliefi SiGp, CLS8 ~pd~~e ~ ~ii~
go to step2. [A
Where,
X : solution, X : set of solutions, 1:]
-----------------
S : searching direction from the current solution, (11
>/’ IDG
S(~) : set of “s” at solution X,
?~.
Ix IL.
S(X) : new solution attained by moving to direction 0 ‘x[m]
S from X , App.Fig.2 No ireverse power flow exists in the subsection x

0-7803-6674-3/00/$10.00
0-7803-6672-7/01/$10.00
(C)(C)
2000
2001
IEEE
IEEE 922

0-7803-6674-3/00/$10.00 (C) 2000 IEEE

 Downloaded from http://iranpaper.ir
http://www.itrans24.com/landing1.html

(2) In case reverse power flow from DGs exists in section

h ~,,;~< IDG(’)s 1“~’~ +Ih(” as shown in App.Fig.3,
(2 1

distribution loss can be calculated by eq.(App.2).

~os$/f)=+[l,:[)+l,:_~,M(l)Jr(L,-,,)
+;(~lm:l)_lll,J1)Jrl,, (App.2)

[Ah inverse power flow

(t) ,,
Ix J,* (,)
. . -- . . . . . . . . . . . . .
ID(7,
*
4*2
t
,,(f I
Ix I
0 Lx- lx
‘x[m]
App.Fig.3 Reverse power ffow exists in a part of subsection x

(3)In case all the power flows in section h is reverse power

flow [D(f) >~’,;’ +1,:” as shown in App.Fig.4, distribution
(2 )

loss ca~ be calculated by eq. (App.3).

App.Fig.4 Reverse power flow exists in the entire parts of

subsection x

Where,
[l)c,,(’):Output of DG i at time period 1,
~zDG:Totaloutput of DGs installed from section h to end of
,6
feeder at time period t,
Lk: Length of section h,
1,: Lcng!h of section k in which reverse power flow exists,
r : Resistance per unit length,
S: Set of DGs installed from section h to the end of feeder,
IJ): Load of section h at time t,
I“/):
Current flow through section h at time period t when DG is
not installed in any section..

0-7803-6674-3/00/$10.00
0-7803-6672-7/01/$10.00
(C)(C)
2000
2001
IEEE
IEEE 923