00871269
00871269
TABLE I
RELAY SETTING METHODS
duce the next generation. Several sets of relay settings are al-
tered by a process called “mutation” to produce several sets of
new relay settings as the next generation. The mutation is based
on Gaussian normal distribution noise as shown in
where
Note: In each system configuration, each coordination pair of element of relay settings;
equipment will be iterated by , , scale factor for EA mutation;
offset for EA mutation;
IV. TIME COORDINATION ALGORITHM effectiveness of the relay settings which can be
The key steps of the time coordination algorithm are shown reflected in its objective value;
in Fig. 3. The time coordination is classified as constraint satis- Gaussian normal distribution noise.
faction optimization and each stage of the coordination process The scale factor and the offset are to control the perfor-
is discussed in the following. mance of the EA and are typically set to 1 and 0, respectively.
These newly generated relay settings should be passed to con-
A. Initialize Relay Settings straints checking and objective calculation for the next EA gen-
eration.
Several sets of relay settings will be randomly generated.
Each set of relay settings will be checked against all system con- C. Constraint Checking
straints and configurations. The effectiveness of the relay set-
tings is calculated by (2). Any violation of system constraints In (2), is the number of constraint violations. Each relay
will be penalized and this will be reflected in the increased ob- settings will be checked under different coordination pairs. If
jective value. the time difference of the coordination pair is less than the co-
ordination time margin, will be incremented by one. More
B. Evolutionary Algorithm constraint violations of relay settings will result in a larger ob-
jective value and will lead to less chance of surviving in the next
The evolutionary algorithm (EA) is a stochastic parallel
generation. In the constraint checking, the relay operation time
search method for multivariables. It can find out the optimum
and coordination margin also be calculated. The ob-
relay settings in a fixed number of generations with maximum
jective value can be calculated for the next generation.
satisfaction of coordination constraints. The industrial power
network under study is very complex. It contains a large D. Termination
amount of variables and numerous constraints. The optimal
The process will stop after a fixed number of generations. The
relay settings may be considered as the global optimum point
number of generations required to carry out the optimum relay
on the solution searching space. Conventional searching
setting depends on the pattern and the number of initial relay
methods, such as steeper-decant and nonlinear programming
settings.
[1]–[3], perform a single-point search. In most cases, the global
optimum probably will not be reached just for one trial due to
V. SIMULATION
being trapped by the local optimums.
EA employs a multipoint search methodology. The chances The simplified industrial network for this study is shown in
of reaching the global optimum are, therefore, much higher. Fig. 4. The system parameters are listed in Tables II and III. For
It is based on the modified evolutionary programming tech- the demonstration of the significance of the time-grading algo-
nique [6]–[9] by applying mutations of relay settings to pro- rithm, all transmission lines at both ends are protected by inverse
1238 IEEE TRANSACTIONS ON INDUSTRY APPLICATIONS, VOL. 36, NO. 5, SEPTEMBER/OCTOBER 2000
TABLE II TABLE IV
GENERATOR PARAMETERS RELAY SETTING RULES (DIST 1 IS THE ZONE 1 SETTING OF DISTANCE RELAY
TABLE III
TRANSMISSION LINE PARAMETERS
TABLE V
BEST RELAY SETTINGS AMONG 200 INITIALIZED RELAY SETTINGS