Documente Academic
Documente Profesional
Documente Cultură
Network Reconfigurations
Li Xiaoming’”, Huang Yanhao’ Yin Xianggen’
1 Department of electrical engineering, Wuhan University , 430074, P.R.China.
2 Department of electrical engineering, ,Huazhon University of Science and Technology, Wuhan, 430074,
P.R.China.
branches included in the chromosome. At the same time a
ABSTRACT
new decoding technique is also proposed, it fits for
When genetic algorithm (CA) is used to power for-back supersession power flow algorithm and can be
distribution network reconfigurations, it is important for efficiently used to solve the objective function.
enhancing the algorithm efficiency to improve coding and
2 DATE STRUCTURE
decoding techniques based on the characteristics of
distribution networks. In this paper, a loop coding Most of distribution network reconfiguration GAS
technique is presented, it can efficiently reducing the normally use binary systern coding scheme. Each bit in
length of chromosome by taking out the branches chromosome is corresponding to a particular breaker in
(breakers) that aren’t included in any loops from the network, uses “0” and “1” to represent the breaker state,
branches include in the chromosome. A new decoding normally “0” denotes the breaker is opened, “1” denotes
technique is also proposed, it can be efficiently used to closed. This coding strategy i s simpk and direct. But it
solve the objective function. At the end of this paper, a test will double the search space of GA to add a gene in
computation is presented, it proves these techniques are chromosome, so we need to find the way to shorten
efficient and practicable, and they can be used in power chromosome.
distribution network reconfigurations. In distribution network reconfiguration GAS, the fit
degree of individual is got by decoding the chromosome
KEY WORDS
and calculating its power flow. In GA, there will be tens or
Power Supplies, power distribution network hundreds chromosomes in every group, it will expend
reconfigurations, optimization algorithm, genetic most of the calculating time to decode and calculate power
algorithm, loop coding, tree decoding flow. Since normally the distribution network are radial
structure, it is fit for for-back supersession power flow
1 INTRODUCTION
algorithm, but we need to find the decoding scheme which
At the present, there have been many experts use assort with it.
Genetic algorithm (GA) to solve power distribution When the breakers of a distribution network are all
network reconfiguration problems, in order to reduce closed, the network topology is a connection graph, using
losses, insulate faults, improve voltage quality etc. But if G to stand for it. Its branches are corresponding to the
there are too many genes (breakers) in the chromosome, breakers in network. Usually the topology of distribution
the work of GA will become very heavy, when the number network with one source is a build tree of G , the source
of genes enhances to a certain degree, the speed of GA node is the boot node. Because normally the sources of the
will becomes so slow that can not be tolerated. It is very distribution network with n sources are disconnected, the
important for enhancing the algorithm efficiency to topology of the network will be a forest with n trees,
shorten the chromosome. In this paper a loop coding every boot node of the trees is a source node, all of the
technique is presented, i t can efficiently reducing the nodes in the distribution network are in the corresponding
length of chromosome by taking out the branches trees. If all the source nodes are connected by dummy
(breakers) which aren’t included in any loops from the branches and all breakers are closed, G will change to
79
G’ , the topology of distribution network will become a is a three buses distribution network, the broken lines are
build tree of G‘ (including dummy branches). Figure I the dummy branches.
figure 2
F ig.1 16 nodes distribution network sketch map
V, = {1,3,4,7,9$
In G’ and G I section breaker branches and dummy
branches are the build tree branches, tie breaker branches
are connection branches. By using dummy branches, G’
and G can be processed by the same data structures and The special nodes arc saved in special node structure
treatment methods, but dummy branches can not be opened array in order, the load of special node is saved in the cell of
and are excluded from chromosome. For easy to discuss, array, if the most degree of the nodes in G is D ,there
this paper will use the simple distribution network with one will be D hands in every cell of the array, the structure of
source in figure 2 as example. cell is showed in figure 3.
if deg(v) # 2 , we define v is the special node, for structure of special branch (I)’ in figure 2 is showed in
figure 4,
example node 1 in figure 3, using to stand for the
in G , 77 = voelvle2--.v,,_,e,v,
is a altcmate sequence
t
of nodes and branches in G , if the ends of ei is vi-, and
Fig.4 Saving structure of special branch (1)‘ in figure 1
vi (1 5 i In ) , then is a path from v0 to V, , the
Where, “head” is the head hand of the adjoining chain table.
80
The special branch with only one branch is marked by
one class it is in one or more loops, and the breakers on eJ
special mark in the table. The relation of special nodes and
special branches is embodied in the two dimension array can be opened or closed; in the other it is not in any loops,
B N , if the node with lesser number is the head node and the breakers on ei can not be opened or closed,
connected by the special branch, then BN[i][O]and
because the path to supply the nodes on it is only one, if the
breakers are opened, some of the loads will be lost. So we
BN[I’][1] save the head node and the end node connected
only need to code the first kind of breakers, others may be
by the special branch separately. considered when decoding. We use B’ to stand for the
Before begin reconfiguration calculating, we need to aggregate of branches in chromosome R ,
number the branches and nodes in G . We should first By this method, the length of chromosome can be
number the branches and nodes in the special branches reduced effectively, for example as to the distribution
without connection branches, and make the numbers of network in figure 2, if considering all the breakers, there
branches and nodes in the same special branch continuing will be fourteen genes in the chromosome, but by this
separately. method, the length of chromosome will only be ten digits,
By the numbering method above, we can get the the search space only is 6.25 percent of the former.
relational matrix A of graph G , If there are ~tnodes
3.2 REALIZING METHOD
and m branches in G , A will be a H X M matrix,
the its lines are corresponding to the nodes in G I its rows If the distribution network is simple, we can find out
the branches that need to be coded by observing, but if it is
are corresponding to the branches in G , if node vi
complicated, it will be very hard to do this, and it also can
not make use of computer.
In graph theory, the loop matrix F of G can be
got from the matrix A , its lines are corresponding to the
1 0 0 0 0 0 0 0 0 0 0 0 0 0 loops of G , its rows are corresponding to the branches of
1 1 0 0 0 0 0 0 0 0 0 0 0 0
G , if branch e j is in loop ci , f,=1, or else 0, we can
0 1 1 0 0 0 1 1 0 0 0 0 0 0
0 0 0 0 0 0 1 0 0 0 0 1 1 0 find out the branches need to be coded from it. But if the
0 0 0 0 0 0 0 0 0 0 0 0 1 1
distribution network is complicated, the rank of A will be
0 0 1 1 0 0 0 0 0 0 0 0 0 0
very high, it will spend much time in calculating F
A = O O 0 1 I O 0 0 0 0 0 0 0 1
0 0 0 0 1 1 0 0 0 0 0 0 0 0 directly. From the definition of special branch, we know as
0 0 0 0 0 1 0 0 0 0 0 0 0 0 to special branch ,U, the loop comprising it also comprises
0 0 0 0 0 0 0 1 1 0 0 0 0 0 the branches in it, vice versa. So we can get R by finding
0 0 0 0 0 0 0 0 1 l 0 0 0 0 the branches on every special branch which is in loops.
0 0 0 0 0 0 0 0 0 1 1 0 0 0 sumA is the array of A line sums,
0 0 0 0 0 0 0 0 0 0 1 1 0 0
m
s u d =[s,,s2;.-,sn] , si = deg(vi) = c a y ,
j=l
81
- -
1 0 0 0 0 0 0 0 0 0 0 0 0 0
0 1 1 0 0 0 1 1 0 0 0 0 0 0
B=O 0 0 0 0 0 1 0 0 0 0 1 1 0 where vfli , i= , k , is an array, the numbers of
0 0 0 1 1 0 0 0 0 0 0 0 0 1
branches in special branch i are saved in it. The special
-0 0 0 0 0 1 0 0 0 0 0 0 0 0- branches can be saved by the discussed method.
We can get the special branches relation matrix A'
from B ,
4
, I = 1,2,---,k
al.!I = C b i i , i= 1,2,.-.,n,
/=I
-
1 0 0 0 0 0
1 1 0 1 1 0
A'=D 0 0 1 I 1
0 1 1 0 0 1
-0 0 1 0 0 0-
-1 0 1 0 010 01010 0 0 0 010 0-
I I I t
0 111 010 q l \ l 0 0 0 010 0
B = O 010 0 1 0 0 1 7 ( 0 0 0 0 111 0
o 010 1 1 1 01010 o o o O / O 1
0 010 010 11010 0 0 0 0 1 0 0-
B = [B,B, -.BJ
The child matrixes in B are corresponding to special
branches, its rows are corresponding to the branches in the
special branch. If there are k child matrixes in B , there
Fig. 5 Predigest result of the distribution network in figure 2
will be k special branches in G , E p is a cell array,
In G", the connection branch i s the special branch with
E , = [E,,E,, ...E , -.-E,] the connection branch in G I such as special branch (5)',
02
(1) changes from a 13 x 14 matrix to a 5 X 6 matrix. At
Where MI,and MI, are the child matrixes of A ' , the
the same time, the special nodes and the branches and nodes
rows that corresponding to the special branches which are in every special branches are also been found and saved, it
will help to tree decoding.
build tree branches are comprised in M,, , the rows that
corresponding to the special branches which are connection
83
loss is 465.366kw, the loss reduce 9.183 percent, average
two special nodes based on the notes in BN[n][O] and
calculating time is 0,218s.
6 CONCLUTION
The loop coding strategy can reduce the search space
of distribution network reconfiguration GAS and improve
Fig.9 Result o f decoding special branch (n) their efficiencies obviously, the tree decoding strategy
As to the special branches in which there is only one proposes a convenient method for using the for-back
branch, if the breaker on it is closed, the two special nodes supersession power flow algorithm to get the lose of net.
which are connected by it should be connected directly, or The two strategies in this paper give a good help for
else set the hands in the cells of the special nodes empty. correlation studies.
The result of decoding is showed in figure 10
REFERENCE
[1]Liu Li, Yao Yubin, Chen Xueyun, Sun Xiaoping.
Topology Structure Identification and Flow Calculation of
lOkV Distribution Network. Relay, 28(2), 2000, 17-19.
r, [2] Wagner T P, Chikhani A Y, Hackam R. Feeder
Reconfiguration for Loss Reduction: An Application of
Distribution Automation[J]. IEEE Transaction on Power
Delivery, 6(4), 1991, 1922 -1933.
[3] Bi Pengxiang, Liu Jim, Liu Chunxin, Zhang Wenyuan,
A Refined Genetic Algorithm for Power Distribution
Network Reconfiguration. Automation of Electric Power
Fig. IO Tree structure got by decoding operation Systems, 2,2002, 57-61.
Where, node A. B, C is the special nodes.
By this way, the distribution network flow can be Li Xiaoming is studying as a postgraduate for ph D in the
Department of Electrical Engineering, Huazhong University of
calculated by for-back supersession power flow algorithm Science and Technology, and is also a facultyman of Electrical
with the tree algorithm conveniently. As to the distribution Engineering Department, Wuhan University, Wuhan, 430072,
P.R.China (e-mail:xmli@wuhee.edu.cn).
network with many sources, the dummy branches may not
Huang Yanhao is a master of School of Electrical
be considered then calculate the flow of every tree, or the Engineering, Wuhan University, 430072, P.R.China.
dummy branches are considered, but make its loss is zero, ,Yin Xianggen is with the Department o f Electrical
Engineering, Huazhong University of Science and Technology,
then calculate the loss of the build tree of G’. Wuhan, 430074,P.R.China.
5 APPLICATION
The distribution network in figure 2 is from paper [2],
It is a network with 3 buses, 16,nodes and 3 tie breakers.
We use GA and the discussed methods to reconfigure it with
the object to minimize loss. Relative to the method
considering all of the breakers, the loop coding strategy can
reduce four genes from chromosome, the search space can
reduce to 6.25 percent of former.
The collocation of the computer is:
CPU: Duron 1G
RAM: 128M SDR4M
The length of chromosome is 12. The opened breakers
before reconfigure are breaker 4 8 12, loss is 512.427kw,
after reconfiguring, the opened breakers are breaker 4 9 11,
84