You are on page 1of 6

Paper accepted for presentation at 2003 IEEE Bologna PowerTech Conference, June 23-26, Bologna, Italy

Application of Parallel Tabu Search to Distribution


Network Expansion Planning with
Distributed Generation
Hiroyuki Mori, Member, IEEE, and Yoshinori Iimura

constraints, radial system conditions, power flow equation, etc.


Thus, the mathematical formulation results in a nonlinear
constrained combinatorial optimization problem.
In recent years, distributed generation @G) plays a key role to
make distribution systems more flexible. It brings about new
environment in distribution systems. There is a possibility that
the conventional large-scale power plants or the nation-wide
transmission lines are not necessarily since DGs are placed
near loads in distribution systems. As a result, it is important
to consider DG even in distribution network expansion
planning. To OUT knowledge, DG has not been considered in
distribution network expansion planning. In this paper, an
efficient method is presented to handle distribution network
expansion planning with DG. The conventional methods for
distribution network expansion planning may be classified as
Keywords-distribution
network
expansion
planning, follows:
reliability, combinatorial
distributed
generation (DG),
(I) mathematical programming [1,8]
optimization, meta-heuristics, parallel tabu search
(2) branch exchange method [2]
(3)
meta-heuristics [3,5,7]
I. INTRODUCTION
Mathematical programming is inclined to give a locally
This paper proposes a new optimization method for optimal solution because of the approximation to express
distribution network expansion planning. In distribution discrete variables as continuous ones or to require huge
systems, it is necessary to make a plan to determine the computational effort for a real-world problem. The branch
topology of feeders and the location of substations and exchange method is able to handle discrete variables to a
optimize the cost as a whole. The cost means the followings:
certain extent appropriately, but often provides a local
a) installation cost of feeders
minimum due to the heuristics. On the other hand, metab) installation cost of substations
heuristics are different from others in a sense that they aim at
c) network loss
evaluating a highly approximate solution close to a global
d) reliability index or outage cost [4-61
minimum. They allow to escape from a local one easily. As a
e) capacity cost of substations [7]
meta-heuristic method, the followings are well-known in the
The conventional methods consider items a)-c) with d) or e), engineering fields:
but the proposed method takes account of all items a)-e). The
(a) simulated annealing (SA) [9]
problem of distribution network expansion planning may be
(b) genetic algorithm (GA) [IO]
expressed as a combinatorial optimization problem that selects
(c)tabusearch(TS) [11,12]
the solution with the smallest cost function from many SA is analogous to the annealing process of metal. It uses a
solution candidates. It is well-known that the combinatorial probabilistic single-point search process. That works to adopt
optimization problem is quite hard to solve because the
a worse solution and avoid getting stuck in a local minimum.
number of combinations exponentially increases. It has The parameter called temperature controls the algorithm to
several constraints such as the lower and upper voltage evaluate better solutions. The solution is searched from high
to low temperature to converge to a better solution. GA stems
Hiroyuki Mori and Yoshinori limura are with Department of Electrical and from the natural selection in biology to evaluate better
Eleeuonicr Engineering, Meiji Universiiy, 1-1-1 HigBshimifq T m - k u ,
Kawasaki 214-8571, Japan, Phone: +8144-934-7311, FAX:+814-934-7909, solutions. It is based on the probabilistic multi-point search

Absfracf-This paper proposes a parallel tabu search (PTS)


based method for distribution network expansion planning in
consideration of distributed generation (DG). I t may be
expressed as a combinatorial optimization problem that
determines the location and capacity of feeders and substations
while minimizing the network loss and installation cost. I n this
paper, DG is considered in the network expansion planning due
to the importance in the deregulated distribution network. At the
same time, the outage cost is introduced to improve the power
quality in distribution systems. As a result, the formulation
makes the network expansion planning problem much more
complicated. To overcome the problem, this paper applies PTS of
meta-heuristics to the distribution network expansion planning
so that computational effort is reduced and the diversity of
solution candidate i s improved to evaluate a better solution. The
proposed method i s successfully applied to a sample system.

E-mail: hmori@isc.meiji.ac.jp

