Gene Evolution Algorithm to Determine Minimum Break

Point Set for Optimal Coordination of Directional

Protection Relays in Multi-loops Networks
Quanming Yue Weiyong Yu Feipeng LU
Department of Electrical Engineering Shanghai Department of Electrical Engineering Shanghai Department of Electrical Engineering
Jiao Tong University, Shanghai China Jiao Tong University, Shanghai China Sichuan University, Chengdu Sichuan, China

Abstract: To determine directional simple loops and minimum break calculating computer-aided. Those algorithms, heuristic
point set in multi-loop complex networks is the key step during -method and construct S-function method, presented in papers
calculating and setting of direction relays protection values. In order [1-4] are complicated index-based. Founding the math model of
to greatly improve the practicability of algorithm, new concepts of this algorithm in paper [5-7] is very difficult and the calculation
protection dependency dimension and primary/backup protection magnitude is very big too, and practicability is not good if the
dependency set are firstly put forward in this paper. Comparing power networks scale is bigger.
protection dependency dimensions and by depth-first-search of In order to ultimately reduce the difficulty of searching
protection dependency set could find out all the directional simple directional simple loops and enhance the practicability of
loops. Using the heuristic knowledge of MBPS (Minimum break algorithm, beginning nodes of searching every time could be
point set), the determination of MBPS is reduced to a 0—1 integer determined by comparing protection dependency dimensions,
quadratic programming problem. On the basis of the principle of and all the simple loops could be searched out by
Gene Evolution, a new approach to determine MBPS is presented part-depth-first-search methods. And using the heuristic
for the fist time. Protection coordination of “T” shape lines and knowledge of MBPS, the determination of MBPS is reduced to
radiate network can be deal with by the method. Many examples [5-7]
a 0—1 integer quadratic programming problem . On the
have shown that the method is very simple, effective, and greatly basis of the principle of Gene Evolution, a new approach to
reduced the complexity of problem. determine MBPS is presented for the fist time.
Keywords: relays protection setting and calculation, directional Take the networks in Fig.1 for example to explain the novel
simple loops, protection dependency dimension, primary/backup algorithm.
protection dependency set, gene evolution optimal algorithm, ① ② ③
integer programming. 5 6 7 8
3 i h 4
1 g 19 9 f 11
I. Introduction
a
2 b 20 ⑧ c
d
10 12
e

Along with electric power industry rapid development, the 17 21 22 18

nodes quantity in power networks is increasing in a high speed. ⑤ 13 14 15 16 ④
And interlinks among child networks are strengthened. So the
number of directional loops is increased index-based. Structures
j
⑥ k
⑦
①-⑦ bus numbers, real relays protection
of networks are very complex. That brought more and more
Invented relays protection
complexity and difficulty during setting and calculating of
Fig1. Protection coordination diagrams of a network
backup protections, which include directional distance relays
protection and directional zero sequence protection. But To find II. Searching of all the directional simple loops
out the directional simple loops and beginning nodes used to To obtain directional simple loops in this networks is the
calculate relays protection values, Minimum Break Points Set, precondition of calculating MPBS. There are two methods to
is the key step through the process, and occupies the biggest determine the direction simple loops: linear combination
[4-5]
proportion of calculation capacity. And it is an important method of basic loops , depth-first-search and retrospect
[6 -7]
researching task of the relay protection value setting and method . If the number of branches in a power network is

