Professional Documents
Culture Documents
E-mail: hmori@isc.meiji.ac.jp
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
111. DISTFLOW
WITH CONSIDERATIONS OF DG
(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
v,o=vol
Fl,..,,m
where
m: number of feeders in system
(3)
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
pm=pffi
where
Pm(QDG): active (reactive) power of DG
v. PROPOSED METHOD
(5)
Qm=Qffi
decomposition of the
suhneighhorhoods
multiple tabu lengths
neighborhood
into
VI. SIMULATION
I '
k-k+l.
t=O
W e Neighborhood around
Allocation
Solution of Fe&
i-iil
L-3*-
f
Move to Best Solution in Neighborhmd
Converged?
END
61 Simulation Conditions
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
6.5
No. of Generation
Crossover Rate
Mutation Rate
6.0
0.01
Best
worst
Average
Tabu Length
Maximum Iterations
Pmposed Methad
Tabu Lag&
&mum
Iterations
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).
"
Method
0
0
Method
TS
H PTS
SA
GA
Fig. 7 CompWonalTime
ofCost Functions
1500
I200
600
300
0
f,
f , f .
J
A: Feeder installation Cost,&: Substation Cwt,
0 : Case 4ExistingSystem
I I: Case 6, Existing System (after load gmowth)
: Case C, @tint&
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.
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.