Escolar Documentos
Profissional Documentos
Cultura Documentos
Genetic Algorithm
A.Koochaki*, M.R.Asadi**, M.Mahmoodan**, R.A.Naghizadeh**
*Islamic Azad University, Aliabad-Katool, Iran
**Amirkabir University of Technology, Tehran, Iran
Abstract For optimal co-ordination of Overcurrent (OC)
relays, linear programming techniques such as simplex, twophase simplex and dual simplex are used. Another way of
optimal coordination program is using artificial intelligent
system such as genetic algorithm (GA). In this paper a new
approach will be used for optimal coordination of OC relays
based on genetic algorithm. In this work we take into
account both time setting multiplier (TSM) and plug setting
multiplier (PSM) of OC relays in optimization procedure.
Most OC relays accept only discrete values as TSM and
PSM, and you should change your final answers to discrete
form and this may corrupt the optimization. In this paper
the act of quantizing the answers is taken into account as a
part of optimization procedure, so the outputs are optimized
discrete TSMs and PSMs. In other words the novelty of
the paper is taking into account the PSM in addition to TSM
to handle miscoordination problems both for continues and
discrete TSM and PSM. The results obtained are quite
encouraging and will be useful as an effective tool for
coordination OC relays.
Index Terms Overcurrent relays (OC), Time setting
multiplier (TSM), Plug setting multiplier (PSM), Optimal
Coordination
I. INTRODUCTION
During the operation of a modern interconnected
Power system, abnormal conditions (faults, overload,
over-voltage, under-frequency, etc.) can frequently occur.
Such conditions cause interruption of the supply, and
may damage the equipments connected to the system,
arising the importance of designing a reliable protective
system. In order to achieve such reliability, a back-up
protective scheme is provided to act as the second line of
defense in case of any failure in the primary protection
(the first line of defense). To insure reliability of the
protective system, the back-up scheme shouldnt come in
to action unless the primary (main) fails to take the
appropriate action. In other words, it should operate after
a certain time delay known as coordination time interval
(CTI), giving the chance for the primary protection to
operate. The fore mentioned situation leads to the
formulation of the well-known protective relay setting
coordination, that consists of the selection of a suitable
setting of each relay such that their fundamental
protective function is met under the desirable qualities of
protective relaying, namely sensitivity, selectivity,
reliability, and speed[1].
Intelligent optimization techniques such as GA have
come up which can adjust the settings of relays. In these
methods the constraints are included as part of Objective
Function (OF). Some developed a method based on GA
for optimal coordination. This method has two problems.
t mb = tb ( F1 ) t m ( F1 ) CTI > 0
(1)
t mb = tb ( F2 ) t m ( F2 ) CTI > 0
(2)
B.
Initialization. The first Parents chromosome
pool should be generated by creating several sets of relay
settings randomly such that all sets of the relay settings
totally satisfy all the constraints. Each set of relays setting
is packed into a chromosome. The key variable in the GA
is the chromosome and it consists of all relay TSMs and
PSMs. The number of TSMs and PSMs sets is referred
as the population size. After each iteration, the new
TSMs and PSMs belong to relays R1 to Rn are given to
the algorithm. G is the counter of generation and initially
is set to 1. Then the procedure of part BE of this section
is done. After that, the value of G is increased by one and
the procedure is repeated. When the value of G becomes
equal to the generation size the process is terminated.
C.
Evaluation. To evaluate the goodness of each
chromosome regarding the user preferences on the relay
grading method, the OF value and the other variables
related to it are evaluated.
D.
Selection. According to the calculated OF values
of Parents at each generation, some parents are more
distinct than others. Based on a concept called elitism,
those parents who have more optimal OF values in the
Parents chromosome pool, should be granted more
opportunities to survive, so that they can generate more
offsprings. The roulette wheel selection could then be
used with this enhanced selection list. In this part of the
flowchart, the minimum value of OF in each stage is
chosen.
E.
Reproduction and mutation. The reproduction is
responsible for producing offsprings by the genetic operation crossover and mutation. Checking and evaluating of
each new offspring satisfaction is required in order to
form the Children chromosome pool. The offspring
may be improved by making some favorable change in
crossovers and mutations. Mutation sometime introduces
new genetic material into a heterogeneous population, but
may introduce bad chromosomes. The probability of
permutation should not be overemphasized. Moreover, all
the mutated offsprings must be tested for constraint
satisfaction and those that failed are eliminated. The new
offsprings indicate the TSMs and PSMs of relays. I is
the counter of population and similar to G is counted until
the population size.
F.
Selection from Children and Parents for
the next generation. It is common in optimization
methods to find that the OF value is extremely sensitive
to one parameter, whilst large changes are still needed in
another parameter to cause significant changes. GA also
suffers from the same problem. To deal with such
inequities, the pre-scaling technique is employed. The OF
value of each chromosome, i.e. a set of relays TSMs and
PSMs of the Parents will be converted to a raw fitness,
and then to a scaled fitness and finally to the expected
frequency of selection as a parent.
G.
Finishing. The process will be finished after a
fixed number of generations. Due to the fact that
improvement may not come out quickly, more
generations are preferable. This will improve the
chromosome pool and will prepare better genetic material
for future generations. The required number of
generations varies from system to system depending on
the system complexity and the size of population.
III. PROPOSED APPROACH
Three parameters have to be determined in order to set
and coordinate overcurrent relays:
A. Discrete and continuous TSM and PSM
As described in Section I, the existing method has
solution for either discrete or continuous. In the
newmethod, a procedure is made to take into account
both discrete and continuous TSMs and PSMs. Both the
traditional and optimal GA coordination methods find the
optimal results by arranging many iterations.
However, the idea of the new method for discrete
values of TSMs and PSMs is to solve the problem by
considering that TSMs and PSMs are continuous,
initially. But, after the completion of each iteration and
before starting the evaluation part of the flowchart, the
obtained TSMs and PSMs are rounded to the next
allowable discrete value marked on the relays. In other
word, at each stage of OF computation, the values of
TSMs and PSMs which vary continuously inverted to
next allowable discrete values. That means the optimal
OF for rounded TSMs and PSMs which solves
inherently miscoordination is automatically selected.
Of course for relays with continuous TSMs and
PSMs, the inversion of TSM and PSM to discrete values
is not made. This is because the output results already
]2
(3)
(t )
(t
and 2 is
mb
) .
be equal to t mb , i.e.
(4)
3
2
t
= 1 +
+
+
1
TSM
(M 1) (M 1)2
5
4
+
+
3
(M 1) (M 1)4
(5)
Backup
relay
Primary relay
shortcircuit
current
Backup relay
current
524.2
524.2
507.7
507.7
567.0
567.0
608.3
277.7
339.9
339.9
608.3
330.8
TABLE II
GENETIC ALGORITHM PARAMETERS
Number of generations
300
Size of population
100
Initial population
Mutation
Random
10
TABLE III
GENETIC ALGORITHM OUTPUT
Cases
Case 3: 1 = 1;
2 = 2; 2 = 0
Case 1: 1 = 1;
2 = 2; 2 = 100
Case 2: 1 = 20;
2 = 1; 2 = 10
Generation
400
400
1000
1000
TSM1
0.25
0.3
0.3
0.15
0.2
0.25
0.25
0.1
0.25
0.2
0.25
0.2
0.25
0.3
0.3
0.15
TSM2
TSM3
TSM4
TSM5
Case 4: 1 = 1;
2 = 2; 2 = 100
0.05
0.05
0.1
0.05
TSM6
TSM7
TSM8
0.15
0.15
0.05
0.15
0.15
0.05
0.1
0.15
0.05
0.15
0.15
0.05
PSM1
PSM2
PSM3
PSM4
PSM5
PSM6
PSM7
PSM8
%125
%125
%100
%100
%100
%125
%100
%100
%125
%125
%100
%125
%100
%100
%100
%100
%125
%100
%100
%100
%100
%125
%100
%125
%125
%125
%100
%100
%100
%125
%100
%100
t 41
0.0811
-0.0400
-0.2556
-0.0400
t 62
0.0379
+0.0211
-0.4000
+0.0211
t 73
0.0812
+0.0612
-0.2593
-0.1112
t 86
0.1462
-0.0119
-0.3935
+0.1211
t 54
0.0412
+0.0411
-0.2273
+0.1988
t 87
0.1518
-0.0111
-0.2092
+0.1438
OF value
2.6876
44.6186
2.4676
2.6876
APPENDIX
TEST SYSTEM DATA.
GENERATOR INFORMATION
LINE INFORMATION
Line
R (pu)
X (pu)
V (kV)
0.40
0.20
10
0.28
0.19
10
0.24
0.13
10
0.38
0.19
10
0.40
0.23
10
.030
0.17
10
0.26
0.15
10
0.50
0.22
10
Generator
R (pu)
X (pu)
V (kV)
0.10
0.30
10
TRANSFORMER INFORMATION
Transformer
R (pu)
X (pu)
0.01
0.03
CT PRIMARY CURRENTS
Relay
CT primary
current [A]
Relay
CT primary
current [A]
75
75
50
50
75
75
75
125