The Improving GA Coding and Decoding Techniques for Distribution
Network Reconfigurations
Li Xiaoming’”, Huang Yanhao’
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.
ABSTRACT
When genetic algorithm (CA) is used to power
distribution network reconfigurations, it is important for
enhancing the algorithm efficiency to improve coding and
decoding techniques based on the characteristics of
distribution networks. In this paper, a loop coding
technique is presented, it can efficiently reducing the
length of chromosome by taking out the branches
(breakers) that aren’t included in any loops from the
branches include in the chromosome. A new decoding
technique is also proposed, it can be efficiently used to
solve the objective function. At the end of this paper, a test
computation is presented, it proves these techniques are
efficient and practicable, and they can be used in power
distribution network reconfigurations.
KEY WORDS
Power Supplies, power distribution network
reconfigurations, optimization algorithm, genetic
algorithm, loop coding, tree decoding
1 INTRODUCTION
At the present, there have been many experts use
Genetic algorithm (GA) to solve power distribution
network reconfiguration problems, in order to reduce
losses, insulate faults, improve voltage quality etc. But if
there are too many genes (breakers) in the chromosome,
the work of GA will become very heavy, when the number
of genes enhances to a certain degree, the speed of GA
will becomes so slow that can not be tolerated. It is very
important for enhancing the algorithm efficiency to
shorten the chromosome. In this paper a loop coding
technique is presented, i t can efficiently reducing the
length of chromosome by taking out the branches
(breakers) which aren’t included in any loops from the
79
Yin Xianggen’
branches included in the chromosome. At the same time a
new decoding technique is also proposed, it fits for
for-back supersession power flow algorithm and can be
efficiently used to solve the objective function.
2 DATE STRUCTURE
Most of distribution network reconfiguration GAS
normally use binary systern coding scheme. Each bit in
chromosome is corresponding to a particular breaker in
network, uses “0” and “1” to represent the breaker state,
normally “0” denotes the breaker is opened, “1” denotes
closed. This coding strategy i s simpk and direct. But it
will double the search space of GA to add a gene in
chromosome, so we need to find the way to shorten
chromosome.
In distribution network reconfiguration GAS, the fit
degree of individual is got by decoding the chromosome
and calculating its power flow. In GA, there will be tens or
hundreds chromosomes in every group, it will expend
most of the calculating time to decode and calculate power
flow. Since normally the distribution network are radial
structure, it is fit for for-back supersession power flow
algorithm, but we need to find the decoding scheme which
assort with it.
When the breakers of a distribution network are all
closed, the network topology is a connection graph, using
G to stand for it. Its branches are corresponding to the
breakers in network. Usually the topology of distribution
network with one source is a build tree of G , the source
node is the boot node. Because normally the sources of the
distribution network with n sources are disconnected, the
topology of the network will be a forest with n trees,
every boot node of the trees is a source node, all of the
nodes in the distribution network are in the corresponding
trees. If all the source nodes are connected by dummy
branches and all breakers are closed, G will change to
 G’ , the topology of distribution network will become a
build tree of G‘ (including dummy branches). Figure I
F ig.1 16 nodes distribution network sketch map
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
treatment methods, but dummy branches can not be opened
and are excluded from chromosome. For easy to discuss,
this paper will use the simple distribution network with one
source in figure 2 as example.
Fig. 2 Simple distribution network sketch map
Suppose v is the nodes aggregate of G , v is a
random node in it, the number.of branches that connect to
v is the degree o f v , using deg(v) to stand for it. Here,
if deg(v) # 2 , we define v is the special node, for
example node 1 in figure 3, using to stand for the
aggregate of special nodes. Suppose e is a random branch
in G , 77 = voelvle2--.v,,_,e,v,
is a altcmate sequence
of nodes and branches in G , if the ends of ei is vi-, and
vi (1 5 i In ) , then is a path from v0 to V, , the
80
is a three buses distribution network, the broken lines are
the dummy branches.
path that all the nodes (branches) in it are different is road.
We take out the two special nodes from the road which ends
are special nodes and does not pass any other special nodes,
the remainder nodes-branches sequence is defined special
branch, for example nodes-branches sequence (1)2(2) in
figure 3, using Y, to stand for the aggregate of special
branches in G , all the branches in G are in K. In
figure 2
V, = {1,3,4,7,9$
The special nodes arc saved in special node structure
array in order, the load of special node is saved in the cell of
array, if the most degree of the nodes in G is D ,there
will be D hands in every cell of the array, the structure of
cell is showed in figure 3.
Fig.3 Saving structure of special node
Where, N , , N , , * - - , N , i s t h e D null hands.
The special branches are saved in special node
adjoining chain table in order. The every cell in the table is
corresponding to a node vi or a branch ej , and saves the
load of this node or the impedance of this branch, it has two
hands pointing to fore-and-aft cells separately, the saving
structure of special branch (I)’ in figure 2 is showed in
figure 4,
t
Fig.4 Saving structure of special branch (1)‘ in figure 1
Where, “head” is the head hand of the adjoining chain table.
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

i = 1,2,.. n . Divide up A , if si f 2 , “pick up” line

*,

3 LOOP CODING STRAGEGY

i from A and put it into special node-branch relational
matrix 3 , its lines are corresponding to special nodes and
3.1 CODING PRINCIPLE
rows are corresponding io the branches in G , if special
In graph G , the random branch
node v , ~connects to branch e , , then b, = 1 , or else 0.
ej , j = 42,. .., ?PZ may be in one of the two classes, in As to figure 2,

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

Where bi. is the element in line i and row j in B , ,

k, is the count of rows in B,. If there are n, special

-
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)',