0-7803-7967-5/03/$17.00 02003 IEEE

process. It has genetic operators such as the crossover, The first term of Eqn. ( I ) shows the installation cost of feeders
mutation, reproduction, etc. to make solution candidates more while the second one means the installation and capacity cost
diverse and improve the solution quality. TS is similar to the of substations. It is asswnsd that the capacity cost of
function of the working memory in a sense that some substations is proportional to the square of the installation cost.
attributes are stored for a while. It is the extension of the hill- That implies that a large sicale single substation is not
climbing method and TS has the adaptive memory to store preferable to distribution network expansion planning. The
some attributes for a period. TS has only one parameter third term indicates the active: power loss of the distribution
referred IO as tabu length to control the adaptive memory. network. The last term corresponds to the outage cost that
Unlike SA and GA, TS is a deterministic search algorithm. reflects the duration to be considered, outage cost at each load
points, and outage probability [SI. On the other hand, the
The recent studies have shown that TS has better performance
constraints are given as follows:
than SA and GA in a large scale problem. However, there is
upper and lower bounds of voltage magnitude
i)
still room for improving TS in complicated combinatorial
ii) thermal limitation of teeders
optimization problem. This paper proposes parallel tabu
iii) conditions of radial networks
search (PrS)for distribution network expansion planning with
iv) power flow equation.
DG. PTS has a couple of strategies to enhance the Constraint i) is necessary to maintain the voltage profile.
performance of TS in terms of solution accuracy and Constraint ii) gives inequality constraint for thermal limitation
computational time [14-18]. One is the decomposition of the to avoid overloaded feeders. Constraint iii) ensures the radial
neighborhood into subneighborhoods to reduce computational network configuration for distribution nehvork operation.
effort. The other is the introduction of multiple tabu lengths to Constraint iv) shows the povier balance between loads and
make solution candidate more diverse and evaluate a better generation. As the distribution power flow calculation,
solution. The proposed method is successhlly applied to a DistFlow is well-spread due lo the efficiency in distribution
sample system.
operation and planning. This paper uses it to speed up
computational time.
11. MATHEMATICAL FORMULATION

Distribution network expansion planning plays an important


role in distribution system planning. It minimizes the cost
function while satisfying the constraints. The cost function
consists of the installation cost of substations and feeders and
outage cost as well as the network loss. The cost function may
be written as

111. DISTFLOW
WITH CONSIDERATIONS OF DG

This section describes DistFlow [I31 that is the power flow


calculation tailored for a radial distribution systems. In recent
years, distributed generation plays a key role in distribution
automation. There is a high po;?sihilitythat DG is placed at the
ending node to compensate the voltage magnitude. However,
the conventional DistFlow does not consider the case with DG.
Thus, it is necessary to refomdate DistFlow to consider DG
at the ending node. Now, let us consider the line flow equation
6om Node j to Node j+l at Feeder i,

(2)
where
xq: state variable vector at Node j of Feeder i such as
~i,=[p,j,Qt,
where
Ps(Qs): active (reactk) power flow at Node j of
Feeder i
K:; squared voltage magnitude at Node j of Feeder i
A+,: branch power flow equation between Nodes j and
j +1

&j+,=&+,(xg)

where
f
cost function
w,-w5: weights
cp: installation cost of feeder i
installation conditions of feeder i such as
x/i:
1 (if feeder i is installed)
number of feeders
installation cost of substationj
installation conditions of substationj such as
xsj:
= 1 (if substationj is installed)
0 (Otherwise)
c.,
capacity of substationj
n,:
number of substations
PlaSs: network active losses
cy:
duration
loads at load point n
L.:
outage cost of load point n
C:.
h:
failure rate
n,:
number of load points

n/:

csj:

[
'

KjT

Eqn. (2) implies that solution xI gives xq+, successively.


Voltage magnitude at Node I with lateral i may be expressed
as

v,o=vol

Fl,..,,m
where
m: number of feeders in system

(3)

The ending node has the following conditions since no power


flows go downstream.

0 ' Solution
0 : Neighborhwd of CPU 1
0 Neighborhwd ofCPU 2
Fig 2 Radial D m i b u t m System with DG

CPU 1

P,n=o
Q,"=O
i=l, ...,rn
(4)
where
P,"(Q,,J: active and reactive power loads at terminal Node
n of Feeder i

, CPU2
(a) NeighborhoodDecomposition

0 : Solution
0 : Solution ofTabu Length 1
@ : Solution of Tabu Length 2

The solution is iteratively updated until the above conditions


are satisfied. This paper makes assumption that DGs are
placed at the ending node. The conventional DistFlow deals
with the case where no loads or generations are connected
downstream as shown in Fig. 1. As a result, it is necessary to
reformulate DistFlow in a distribution network with DGs. In
this paper, DG is expressed as a P-Q specified node in the
power flow calculation. Therefore, the ending node may be
written as

(b) MultipleTabu Lengths

Fig. 2 Concept ofPTS

pm=pffi
where
Pm(QDG): active (reactive) power of DG

1v. PARALLEL TABU SEARCH


The algorithm of Parallel Tabu Search (PTS) is developed to
alleviate a problem of tabu search (TS) [14-IS]. PTS has two
strategies to improve TS
a)
h)

v. PROPOSED METHOD

(5)

Qm=Qffi

decomposition of the
suhneighhorhoods
multiple tabu lengths

neighborhood

into

Strategy a) is effective to reduce computational effort due to


