Professional Documents
Culture Documents
(1998) Wen & Chang
(1998) Wen & Chang
(Received 24 May 1996; revised version received 7 October 1996; accepted 23 December 1996)
Key words: electrical distribution network, fault diagnosis, genetic algorithm, set
covering theory.
and the fuzzy set based method14 which devotes to operating states of each device-and the reported
model the inexactness and uncertainties of the heuristic alarms (i.e. the operation of protective relays and
knowledge of operators in the control centers, a very circuit breakers).
interesting and noteworthy method is presented in Ref. (b) To carry out the fault diagnosis with the
15 for the fault diagnosis problem in electrical distribu- following:
tion networks by using the Prolog based logic program-
ming approach. Although the developed method in Ref. (1) to formulate the O-l integer programming
model as presented in Sections 3 and 4 for the
15 is attractive, it can only deal with single fault cases. In
fault diagnosis problem,
fact, the main difficulty with the fault diagnosis problem
is how to deal with complicated fault scenarios correctly (2) to produce some hypotheses randomly,
and efficiently, such as multiple faults with some (3) to apply a genetic algorithm (GA), which is
presented in Section 5, to search for better
malfunctions of protective relays and/or circuit break-
hypotheses progressively until one or more
ers. The objective of this paper is to develop a robust
hypotheses that can correctly explain the
and efficient method to diagnose these complicated
reported alarms have been found.
faults in electrical distribution networks. The method
developed takes the following three main steps. At first,
based on the causality relationship among section fault, 3 THE MATHEMATICAL MODEL OF THE
the protective relay action and the circuit breaker trip, FAULT DIAGNOSIS PROBLEM
the expected states of protective relays and circuit
breakers are expressed in a strict mathematical 3.1 A brief introduction to electrical distribution
manner. Secondly, the well developed parsimonious networks
set covering theory16>17is applied to the fault diagnosis
problem. A O-l integer programming model is then Electrical distribution networks can be operated in a
developed, which utilizes the operational information of ring or radical structure depending on their application.
protective relays and the tripping information of circuit The reliability for power supply in the ring network is
breakers. This model can be used to simultaneously higher than that in the radical one. However, the
diagnose any complicated faults and any hidden defects protective device placement in the ring network is more
in the feeder protection systems. Thirdly, a genetic difficult than that in the radical network. Because of
algorithm (GA) is used to solve this O-l programming these reasons, it is common practice to utilize the ring
model, which can find multiple globally optimal solu- network for supplying power to highly populated areas
tions directly and efficiently in a single run. This method and to major load centers, while in rural areas the
is very suitable for complicated fault scenarios with radical network is widely employed. Due to more
malfunctions of protective relays and/or circuit break- complex protective device placement, the fault diagnosis
ers. This is because different combinations of fault for the ring network is more difficult than that for the
sections and malfunctions of protective relays and/or radical one. The objective of this paper is mainly to
circuit breakers may produce the same set of alarms develop a fault diagnosis method for the ring network,
under these circumstances. The main contribution of this but the developed method can also be applied to the
paper lies in the development of a new and systematic radical network after some simplifications. In fact, the
approach for the fault diagnosis problem in electrical fault diagnosis in the radical network is a special and
distribution networks. simple case of that in the ring one.
The remainder of this paper is organized as follows. A detailed description of the distribution ring network
Section 2 describes the proposed overall fault diag- and its configuration of protective systems is presented
nosis method. In Section 3, the mathematical model in Ref. 15. For the convenience of presentation, an
for the fault diagnosis problem in electrical distribu- introduction is given in this subsection based upon the
tion networks is formulated. A parsimonious set work presented in Ref. 15.
covering theory based fault diagnosis method is Each ring circuit can have two, three or four parallel
developed in Section 4. Section 5 presents a genetic feeder circuits and each feeder circuit is protected using
algorithm (GA) and its application to the fault pilot wires. Each parallel circuit is also protected by an
diagnosis problem. Sections 6 and 7 present the test overcurrent relay installed on the busbar of the sub-
results and conclusions. station. Power is supplied to the loads through the
distribution transformers in ring circuits. Now we use a
simple example as shown in Fig. 1 to study the
2 THE OVERALL FAULT DIAGNOSIS METHOD
configuration of protection systems in distribution ring
networks. The study system is rated at 11 kV.
The developed fault diagnosis method for electrical
The various types of faults that may occur in the ring
distribution networks includes the following steps:
network are busbar fault, feeder fault and transformer
(a) To input the system data, including the topologi- fault. The protection systems corresponding to these three
cal structure of the given distribution network, types of faults are subsequently described as below.
Fault diagnosis in electrical distribution networks 71
S is a n-dimension vector. The ith element of S, si, L3, L4, Tl, T2 and T3, respectively. The two over-
represents the ith section and its state, and si = 0 or 1 current relays (ri and r2) are the overcurrent relays at
corresponds to its normal or fault state, respectively; locations d and e, respectively. The 11 circuit breakers
S is a vector to be determined. (ci-cii) are CBl, CB2,. . ., CB 11, respectively. There are
B is a nbi--dimension vector and denotes the battery five battery locations (bi-b,), i.e. a, b, c, d and e,
states; the ith element of B, bi, represents the zth sequentially. There are four possible open-circuited
battery and its state, and bi = 0 or 1 corresponds to its pilot-wires (pi-p4) in the feeder protection system
normal or failure state, respectively; B is also a vector corresponding to Ll-L4, respectively.
to be determined, It is obvious that for a specified overcurrent relay or
P is a nfdimension vector and denotes the hidden circuit breaker, its expected state may be different when
open-circuited pilot-wires in the feeder protection different kinds of faults occur. Moreover, it is clear that
system; the ith element of P, pi, is used if the pilot- a specified overcurrent relay or circuit breaker should
wire corresponding to the ith feeder is open-circuited, actuate or trip as long as any kind of fault occurs which
is SO, then pi = 1, otherwise pi = 0; P is also a vector can cause it to actuate or trip. Thus, the expected states
to be determined. of overcurrent relays and circuit breakers can be
R is a +-dimension vector and denotes the actual expressed as follows:
states of the IZ,overcurrent relays; the kth element of
ri(S) = MAX[Fbi(S), rfi(S), Fti(S)]i = 132 (1)
R, rk, represents the kth overcurrent relay and its
actual state, and rk = 0 or 1 corresponds to its ci(S, &By P) = MAX[Fbi(S, K By P>, cji(S, R, B, P),
nonoperational or operational state, respectively.
c,i(S,R,B,P)],i=1,...,8 (2)
R(5’) is a n,-dimension vector and denotes the
expected states of the IZ, overcurrent relays; the kth Ci(SyR, By P) = E,i(S, R, B, P)
element Of R(S), &(s), represents the kth OVerCUrreUt
i = 9,. . .) 11 (3)
relay and its expected state; if the kth overcurrent
relay should not operate, then &(S) should be 0, where the symbol MAX means to extract the greatest
otherwise it should be 1; R(S) is dependent on S. value from the set. The subscripts b, f and t identify
C is a n,-dimension vector and denotes the actual busbar faults, feeder faults and transformer faults,
states of the n, circuit breakers. Thejth element of C, respectively, Tbi(s), ffi(s) and Fti(s) repreSent the
cj, represents the jth circuit breaker and its actual expected states of the ith overcurrent relay when
state, and ci = 0 or 1 corresponds to its closed busbar faults, feeder faults and transformer faults
(nontripped) or tripped state, respectively. occur, respectively, Similar explanations are applicable
C(S, R, B, P) is a n,-dimension vector and denotes the to cbi(s, R, B, P), i;/i(S, R, B, P) and C,i(S, R, B, P). From
expected states of the n, circuit breakers. The jth eqns (2) and (3), it is shown that the expected state
element of C(S, R, B, P), cj(S, R, B, P), represents the formulations of CB9-CBl l are different from those of
jth circuit breaker and its expected state. If the jth CBl-CB8. This is because that the expected states of
circuit breaker should not trip, then Zj(S, R, B, P) CB9-CBl l are only dependent on the states (normal or
should be 0, otherwise it should be 1. C(S, R, B, P) is fault) of the related transformers, while the expected
dependent on S, R, B and P. states of CBl-CBS are dependent on the states of the
The fault diagnosis problem is to find S, B and P which busbars, feeders and transformers. Thus, the current
can explain the reported alarms by utilizing the operation problem is how to determine the terms on the right hand
information of overcurrent relays and the tripping sides of eqns (l)-(3), which will be dealt with below
information of circuit breakers. Now we use the simple sequentially.
example shown in Fig. 1 to illustrate how to determine From Fig. 1, it is known that the circuit breakers
Fk(S) and L;j(S, R, B, P). connected directly to the substation busbar, i.e. CBl or
The system as shown in Fig. 1 consists of 10 sections, CB5, can be tripped by the operation of either the pilot-
two overcurrent relays and 11 circuit breakers. The 10 wire protection of the related feeders (Ll or L3) or the
sections are composed of three busbars, four feeders and overcurrent relays (ri or rz). The states of the over-
three transformers. The three busbars are a, b and c. It current relays are available, while the states of the pilot-
should be pointed out that busbar d-e is not included in wire protections are not available. If we can discriminate
these 10 sections. This is because it is a substation between which kind of protection causes the tripping of
busbar, and is protected by the protective devices in the these circuit breakers, it will facilitate the formulation of
higher voltage grade network. The fault diagnosis for the expected states of the overcurrent relays and these
busbar d-e should be included in the transmission circuit breakers. A simple method is adopted, and is
network fault diagnosis (which is not the subject of clarified using the following example. If the actuating of
this paper) rather than in the distribution network fault ri and the tripping of CBl are both present in the
diagnosis. reported alarms, then the tripping of CBl must be
The four feeders are Ll-L4. The three transformers caused by the actuating of ri. Thus, the tripping
are Tl-T3. The 10 sections (si-sio) are a, b, c, Ll, L2, information of CBl is not necessary for the fault
Fault diagnosis in electrical distribution networks 73
diagnosis in this case, and we delete it from the reported ends of feeder j will also trip provided that the batteries
alarms and do not utilize it for the fault diagnosis (this at these two locations are normal. Thus, we have:
treatment is just for ease of formulation, and does not i;fl(s, R, B,f')
= ONE{ [s4 + (s5 + &j+ s7)
influence the correctness of the fault diagnosis results). If
the tripping of CBl is present and the operation of rl is XPIIH~-W (14)
not present in the reported alarms, then the tripping of &(s, R,B,P) = ONE{ [.s4+ (s5 + s6 + s,)
CBl must be caused by the operation of the pilot-wire
protection. This information is important in this case x plH(l-bl) (15)
and must be utilized in the fault diagnosis. In this way, it cn(s, R,B,P) = ONE{ [s5 + (s4 + %j+ s7)
is very easy to know whether the tripping of these circuit
breakers is caused by the pilot-wire protections or by the x~dI(l-h) (16)
overcurrent relays. This method is also used in Ref. 15 Cf4(s,
R,B,P) = ONE{ [sg + (s4 + s6 + s,)
implicitly.
x PzlHl-b2) (17)
3.2.1 Busbar fault
A busbar fault causes actuating of the overcurrent relays C&s, R, B, p) = ONE{ [sg + (s4 + s5 + s7)
at locations d and e, provided that all the circuit xp311(1-bd (18)
breakers between this busbar and d, and between this
busbar and e are all closed. Thus, we have: &(s, R,4 p) = ONE{[sg+ (~4 + s5 + $7)
XP~IW-W (19)
I;&) =,,(,, [1-ONE($~)]+ONE
Cn(s,R,B,f')= ONE{ [s7 + (s4 + s5 + 4
x~41W-bd (20)
(~ci)]~s3[I-ONE(~q+~q)l}(4) cfs(s,R,B,p) = ONE{ [ST+ (s4 + s5 + s6)
x dWb2) (21)
F&S) =MAX{,, [1-ONB($++ONB A feeder fault will cause the overcurrent relays at
locations d and e to actuate, as long as all the circuit
breakers between this feeder and d, and between this
(YJ]J+oNE(?J)]} (5) feeder and e are all closed. Thus, we have:
where ONE(x) means that if x if equal to or greater than rfl(S) = MAX { s4 ( 1 - cl )~s5[1-oNE($cj)]~
1, then ONE(x) = 1, otherwise ONE(x) = 0.
When the pilot-wire in the protection system of any
feeder is broken, any busbar fault may cause the two
s6[1WoNE($cj+$cj)]1
circuit breakers on the feeder to trip, provided that no
battery failures exist at any of the two terminal busbars.
Thus, we have: (24
s7 [l-oNE($cj+cs)]}
?bl (S, R, B, P) = pl(l-b‘,)ONE(s, + 82 + ~3) (6)
A transformer fault causes actuating of the over- It should be pointed out that in the above procedure
current relays at locations d and e, provided that the of formularization, we implicitly adopt the following
battery at its location has failed, and all the circuit assumption: the occurrence of each fault is independent
breakers between the busbar to which the transformer is of the occurrence of any other faults, or in other words,
connected directly and d, and between this busbar and e the occurrence of each fault does not limit the possible
are all closed. Thus, we have: occurrence of any other faults simultaneously or
almost simultaneously. This is a reasonable assumption
in electrical distribution network fault diagnosis, and
has been implicitly adopted by all relevant research
work.‘-‘5
The single fault restriction criterion is not suitable for The three terms on the right hand side of (37) respectively
fault diagnosis in electrical distribution networks, reflect the following three requirements for a solution or
because multiple section faults may happen simulta- solutions to the fault diagnosis problem:
neously. On the other hand, the relevancy criterion is
(a) At first, the solution or solutions should be a
not a good one for our problem, because it is too loose
cover or covers of R and C.
and may result in many solutions. The irredundancy
(b) Secondly, the expected states of overcurrent relays
criterion is generally quite an attractive one. Unfortu-
and circuit breakers corresponding to a solution
nately, there are two difficulties with directly generating or solutions should be consistent with the
the set of all irredundant covers.i7 First, this set may
reported alarms as much as possible.
itself be quite large in some applications, and may
(c) Thirdly, the solutions with minimum number of
contain many explanations (solutions) of very little fault sections and hidden defects are preferred to
probability. Second, and more serious, it may still miss
more complex explanations.
identifying the most reasonable solutions in some cases.
The minimality criterion is intuitively a reasonable In eqn (37) k, -k3 are positive weighting coefficients to
criterion, because the occurring probability of complex reflect the relative importance of these three require-
faults is generally smaller than that of simple faults. A ments. It is our opinion that the priorities of these three
modified minimality criterion is adopted in this paper, requirements should decline progressively, so kl -k3
which will be clarified below. should be specified to decrease successively; kl should be
big enough, and be specified as the biggest amongst
these three coefficients to ensure that the solution or
4.2 The objective function of the fault diagnosis problem
solutions of (37) are covers of R and C. The scaling of
eqn (37) is not a difficult problem, as long as the
For the fault diagnosis problem, we define a modified
following condition is satisfied: k, >> kz >> k3. Speci-
minimality criterion as follow:
fically, if we set k3 = 1, then k2 should be specified larger
Minimize E(S, B, P) = kl x (IVR( + IVCl) than the maximum possible number of simultaneously
occurring fault sections and hidden defects (for example
+ kz x WRI + Pcl) k2 = 10 is large enough), in other words, k2 should be
specified larger than the maximum possible value of
+k x W + 14 + IPI) (37)
ISI + IBI + (PI, and kl should be specified larger than the
where maximum possible value of k2 x (1AR1 + 1ACI). For a
AR is an n,-dimension vector, and AR = R - R(S), given distribution network, the maximum value of
AC is an n,-dimension vector, and AC = C - C /AR/ + lAC[ can be easily determined, i.e. the total
(S, R, B, J’), number of overcurrent relays and circuit breakers.
VR is a n,-dimension vector, and is determined using Following these scaling guidelines, correct results can
the following method: if the jth element of R is zero, be guaranteed mathematically, but these guidelines are
then set the jth element in VR to be 0; if the jth conservative (this means that k, and k2 may need not be
element of R and R(S) are both 1, then set the jth so large). For example, kl, k2 and k3 can be respectively
element in VR to be 0, otherwise set it to be 1, specified to be 1000, 10 and 1 for the test distribution
VC is a n,-dimension vector, and is determined using network presented in Section 6.
the following method: if the jth element of C is zero, The remaining problem is how to estimate the faulty
then set the jth element in DC to be 0; if the jth section(s) and hidden defect(s) by utilizing eqn (37) and
element of C and C(S, R, B, P) are both 1, then set the the reported alarms (i.e. R and C), or in other words,
jth element in VC to be 0, otherwise set it to be 1, how to find S, B and P which minimize E(S, B, P). This
IVRI, ,IVCI, IARI, 14, PI, lBl andIPI are the is a O-l integer programming problem. In the following
number of nonzero elements in vectors VR, VC, AR, section, we will introduce a genetic algorithm (GA) to
AC, S, B and P, respectively. solve this problem. The motivation for adopting the GA
(VRI + IVCl is a criterion to reflect if a solution of for solving this problem lies in its ability for finding
(37) is a cover of R and C. If yes, IVRl + IVCl = 0 global optimal solution(s) efficiently.
otherwise IVRl + IVCl reflects the proximity of a It should be pointed out that the minimization of
solution to a cover. The smaller is IVRl + IVCI, the E(S, B, P) can also be solved by using a conventional
more proximate to a cover is the solution; IARl + /AC1 integer programming method, such as the branch and
reflects the inconsistency between the reported alarms bound method or the Lagrangian relaxation method.
and expected states of overcurrent relays and circuit Up to now, some special classes of O-l integer
breakers corresponding to a solution of (37). The programming problems have been efficiently solved by
smaller is IARl + IACl, the more consistent are the operations research and mathematical programming
expected states and the reported alarms. They are fully solution techniques.” However, the fault diagnosis
consistent when [AR1 + IACl = 0; ISI + IBI + IPI repre- problem does not apparently fall into any of these
sents the number of fault sections and hidden defects. special cases. In addition, the fault diagnosis problem
76 Fushuan Wen, C. S. Chang
Initialize the parameters of the genetic algorithm; 5 A GENETIC ALGORITHM AND ITS
Randomly generate the oldpopulation;
APPLICATION TO THE FAULT DIAGNOSIS
For generation L:= 1 to maxgeneration
Compute the fitness of each individual in the oldgopulation;
PROBLEM
Copy the highest fitness of individual to the solution_vector;
Use tournament selection method to form matingpool; Genetic algorithms (GA)18-21 are search procedures
While the number_of_individual <population-size do whose mechanics are based on those of natural genetics.
select two parents from the matingpool randomly;
In this paper, it is used to solve the maximization
perform the crossover of the parents to produce two offspring;
mutate each offspring based on mutationqrobability;
problem of eqn (38).
place the offspring to newqopulation; A typical genetic algorithm is shown in Fig. 2, and
Endwhile some points associated with the genetic algorithm are
Replace the oldgopulation by the newqopulation; described as follows:
Endfor
(a) There are many methods to select two parents
Print out the solution_vector as the final solution
from the old population, and different GA methods can
Fig. 2. The outline of a typical genetic algorithm (in pseudo be obtained by using different selection methods. In this
Pascal form). GA, the tournament selection10”8’20is employed.
(b) When GA is used to solve an optimization
problem, it is necessary to encode the solution in a
can have multiple optimal solutions and must be fast string form. Generally, the binary encoding method is
enough for on-line applications, thus the conventional used. The crossover and mutation are operating on the
integer programming methods, such as the branch and strings to search for optimal solutions. The solution to
bound method, are unlikely to be very suitable. In recent the fault diagnosis problem in the electrical distribution
years, there has been an enormous amount of interest in network is encoded as a binary string ST = (S, B, P)
the applications of genetic algorithms (GA)“-*‘, simu- directly. This expression means that the first n bits in ST
lated annealing (SA)22123and tabu search (TS)24-26 for correspond to the elements in S sequentially, the n + 1
solving some difficult or poorly characterized optimiza- bit through n + nbf bit in ST correspond to the elements
tion problems of a multi-modal or combinatorial nature. in B sequentially, and the n + nbf + 1 bit through
Many successful applications of these methods in n + nbf + np bit in ST correspond to the elements in P
solving large scale practical problems have been sequentially.
reported recently; SA is powerful in obtaining the (c) Crossover is the most important operator in GA,
optimal solutions but its computation burden is heavy, and it is applied with probability which is typically
so it is suitable for some planning problems which are between 0.6 and 0.9. The crossover operator takes two
not time critical. The fault diagnosis problem is a time strings from the old population and exchanges some
critical problem, thus SA is not a good candidate for contiguous segment of their structures to form two
solving this problem; GA has been demonstrated to be offspring. There are several different crossover opera-
able to solve the set covering problem efficiently in Ref. tors, such as the one-point crossover,19 two-point
18, and its computation speed is faster than that of SA. crossoveri* and uniform crossover.” The uniform
Moreover, some optimization programs based on GA crossover is more powerful in exploring the solution
are able to solve very large scale and complex problems space than the one-point crossover and two-point
and can find multiple globally optimal solutions in a crossover, so it is adopted in this work.
single run, so GA is selected for this application. (d) Mutation is also an important operator of GA. In
Recently, TS has emerged as a new, highly efficient, a binary encoded GA, the mutation operator randomly
search paradigm for quickly finding high quality switches one or more bits with some small probability
solutions to combinatorial optimization problems, which is typically between 0.00 1 and 0.1.
but its application to power systems is just starting (e) The variable probability techniques1s>21are applied
and its computational efficiency remains to be investi- to the crossover and mutation operators in the GA.
gated. It will be a future topic to explore TS’s Initially, a probability for each is entered. For every
application in the fault diagnosis problem of electrical generation thereafter, the probability of crossover is
distribution networks. linearly decreased while the probability of mutation is
In genetic algorithms, the fitness function (i.e. the linearly increased. From the computational mechanism
objective function) is maximized and positive. Thus, the of GA, the probability of crossover should be decreased
following fitness function is used in solving the fault and the probability of mutation should be increased in
diagnosis problem by genetic algorithms, order to increase the computational efficiency and the
opportunities to find optimal solutions.” Limits on
f(S, B, P) = w - E(S, B, P) (38) these probabilities must be set so that they do not exceed
the permitted intervals. In this paper, the permitted
where W is specified as a very large positive constant interval for P, is between O-6 and 0.9, and for Pm, it is
which is used to guarantee the fitness function to be between O*OOl and 0.1; P, and Pm are changed from
positive, and W = lo6 is used in this work. generation to generation according to the following
Fault diagnosis in electrical distribution networks 77
fl 31 f :a11 j r3 319 m
LI
!i!
Tl
CE!S IX2 LlO
-83
CD3 :CSi2
1
T9
-i
LZ
:a13 a33 320
n --I
CBZI
CD4
=.. -d
cm
L3 Lll
n
CB2f CM
f -c
9
II
ml
a34 cm
L4
-k
T4 cn23
Cm: a2
!i! -b
CD9 L12
I.3
ls
3810 cm4
zs -6
equations: solutions stored in the array and they are not the same
solutions, then we put the best solutions in the current
$1 = &-‘) - [PLO’- 0.61 /MG (39) generation into the array, thus the array is expanded.
Otherwise we do not change the record of the array.
P$ = I’;-” -I- b.1 - P:‘]/MG (40) Note that the array only contains those solutions which
are found to be the best up to the current generation,
where t denotes the number of the generation (i.e. the
and only a copy can be stored in the array for each of
iteration number), MG is the maximum permitted
the best solutions. Thus, at the end of the GA operation,
generation number, PLO’ and Z$’ denote the initial
the array will contain all the different best solutions
values of the crossover probability and the mutation
found during the operation. If the parameters of GA
probability, respectively, P!’ and P$ denote the cross-
(for example, population size, MG, PC and P,) are
over probability and the mutation probability at the tth
properly specified, multiple global optimal solutions can
generation, respectively. In this work PLO’and PEO’are
be found in this way. This has been verified by the
set to be O-9 and 0.001, respectively.
following numerical example.
The GA as stated above is powerful in finding the
global or near global optimal solution of an optimiza-
tion problem. But it is shown from the simulation results
that the GA can usually find only one global or near 6 TEST RESULTS
global optimal solution. For the fault diagnosis pro-
blem, multiple solutions may exist especially for com- We have used a larger sample distribution from Ref. 15
plex fault cases. In order to find all reasonable solutions, as shown in Fig. 3 to test the method developed for the
the GA must be modified.’ The modification is as fault diagnosis problem. This system consists of 32
follows. At the first generation, we pick a copy for each sections, three overcurrent relays and 34 circuit break-
of the best solutions from the population and store them ers. The 32 sections are composed of 10 busbars, 12
in a specially designed array. In each of the follow-up feeders and 10 transformers. The 10 busbars are a, b, c,
generations, we check if the best solutions in the current d, e, g, h, i, k and 1. The 12 feeders are Ll-L12. The 10
population are better than the solutions stored in the transformers are Tl-TlO. The 32 sections (s,--s~~) are a,
array. If yes, we use the best solutions in the current b, c, d, e, g, h, i, k, 1, Ll, L2, L3, L4, L5, L6, L7, L8, L9,
generation to replace the record of the array. If the best LlO, Lll, L12, Tl, T2, T3, T4, TS, T6, T7, T8, T9 and
solutions in the current population are as good as the TlO, respectively. The three overcurrent relays (ri-rs)
78 Fushuan Wen, C. S. Chang
are the overcurrent relays at locations f, j and m, correctly actuated to successfully trip the related circuit
respectively. The 34 circuit breakers (ci -cs4) are CBl, breakers. The others are complicated fault scenarios
CB2, . . ., CB34, respectively. There are 13 battery which consist of cases of malfunction of protective
locations (bi-bij), i.e., a, b, c, d, e, f, g, h, i, j, k, 1 relays and/or circuit breakers for singIe section fault
and m. There are 12 possible open-circuited pilot-wires cases and multiple section fault cases. In terms of the
(pi-pt2) in the feeder protection system corresponding actuating logics of the protective relays, all the results on
to Ll-L12, sequentially. fault diagnosis are correct. Due to space limitation, only
More than 50 fault scenarios have been tested. the detailed results for 10 complicated faults rather than
Among them, some fault scenarios are due to a single single faults are shown in Table 1.
section fault and the corresponding protective relay(s) The simulation results show that the proposed
Fault diagnosis in electrical distribution networks 19
18. Davis, L., Handbook of Genetic Algorithms. Van Non- 22. Kirkpatrick, S., Gelatt, C. D. & Vecchi, M. P., Optimiza-
strand Reinhold, New York, 1991. tion by simulated annealing. Science, 1983, 220, 671-80.
19. Goldberg, D. E., Genetic Algorithms in Search, Optimiza- 23. Szu, H. & Hartley, R., Fast simulated annealing. Physics
tion and Machine Learning. Addison-Wesley, Reading, Letters A, 1987, 122, 157-62.
MA, 1989. 24. Glover, F., Laguna, M. Taillard, E. & Werra, D., Tabu
20. Ding, H., El-Keib, A. A. & Smith, R., Optimal clustering Search. Science Publishers, Basel, Switzerland, 1993.
of power networks using genetic algorithm. Electric Power 25. Glover, F., Tabu search - part I. ORSA Journal on
Systems Research, 1994, 30, 263-7. Computing, 1989, 1, 190-206.
21. Sheble, G. B. & Brittig, K., Refined genetic algorithm: 26. Glover, F., Tabu search - part II. ORSA Journal on
economic dispatch example. IEEE Transactions on Power Computing, 1990, 2, 4-32.
Systems, 1995, 10, 117-24.