other special branches are build tree branches. The relation

where, E,, i = 1,2;-.,k, is an array, the numbers of
between special nodes and special branches can be got from
branches in special branch i are saved in it. Divide B' A', save array BN by the discussed method.
according to B , the lines in which there i s 1 element in
The basic loop matrix F," of G" can be got from
every child matrix are corresponding to the nodes in the

special branches, V, is a cell array, A',

FS"= b:(MA)-I I (1)

02

Where MI,and MI, are the child matrixes of A ' , the
rows that corresponding to the special branches which are
build tree branches are comprised in M,, , the rows that
corresponding to the special branches which are connection
branches are comprised in MI,, M Tis the transpose of
M , I is I ? ~XI?, unit matrix. The
Fg*corresponding to the basic loops of G" ( G 1 , its rows
corresponding to the special branches in G" ( G ) . If there
are P connection branches in G", the row 1 r are
corresponding to the special branches which are connection
branches, the row k - r are corresponding to the special
branches which are build tree branches, for easy to calculate,
F;is modulated, its row sequence is same to
figure 5
Since the loops in G ' ( G 1 are comprised by basic
loops, if the special branches are not in any basic loops, it
also will not be in any loops. T is a vector
rj = Ef & , j = 1 , 2 , . - - , k
i=l
Here, c is the number of lines in F,", f i j is the
element in line i and row j in F," . The special
branches corresponding to the nonzero elements in 2"
should be comprised in chromosome, and R can' be got
with E,. Especially as to the distribution network with a
lot of sources, the lines, which intersect with the rows
corresponding to dummy branches and the elements at the
point of intersection are 1, should be wiped up, it means
that the basic loops that comprise dummy branches will not
be considered,
When coding, the branches in the same special branch
should be coded in one gene block, and these gene blocks
comprise the chromosome.
The discussed method can reduce calculating
effectively, as to figure 2, the calculating object of function
(1) changes from a 13 x 14 matrix to a 5 X 6 matrix. At
the same time, the special nodes and the branches and nodes
in every special branches are also been found and saved, it
will help to tree decoding.
4 TREE DECODING
The chromosomes got by the loop coding strategy can
lines of
be used in different evolution strategies. They need to be
decoded, when calculating fit degrees, Since normally the
distribution network i s radial structure, it is fit for for-back
supersession power flow algorithm. Here, a decoding
- strategy fit for it is proposed.
Before decoding, it should be first to get the state of
every special branch. At the same time, the chain tables
corresponding to the special branches should be taken out
from the special branch adjoining chain branch, and the
A', as to
special nodes should be copied from the special node chain
table.
A special branch (n) is showed in figure 6, the special
nodes which are connected by it are a. b, D =3.
* 111 i @I 2 (3) a
In)
Fig.6 A special branch (n) with all switches closed
If the breakers in special branch (n) are all closed, the
special branch and special nodes should be put together
based on the notes in BN[?Z][O]
and B N [ n ] [ l ] .
Fig.7 Result of decoding special branch (n)
If one of the breakers in special branch is opened, the
cell corresponding to the breaker branch should be "taken
out", and put into the temple table. If the breaker (2) is
opened in the special branch (n), the disposing is showed in
figure Sa, 8b.
Fig.& Special bmnch (n) with one switches opened
Fig3b Opening the chain table corresponding to special branch (n)
Then connect the two parts of the special branch to the
83

two special nodes based on the notes in BN[n][O] and
Fig.9 Result o f decoding special branch (n)
As to the special branches in which there is only one
branch, if the breaker on it is closed, the two special nodes
which are connected by it should be connected directly, or
else set the hands in the cells of the special nodes empty.
The result of decoding is showed in figure 10
r,
Fig. IO Tree structure got by decoding operation
Where, node A. B, C is the special nodes.
By this way, the distribution network flow can be
calculated by for-back supersession power flow algorithm
with the tree algorithm conveniently. As to the distribution
network with many sources, the dummy branches may not
be considered then calculate the flow of every tree, or the
dummy branches are considered, but make its loss is zero,
then calculate the loss of the build tree of G’.
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
loss is 465.366kw, the loss reduce 9.183 percent, average
calculating time is 0,218s.
6 CONCLUTION
The loop coding strategy can reduce the search space
of distribution network reconfiguration GAS and improve
their efficiencies obviously, the tree decoding strategy
proposes a convenient method for using the for-back
supersession power flow algorithm to get the lose of net.
The two strategies in this paper give a good help for
correlation studies.
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.
[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
Systems, 2,2002, 57-61.
Li Xiaoming is studying as a postgraduate for ph D in the
Department of Electrical Engineering, Huazhong University of
Science and Technology, and is also a facultyman of Electrical
Engineering Department, Wuhan University, Wuhan, 430072,
P.R.China (e-mail:xmli@wuhee.edu.cn).
Huang Yanhao is a master of School of Electrical
Engineering, Wuhan University, 430072, P.R.China.
,Yin Xianggen is with the Department o f Electrical
Engineering, Huazhong University of Science and Technology,
Wuhan, 430074,P.R.China.