the distributed computing of the neighborhood solution
candidates. The use of the Hamming distance equal to one
allows to calculate the suhneighhorhood solution
independently. Suppose that two subneighborhoods are
available and two processors are assigned to each
suhneighhorhoods as shown in Fig. 2(a). The computational
effort reduces to a half in creating solution candidates.
Strategy b) is based on the fact that a different tabu lengths
creates different search process. That implies that multiple
tabu lengths contribute to finding out better solutions. Both
intensification and diversification of solution search are
carried out through the multiple tabu lengths. Fig. 2(h) shows
the concept of multiple tabu lengths where two tabu length are
prepared to tind out better solutions. It is assumed that two
processors evaluate solutions independently. Thus, PTS
allows to improve the performance of TS in terms of solution
accuracy and computational effort.

This paper proposes a new method for distribution network


expansion planning with DG. Distribution network expansion
planning is of main concern as distribution network planning.
It optimizes the following:
a) installation cost of feeders
b) installation cost of substations
c) capacity cost of substations
d) distribution network loss
e) outagecost
It is very important to optimize the factors above, but the
mathematical formulation is much more complicated. In
practice, the problem of distribution network expansion
planning results in a combinatorial optimization problem that
corresponds to a NP hard problem. In this paper, parallel tabu
search (PTS) is used to evaluate a better solution that
corresponds to a highly approximate solution near a global
minimum. The distribution network expansion planning is
described to include distribution generation (DG) in
distribution systems. In this paper, it is assumed that the
candidates of feeders, substations and distributed generation
are determined in advance. All DGs are used for the network
expansion planning. The algorithm may he summarized as
follows:
Step 1:
Step 2:
Step 3:
Step 4:

Set initial conditions (initial solution Sh).


Create solution neighborhood around S, with PTS.
Evaluate the cost function ofall the neighborhoods.
Evaluate the hest solution in the neighhorhood and
defme it as a new solution.
Step 5 : Stop if the iteration criterion is satisfied. Otherwise,

neighborhood into two subneig:hborhoods.

VI. SIMULATION

Se Initial Conditions k=O

I '

k-k+l.

1) The proposed method was applied to the 32-node


distribution systems as shown in Pig. 4(a) [19], where

t=O

W e Neighborhood around
Allocation

Solution of Fe&

i-iil

Calculate Cost Function

Calculate Cost Function

L-3*-

f
Move to Best Solution in Neighborhmd

Converged?
END

Fig. 3 Flowchart of Proposed Method

regard the new solution as S,

61 Simulation Conditions

and return to Step 2.

Fig. 3 shows the flowchart of the proposed method, where two


CPUs are used to cany out PTS. Suppose that computational
time of CPUs 1 and 2 are denoted as tl and tz. Computational
time of PTS is expressed as max(t,, t2), where max(t,, tz)
shows the larger value. It should he noted here that PTS
speeds up computational time with the decomposition of