l , then the amount of linear combination of basic loops is 2l − 1 .
So when the scale of networks is very large the calculation is
complex index-based. An algorithm-enhanced based on linear
combination of basic loops in paper [8] has been put forward,
but this paper has follow disadvantages: iterative combination
of basic loops, don’t find out all the directional simple loops,
and amount of redundancy calculation is big. A new means that
found out all the simple loops by searching the relays
protection coordination set was advanced in paper [6-7]. But
there is much redundancy calculation time because that method
hasn’t optimized the sequence of searching relays protection
coordination set. And if the scale of networks is large, the
process of searching shouldn’t convergent.
Comparing relays protection dependency dimensions and
depth-firs-search, in this paper, could respectively obtain
begging node of searching directional simple loop every time
and all the direction simple loops. Following is the calculating
process.
1. Definitions
(1) Invented relays protection (IRP): those relays
protections set on “T” nodes of ‘’T’ shape connection lines
are called IRPs. In Fig.1, such protections on node 8 as
protections 21, 22, 23 are IRPs. Those protections aren’t
considered during setting and calculation in fact. It is
necessary to set invented relays protection on “T” nodes and
treat such protections as common relays protection in this
paper for searching simple loops.
(2) Relays protection dependency relation (RPDR): before
opening those cycle loops in power networks, setting and
calculation of protection Pi need to coordinate with
protection Pj |i ≠ j , such coordination relation is entitled
relays protection dependency relation, and take this relation
to be Pi ∧ Pj |i ≠ j . If two protections are not RPDR, then
take it Pi ∨ Pj |i ≠ j . In Fig.1 before opening cycle loops,
protection 1 needs to be coordinated with protection 17 and
protection 13, then protection 1 dependents on protection 13
and protection 17, take it as P1 ∧ P17 , P1 ∧ P13 .
(3) Relay protection dependency chain (RPDC): if
protection P1 , P2 … Pm have follows relation:
P1 ∧ P2 ∧ … ∧ Pm , then call { P1 , P2 … Pm } as a RPDC. If
P1 ∧ P2 ∧ … ∧ Pm and Pm ∧ P1 , then P1 , P2 … Pm form a
direction simple loop. Whereas, if
P1 ∧ P2 ∧ … ∧ Pm and Pm ∨ P1 then protections
P1 , P2 … Pm form a direction protection unclosed path. Seen
from above we could obtain all the direction simple loops of
networks by judging and searching RPDCs.
(4) Relays protection dependency dimension (RPDD): the
protection amount of a relay protection needed to be
coordinated before cycle loops are opened and be radiate
networks. Those relays protection numbers coordinated with
that protection are called relays protection dependency set of
that relay protection, in short RPDS. In Fig.1 relay protection
13 and relay protection 17 need to be coordinated with
protection 1, then protection 13 and protection 17 are the
primary relays protections of protection 1, and protection 1 is
the backup protection of protection 13 and protection 17. And
the RPDD of protection 1 is 2, and its RPDS is {13,17}.
In order to clearly narrate the coordination relation of
relays protection, function f (n) is used to figure it in this
paper. Take protection 1 for example to explain this relation.
In function f (1) =2: {5,6}, it shows that protection 1 has 2
RPDDs, and two relays protection need to be coordinated
with protection 1. Those numbers in big bracket are such
relays protections coordinated with protection 1. The others
functions are the same as f (1) .
When the scale of power networks is large it is impossible
to form all the RPDSs in hands. We could use follow rules to
form them by program. For any relay protection, to determine
the bus number owned to the relay protection is the first step.
Then found out the border upon bus number. The border bus
is the other side bus connected by the line owned to that relay
protection. At last found out the extended relays protections,
which are coordinated with that relay protection. Take
protection 1 for example, relay protection 1 belongs to bus 1,
α, the other side bus connected with line
the line number is
αis bus 5, the extended relays protections are protection 13
and protection 17, so the RPDD of protection 1 is 2, and
RPDS coordinated by protection 1 is {13,17}. The others
could be obtained by the same method.
(5) Line relays protection twins (LRPT): direction relays
protections i and j configured on two sides bus that are
connected by line α are called LRPT, and take it as α
α
( i , j ). In Fig.1 bus 1 and bus 5 are connected by line , and
relay protection 1 and protection 2 are respectively set on the
two sides. So (1,2) is called a LRPT owned by line α. This
definition has not physics meanings in fact, and only for
obtaining directional simple loops.
(6) Reverse direction simple loop (RDSL): if relays
protections ( P1 , P1' ), ( P2 , P2 ' ) … ( Pm , Pm' ) are all LRPTs
and P1 , P2 … Pm have follows relation:
P1 ∧ P2 ∧ … ∧ Pm and Pm ∧ P1 , then relays protections
， ，
( P1 , P2 … Pm ) form a direction simple loop , take it as
loop1, and in the same time ( Pm' , … , P2' , P1' ) form other
direction simple loop loop2. So loop1 and loop2 is mutually
called RDSL.
2. Algorithm flow
Using arrays M , N , R , S to respectively place RPDS,
LRPT, direction simple loops and relays protection numbers
which could not be beginning nodes of depth-first-search.
Step 1: form array M of RPDS in multi-loop networks
by the method of calculating RPDDs and RPDSs. And obtain
array N after configuring relays protections of networks.
Step 2: comparing those values of RPDDs in networks.
Because relay protections configured on terminal line don’t
need to be coordinated with any other protection, so such
relays protection are excepted, and don’t be compared. Then
set the relays protections numbers who’s RPDDs are the
biggest numbers as the first nodes of depth-first-search. If
such numbers are not only one, select one from them. And
place the number of relay protection into array S , RPDD of
the relay protection selected to be beginning node in this time
should not be compared with others next time. So if the
RPDD of a relay protection is bigger it shows that more
relays protections need to be coordinated with it. Then the
length of such RPDC is shorter if begin to search from such
relay protection.
Step 3: if the length of RPDC is not less than 2 then it is
necessary to judge those RPDCs researched out. If
P1 ∧ P2 ∧ … ∧ Pm and Pm ∧ P1 , then protections P1 , P2 …
Pm construct a direction simple loop, contrarily, they
construct a direction protection unclosed path.
Step 4: after searched out a direction simple loop, then
send the loop into array R , in the same time obtain the
RDSL of that loop in the term of array N about LRPT and
send it to array R too. So only if any loop is searched out,
its RDSL could be easily obtained. And it doesn’t need to
retrospect all the protections been searched. That shortens the
depth of searching and save much time used to
depth-first-search.
Step 5: If all the RPDCs are searched out and direction
simple loops cannot be formed, the process of searching is
interrupted. Then send all the relays protection numbers of
direction simple loops searched out into array S . All the
direction simple loops related to those relays protections are
searched out, and all the relays protections should not be
searched in the following cycles, their RPDDs will not be
compared after that (the conclusion will be proved in the
following section). Program returns to step 2, and continue
the cycles.
Step 6: if the relays protection numbers in array S are
equal to the amount of protection configured in Fig.1 the
process of searching should be ended. That shows all the
RPDCs are searched out and all the direction simple loops in
Fig.1 are entirety found out.
3. Prove theorem
Theorem: If protection Pi is determined and belonged to a
direction simple loop found out during k time cycle, all the
direction simple loops related to protection Pi could be found
out during the same cycle. Then protection Pi is not need to
be searched during the following cycles.
Prove: assume protection Pi belonged to loop1 and loop2,
loop1=( P1 , P2 … Pi … Pm ) and loop2=( Pa , Pb … Pi … Px ).
And the following relations are come into existence:
P1 ∧ P2 ∧ … ∧ Pi ∧ … ∧ Pm and Pm ∧ P1 ，
Pa ∧ Pb ∧ … ∧ Pi ∧ … ∧ Px and Px ∧ Pa . Using definitions of
LRPT and RDSL to obtain following conclusions: the RDSLs
of loop1 and loop2 are respectively loop3=( P1' , P2' …
Pi ' … Pm' ) and loop4=( Pa' , Pb' … Pi ' … Px' ). If the direction
simple loop1 is firstly found out during the k time cycle, the
RDSL loop3 of loop1 could be easily obtained. The LRPT Pi ' of
protection Pi can be searched out in loop3, then loop4 could
be found out if let Pi ' as the beginning node of searching. At last
the RDSL loop2 of loop4 could be easily found out. If there are
more than 2 directions simple loops related to protection Pi
the process of proving is same as above discussion. So by
protection Pi in loop1 all the related direction simple loops
could be found out during the same cycle. And all the relays
protections owned to those loops will not be searched in the
following cycles.
III. Model of gene evolution method for MBPS
1. Description and definition of MBPS problem
What is called Break Points Set (BPS) is such protection set.
After disconnect all the breakers of BPS on all the setting
locations of protection line, the directional multi-loops
networks become opening circuits and the power network is a
radiate network. But MBPS is the minimum BPS.
Using directional edges to represents directional relays in
loops. Directional map G d , which could denote all the
[1−5 ]
directional relays, can be obtained . The directional simple
loops matrix in G d is Ld . And Ld = Ci [ lijr ] M × N . Where,
Ci is the loop i in map G d . r is the directional edge,
namely direction relay in loops. If the loop Ci contains edge
r , lij is 1, contrarily if r is not owned to loop Ci
lij equals 0. Set E composed of directional edges is called
minimum feedback edges set. If there is less than one edge in
every directional simple loop in Ld belongs to set E, and the
amount in E set is least, then set E is the MBPS of directional
relays in loops.
Let variable X={ x1 , x 2 … x N } ∈ {0,1}, if r j ∈ E, then
∑L x
N
s.t. ij j ≥1 , i =1,2,…, M (2)
j =1
2. Gene evolution algorithm
GA is a searching and optimization method based on the
mechanism of natural selection and colony inheritance. And in
term of the principle of survive competition and by virtue of
operations of replication, exchange and mutation, the
preliminary problem could approach to optimal solution. This
method is very applicable to integer programming problems.
The essence to solve MBPS by GA is to use genes,
chromosomes and fitness to respectively mapping state of every
relay installed on protection location in loops, entire states of
relays in loops and amount of BPS. And then use number,
replication, cross-fertilize, mutation and searching optimization
to obtain MBPS.
(1) Evolution operator---genes
Every gene represents the sate of opening or close about
relay setting on protection location in loops. If the relay is
opening, its gene is 1. Contrarily its gene is 0. So every gene
only has two states 1 or 0.
(2) Chromosome
It is a character set composed of a serial of 0 or 1, which
have special physical meanings. Chromosome A represents
all the states of relays that located on protections in loops. Ai
is the i state of relays set in loops.
(3) Fitness function
Fitness is the goal function of gene evolution algorithm and
the gist of searching optimization. The fitness of networks in
15
Fig.1 is fi' = ∑ aij , which is the amount of break points of
i =1

x j =1, contrarily x j =0. So problem of MBPS could become relays in loops on the condition of equation (2). Theoretically

calculate following inequality. fi' is smaller, the solution is better. In Fig.1 the most amount

∑x
N
=| MBPS | of relays to be disconnected is 15 except “T” connection and
j
j =1
(1) radiate line protections. BPS will be least, if fi' is least on
N
∑ Lij x j ≥ 1 , i =1,2… M condition of equation (2). In order to simple the problem,
j =1 change above problem to solve the biggest value
Equation (1) continue to be 0—1 integer quadratic 15
programming problem. fi =15- ∑ aij .
∑
N i =1
min | ( x j − | MBPS |) |
j =1
 IV. Gene evolution algorithm of MBPS
1. Coding
Firstly to code the protection configuration chart in Fig.1,
namely produce original chromosomes of networks. The total
number need to be coded is 15 except the 4 relays on radiate
lines and the 3 relays on “T” connection lines. On condition of
equation (2), 100 chromosomes need to be produces at random.
Where, every chromosome has 15 genes. And 1 or 0 represents
every gene. If that gene is 0, that shows the protection is closed,
belong to that area is bigger, so the chance that the
chromosomes should be selected out is much more.
The number to be reproduced should be determined by
probability Pr of reproduction in every colony. In this paper it
is 0.2, namely there are 20% chromosomes should be
reproduced. In the same time 20% chromosomes must be
eliminated. So the number of colony is not changed every time.
After reproduce the chromosomes, which are selected by
probability Pr of reproduction, and eliminate the

contrarily it is opened. corresponding units, new colony should be produced and

2. Calculating Fitness continue to following exchange operation.
15 (2) Exchange
Fitness fi =15- ∑ aij , aij is the j gene of i chromosome, Exchange is the main ploy to produce new unit. According to
i =1 the theory of cross in biology, exchange the part genes between
and fi is the value of i chromosome. By definition of two chromosomes. Its aim is to produce excellent unit in the
MBPS, fi is bigger, chromosome is the better. next ear. By that operation the ability of searching of GA will
3. Process of searching and optimization be greatly enhanced. The simpler method is the One-point
(1) Reproduction crossover. Its operation is: randomly select one exchange point
Reproduction is one of the operators in GA. Select the in unit, and the genes of fore section or back section
excellent unit to reproduce and give up bad unit. Fitness is the corresponding to that exchange point in two units will be
criterion to reproduce chromosome. Those chromosomes whose exchanged in part. Then the newer unit should be produced.
fitness is bigger will be reproduced, and the smaller will be Give an example:
eliminated. But the total number of newer colony could not be serial number before exchange after exchange
changed, and it is 100 all the time. Evaluate every chromosome 1 ：
father unit 1 1111 1 1 ：
son unit 1 1111 0 0
in father colony, and if the fitness is bigger, that shows such 2 father unit 2：0000 0 0 son unit 2：0000 1 1
unit is more excellent, the probability selected and reproduced 3 father unit 1：101 1 01 son unit 1：101 1 00
is bigger. Now the method in common use is roulette wheel 4 father unit 2：001 1 00 son unit 2：001 1 01
[ 9]
model method in GA . The processes of calculating are The units to be exchanged are randomly selected. Following
follow steps. is the process of exchanging.
a. Add up, in turn, all the fitness corresponding to every a. Firstly determine the exchanging probability Pc , Pc =0.5
i ~ 0.8. Namely 50%~80% units will be exchanged. In order to
chromosome, the sum is S i = ∑ f i , and the last sum-added is maximum optimization, order Pc =0.8 in this article. 80
100 i =1
chromosomes will be exchanged.
S100 = ∑ fi . b. In turn, using roulette wheel model method to select the
i =1
units to be exchanged between two units.
b. Bring random number R from [0, S100 ].
c. Randomly determine the points-exchanged. If the length of
c. Compare, in turn, S i to R . Then select the i
chromosome to be reproduced when S i is not less than R in
unit is L, then the random integer will be produced in [0 ，L].
That integer is the location exchanged. The point exchanged
the first time.
could not be the first point left to any unit. So the number to
d. Iterate step (b) and (c) again and again, still the amount of
be points exchanged is L-1. The amount of point exchanged
chromosomes reaches 100.
According to difference S i Δ ，Δ
S i = S i - Si −1 = f i , to select
may be one or many. In this paper only one point should be

the unit chromosomes reproduced. When f i is bigger, Δ

Si
exchanged.
(3) Mutation operation
is bigger too. And the probability that random number will
Mutation is the other method to produce newer unit in GA.
Any gene in any unit will be inversed. Let 0 to be 1, or 1 to be 0.
The unit or location to be mutated should be randomly
produced.
a. Determine the probability Pm of mutation. It is probably
0.001 ~ 0.01. In this paper let Pm = 0.01, namely only one unit
will be mutated.
b. For every gene in that unit selected, produce one random
number contained three valid characters in [0,1]. Those genes
whose corresponding random numbers are less than 0.01 will
be mutated.
(4) Ending condition
GA is an optimization method, and by iteration again and
again it should approach the best solution. So the ending
condition is necessary.
The general method is to determine the iteration number of
GA. In the begging, the number is smaller, then increase it in
term of the instance. And still the solution is convergent in
probability 1. In this article in term of theory in reference
papers [1-3], the amount of MBPS is 5. So equation (2) may be
the condition of convergence in this algorithm.
(5) Cycle operation
Continue the steps of (2) and (3) time after time, still it
satisfied with equation (2). Where, the BPS optimized is the
results. And those MPBSs will be found out.
V. Examples and compare
Using the multi-loops complex networks attached radiate
lines in Fig.1 to explain it.
1. Obtain the directional simple loops and matrix Ld in the
networks
The first outer cycle:
Step1: by the relays protection configure relations in Fig, 1
array M about RPDSs can be obtained. And M ={ f (1) = 2:
{13,17}, f (2) = 2: {3,5}, f (3) = 4: {8,19,9,11}, f (4) =2:
{1,5}, f (5) =1: {7}, f (6) =2: {1,3}, f (7) =4: {4,19,9,11},
f (8) =1: {6}, f (9) =2: {18,12}, f (10) =4:
{8,4,19,11}, f (11) =2: {10,18}, f (12) =4: {8,4,19,9}, f (13) =1:
{15}, f (14) =2: {2,17}, f (15) =0: { Φ }( Φ is null set), f (16) =1:
{14}, f (17) =2: {20,22}, f (18) =2: {20,21}, f (19) =2:
{21,22}, f (20) =4: {8,4,9,11}, f (21) =2: {2,13}, f (22) =2:
{10,12}} and LRPT
array N ={ a(1,2),b(17,21),c(18,22),d(19,20),e(11,12),f(9,10),
g(3,4),h(7,8),i(5,6),j(13,14),k(15,16)};
Step 2: by comparing all the RPDDs that are not terminal
relay protections in array M , RPDDs of
p3 , p 7 , p10 , p12 , p 20 are 4 at one time. So select one of
them to be beginning node of depth-first-search. Here select
relay protection p 3 . Then send the number 3 of p 3 to array
S , S ={3}.
Step 3: in term of the criterion of forming direction simple
loops searching out all the direction simple loops during
this outer cycle, and directly obtain RDSLs of them. The
directional simple array
R ={(3,8,6),(4,7,5),(3,19,21,2),(4,20,17,1),(3,9,18,21,2),(4,10
,22,17,1),(3,11,18,21,2),(4,12,22,17,1),(9,12),(10,11),(9,18,2
0),(10,22,19),(12,19,22),(11,20,18),(20,4,1,17),(19,3,2,21),(2
0,8,6,1,17),(19,7,5,2,21),(20,11,18),(19,12,22)}. After that
send all the numbers of direction simple loops searched out
into array S , return to step 1 and continue the next outer
cycle.
The second outer cycle:
Step 1: Comparing the remaindering RPDDs in array M ,
where M ={ f (13) =1: {15}, f (14) =2: {2,17}, f (16) =1: {14}},
let relay protection 14 as the second beginning node
searched;
Step 2: Those relays protections coordinated with p 2 ,
p 7 of RPDS 14 have been sent into array S , so direction
simple loops cannot be formed. Leave p14 to array S and
return to step 1.
The third outer cycle:
Step 1: Comparing the remaindering RPDDs in array M ,
M ={ f (13) =1: {15}, f (16) =1: {14}}, let relay protection 13
the third beginning node searched;
Step 2: p15 in RPDS 13 has been sent into array S , so
direction simple loops cannot be formed. Leave the number
13 of p13 to array S and return to step 1.
The fourth outer cycle:
Step 1: array M ={ f (16) =1: {14}}, and select p16 to be
fourth beginning node searched.
Step 2: element p14 in RPDS of protection 16 has been in
array S , it could not be searched. Leave protection 16 into
array S .
Step3: array M is null set and the amount of array S
equal to the amount of relays protections in the multi-loops. So
the entire searching process is ended immediately. The all
direction simple loops of the networks have been gained in the
first outer cycle.
So by four outer cycles all the simple loops in such complex
multi-loop networks could be searched out. It is not need to
retrospect in the course of depth-first-search. Much redundancy
searching is left out by the concept of RDSL. Only if those
RPDCs satisfied with the criterion, direction simple loop could
be gained immediately, and it is unnecessary to let beginning
node p i searched to be the first node in any direction simple
loop. That shortened the process of searching and CPU time.
By the protection coordination set and all the directional
simple loops in this network matrix Ld could be easily
[ 3− 5 ]
obtained .
2. Using GA mentioned in this paper to calculate MBPS
All the steps in V, which are the calculating processes about
GA in this paper, should obtain the MBPS by probability 1.
And finally the MPBS={[8,4,9,11,19], [1,3,5,9,11], [1,3,5,9,19],
[1,3,5,19,11], [3,5,9,11,19], [1,3,9,11,19], [1,5,9,11,19]}.
3. Compare
This algorithm has following merits comparing to other
methods of calculating simple loops and MBPS in multi-loop
networks.
a. The process of resolving directional simple loops is very
easy and saving CPU-time, and it has not redundancy
calculation.
b. Building model of GA is simple and pellucid. MBPS
problem is a 0-1 integer-programming problem, and GA is
justly good at this searching domain.
c. The convergence characteristic of this method is very good.
It could convergent on optimal solutions by probability 1.
d. This algorithm is applicable for large-scale networks and
multi-loops networks.
VI. Conclusion
Based on the concepts of protection dependency dimension
and relays protection dependency set, a new method to
calculate directional simple loops in multi-loop complex
networks, which could deal with “T” link lines, radiate lines
and terminal lines, is expatiated. And the 0—1 integer quadratic
programming model of GA is found. It solves the convergence
and feasibility problem about MBPS. Reduce the complexity to
calculate MBPS and solve the sensitivity of GA to first value of
searching and optimization. The algorithm could apply to actual
engineering. Numerical examples show that the algorithm is
effective and applicable. This algorithm has been successfully
using in the CAD software of relays protection setting and
calculation in Chuan-Yu power networks in Sichuan and
Chongqing province China.
VI. Reference
[1] Damborg M J, Ramaswami R, Venkata S S et al. Computer Aided
：
Transmission Protection System Design, Part 1 Algorithms. IEE-PAS,
1984,,103(1): 104~114.
[2] Ramaswami R, Damborg M J, Venkata S S etal. RamaswamiR, Damborg M
J, Venkata S Setal. Enhanced Algorithms for Transmission Protection Relay
Coordination. IEEE-PWRD, 1986,1(1): 280~287.
[3] BapaswaraRaoVV, Sankara RaoK. Computer Aided Coordination of
Directional Relays: Determination of Break Points. IEEE-PWRD, 1988, 3 (2):
51~59.
[4] Chen Yunping. A New Method for Enumerating all Simple Loops in the
Calculation on Relay Protection Setting Values. Power System Technology,
1993, 17(3): 28-34.
[5] Chen Yunping. A New Graph Algorithm for Computer-Aided Design of
Protection System Coordination.Power System Technology, 1995, 19(4): 31-37
[6] Lu Feipeng, Li Huaqiang. Study on the Optimal Coordination of Directional
Protective Relays in Multi-loop Complex Power Networks . Part One
Determination of All Directed Basic Loops. Automation of Electric Power
System. Vol.22, No.8 Aug.1998. pp. 33-37.
[7] Lu Feipeng, Li Huaqiang. Study on the Optimal Coordination of Directional
Protective Relays in Multi-loop Complex Power Networks. Part Two
Determination of the Optimal Coordination Sequence. Automation of Electric
Power System, Vol.22, No.9 Sep.1998. pp.55-57.
[8] Li Yinhong, Duan Xianzhong. Study on the Simple Loop Formation Method
in Relay Coordination. Proceedings of CSEE, Vol.23 No.2 Feb.2003. pp.21-25.
[9] YUN Qingxia. Evolution Algorithm and Evolution Programming ——A
Optimal Technology. Metallurgy Industry Publishing House), 1997, First
Edition.
Biographies
Quanming YUE was born on January 9, 1974. He received the degree of B.S.
and M.S. in electric power system from Sichuan University in 1996 and 2003
respectively. He is currently a PhD. in Shanghai Jiao Tong University, Shanghai,
China. And study mainly on relay protection of power system. Email:
yqm8341@sjtu.edu.cn.
Weiyong YU is a professor and tutor for Dr. and he has been pursued
researching work about power system automation and relays protection in
Shanghai Jiao Tong University. He is 64 this year. Email:
ywy0491@hotmail.com.
Feipeng LU was born on August 1968 in YuQi city Yunan province China. He
was received degree of Dr. in relays protection from Chongqing University in
1996, and visited Cornell University in America from 2001 to 2002. Now he is
a professor in Sichuan University, and working for relays protection of power
system. Email: fp.lv@yeah.net.