Nodes 200, 300 and 400 have substations, Nodes 33 and


34 have DGs and dotted lines are the candidates of feeders
while solid ones are the existing lines. Also, the
installation cost of subslation is set as c,j=lOO. The
installation cost of feeders is proportional to the length of
the line. The line parameters (resistance and reactance) are
determined by the same procedure. It is assumed that DG
has the capacity of 400 KVA with power factor 0.8. The
number of feeder candidales is 81. The same number of
bits as the feeders were used to determine the optimal
route. In other words, binary number, 0 or 1 is assigned to
each feeder. If a feeder has bit 1, it is installed. Otherwise,
it is not.
2) PTS evaluates a better solution by using the neighborhood
search with the hamming distance of 2 that means
exchanging a variable with another. The number of
necessary feeders is 34. The conditions of the radial
network require 32 feeders while DGs need two. Therefore,
the problem to be solved is to select 34 i?om 81 feeders.
The number of combinations results in 7 . 7 7 ~ 1 0 ~ ~ .
3) Two types of outage coirt were used to consider the
reliability of distribution network expansion planning. One

19
(a) Exisling System

x101

Table I

7.5

Parameters

Method
SA

Initial Temperature
Cooling Schedule

l00000
0.999

Coovergeme Criterion

.-I

ti

7.0

6:

No. of Populations

GA

8.0

Parameters of Each Method

6.5

No. of Generation
Crossover Rate
Mutation Rate

6.0

0.01

Best

worst

Average

Tabu Length
Maximum Iterations

Pmposed Methad

Fig. 5 Cost Function o f k h Method

Tabu Lag&
&mum

Iterations

is the residence type while the other is commerce one.


Eighteen nodes belong to the residence type and the rest is
the commerce one as shown in Fig. 4(a). It is assumed that
the outage cost of feeders is proportional to loads that they
have. Specifically, the outage cost is evaluated with Ref.

151.
4) The loads of the existing system are based on data of Ref.
[I91 while those of the future system are created by
increasing 40-60% of the original loads randomly. For
convenience, the following cases are considered.
Case A: existing system with the original loads
Case B: existing system with future loads
Case C: extended system with future loads
5) To demonstrate the effectiveness of the proposed method,
this paper makes a comparison between PTS and the
conventional methods such as SA, GA and TS in terms of
solution accuracy and computational efficiency. Table 1
shows the parameters of each method that were determined
by the preliminary simulation. Fifty initial solutions were
prepared to examine the influence of the initial solution on
the fmal solution. It is assumed that PTS has two
subneighborhood and two tabu lengths. Regarding two
tabu lengths, two solutions are calculated with one initial
solution. The calculation was performed on the Fujitsu
Workstation S-7/4OOUi m270D(Ulha-5, SPECinit 95: 9. I,
SPECfp 95: 10.1).

6.2 Simulation Results


Fig. 5 shows the best, average, worst and standard deviation
(SD) of the cost function for each method. It can be seen that
PTS of the proposed method is better than SA, GA and TS
regarding the best, average, worst and SD. Looking at the
average cost function, PTS is 1.16-times, 1.14-times and 1.01times better than SA, GA and TS, respectively. PTS has better
results than SA and GA although it has the same performance
as TS for the best cost function. Also, PTS has better results
than SA, CA and TS for the worst cost function. It is
noteworthy that SD of PTS is much smaller than others as
shown in Fig. 6. That implies that PTS of deterministic search
is a better method than SA and GA of probabilistic search. At
the same time, PTS has better performance than TS due to the
use of the multiple tabu lengths. Fig. 7 gives the average

"

Method

0
0

Method

TS
H PTS

SA
GA

Fig. 6 Standard Deviation

Fig. 7 CompWonalTime

ofCost Functions

1500

I200

600

300
0

f,
f , f .
J
A: Feeder installation Cost,&: Substation Cwt,

f,:Network Lass,&:Outage CmtJ Total Cost

0 : Case 4ExistingSystem
I I: Case 6, Existing System (after load gmowth)
: Case C, @tint&

System (after load gmwth)

Fig. 8 Campanson behwen Exishg and Optimized Systems

computational time of each method, where PTS is 2.55-times,


2.11-times and 1.83-times faster than SA, GA and TS,
respectively. In this paper, two subneighborhoods were used
to speed up computational efficiency. Hence, it can be seen
that about 2 times efficiency was obtained. Therefore, the
proposed method is better than SA, GA and TS in terms of
solution accuracy and computational time. Next. let us take a
look at the results of the optimized network in fig. 4@). The

difference between the existing and optimized networks is that


one substation at Node 300 and 11 feeders were newly
installed in Fig. 4@). It can be observed that the substation at
Node 300 contributes to the reduction of the network loss
because of the geographical point close to the ending nodes
that suffer 6om the voltage dips. Fig. 8 shows a comparison
of Cases A-C regarding each cost. Compared with Case A,
Case B increases each cost because of the load growth in Case
B. That implies that it is necessary to construct the optimal
network by installing feeders, substations and DGs for the
load growth. Case C shows that compared with Case B, the
substation cost, network loss and outage cost significantly
decrease while the feeder installation cost increases a little.
Also, the main difference between Cases A and C is that the
network loss becomes much smaller due to the installation of a
new substation and DGs. As a whole, Case C reduces the cost
of about 29% and 55% for Cases A and B, respectively.
Therefore, the simulation results have shown that the
proposed method is more effective than the conventional
method such as SA, GA and TS in terms of solution accuracy
and computational efficiency.
VII. CONCLUSION

This paper has proposed a new method for distribution


network expansion planning in distribution systems with
distributed generation (DG). In this paper, the outage
cost was considered to improve the power quality in
distribution network expansion planning. The proposed
method makes use of parallel tabu search (PTS) that
extended tabu search of meta-heuristics for solving a
combinatorial optimization problem in a parallel way.
Specifically, a couple of strategies were used to improve
the solution accuracy and computational efficiency.
The proposed method was successfully applied to the 32node system with DGs. A comparison was made between
PTS and the other methods such as SA, GA and TS.PTS
was much better than others in terms of solution
accuracy and computational time. In particular, it is
noteworthy that PTS allows to provide more reliable
solutions in a sense that it enhances the standard
deviation of the cost function for 50 initial solutions
significantly and proves to be a robust algorithm. The
obtained solution has succeeded in reducing the original
total cost to 55%. Thus, the proposed is efficient for
solving a distribution network expansion planning
problem.

VIII. REFERENCES
K. Aoki, er al., New Approximate Optimization Method for
Distribution System Planning IEEE Trans. an Power Systems, Vol. 5,
No. I, pp. 126.132, February 1990.
K. Nara, e l al., Algorithm for Expansion Planning in Distribution
Systems Taking Faults into Consideration, IEEE Trans. on Power
Systems, Vol. 9, No. 1, February 1994.
V.Mirandq J. V. Ranito and L. M. U-oenca, Genetic Algorithm in
Optimal Multistage Distribution Network Planning IEEE Trans. on
Power Systems, Vol. 9, No. 4, pp. 1927-1933, November 1994.

R. Chen, er al., Value-based distribution reliability assessment and


planning, IEEE Trans. on Power Delivery, Vol. 10, No. 1, pp. 421429,
January 1995.
[5] S. Jonnavithula and R.Billinton, Minimum Cost Analysis of Feeder
Routing in Distribution System Planning, IEEE Trans. on Power
Delivery, Vol. I I , No. 4, pp. 1935-1940, October 1996.
I61 Yifan Tang, Power Distribution System Planning with Reliability
Modeling and Optimization, IEEE Trans. on Power Systems, Vol. 11,
No. I,pp. 181-189,February 1996.
[7] K. Nara, el al., ~~ANew Feeder Route Determination Algorithm by
Dijkstm Method and Tabu Search; Proc. of Intelligent System
Application to Power Systems (ISM 97), pp. 448452, Seoul, Korea,
July 1996.
[SI S. Bhowmik, S. K. Goswami arid P. K. Bhattacherjee, A New Power
Distribution System Planning through Reliability Evaluation
Technique, Electric Power Syslems Research, Vol. 54, No. 3, pp. 169179, June 2000.
[9] S.Kirkpatrick, et al., Optimization by Simulated Annealing, Science,
Vol. 220,No. 4598, pp. 671680. May 1983.
[IO] D. E. Goldberg, Genetic Al:orithm in Search, Optimization and
Machine Learning, Addison Wesley Publishing Company, 1989.
[I11 F. Glover, Tabu Search, Part 1; ORSA Journal on Computing, Vol. I ,
No. 3, pp. 190-206, Summer 1989.
[12l F. Glover, Tabu Search, Part 11: ORSA Journal on Computing, Vol. 2,
No. I, pp. 4-32, Winter 1990.
[I31 M. E. Baran and F. F. Wu, Clptimal Capacitor Placement on Radial
Distribution Systems, IEEE Trans. on Power Delivery, Vol. 4, No. 1, pp.
725-734, January 1989.
[I41 H. Mori and T. Hayashi, New Parallel Tabu Search for Voltage and
Reactive Power Control in Power Systems, Proc. of tEEE International
Symposium on Circuits and Systsms, Vol. 3, pp. 43 1434, Monterey, CA,
USA, May 1998.
[IS] H. Mori and 0. Matsuzki, A Parallel Tabu Search Approach to Unit
Commiment in Power Systems, h c . of IEEE International Conf, on
Systems, Man and Cybernetics, Vol. 6, pp. 509-514, Tokyo, Japan,
October 1999.
[I61 H. Mori and Y . Ogita, Parallel Tabu Search for Capacitor Placement in
Radial Distribution Systems, Proc. of 2000 IEEE PES Winter Meeting,
Vol. 4, pp.2334-2339, Singapore, January 2000.
[I71 H. Mori and Y. O g i 4 A Parallel Tabu Search Based Method for
Rewnfigurations of Distribution Systems, Proc. of 2000 IEEE PES
Summer Meeting, Vol. 1, pp.73-?8, Seattle, WA, USA., July 2000.
[I81 H. Mori and Y. Ogifa A Parallel Tabu Search Based Approach to
Optimal Network Reconfigurations for Service Restoration in
Distcbutian Systems, Prae. of 2002 IEEE CSS CCA2002, pp. 814-819,
Glasgow, UK, September 2002.
[I91 M. E. Baran and F. F. Wu,N8:twork Reconfiguration in Distribution
Systems for Loss Reduction arid Load Balancing, IEEE Trans. on
PowerDelivery,Vol. 4,No. 2, p p 1401-1407, April 1989.
[4]

IX.BIOGRAPHIES
Hiroyulii Mori was torn in Tokyo, Japan on November, 1954. He received
the B.Sc., M.Sc. and Ph.D. degrees all in Electrical Engineering from Waseda
University, Tokyo, Japan in 1979,1981, and 1985, respectively. From 1984 to
1985 he was a Research Associate at Waseda University. In 1985 he joined
the faculty in Electrical Engineering at Meiji University, Kawasaki, Japan.
From 1994 to 1995, he was a Visiting Associate Professor of School of
Electrical Engineering at Cornell Unhersity, Ithaca, New York, U.S.A. He is
currently a Professor of Dept. of Electrical and Electronics Engineering at
Meiji University. From 1997 to 2032, he was appointed as a Research
Division Director of Evolutionary Learning Systems at Meiji University High
Technology Research Center. Since 2001, He has been the ISAP Board
Director. His research interests indud,: voltage instability, power flows, state
estimation, load forecasting, system identification, furzy, men-heuristics and
artificial neural networks. Dr. Mori is a member of AAAI, ACM, INNS,
SIAM and IEE of Japan.

Yosbinari limurs was born in Kasama, lbaraki Prefechlre, Japan on October,


1980. He received the B. Sc. de5eee in Electrical and Electronics Engineering
from Meiji University, Kawasaki, Japtm in 2003. He is currently working for
the M.Sc. degree. His research interests are distribution system analysis and
meta-heuristics. Mr. limura is a studem member of IEE oflapan.

You might also like