Beruflich Dokumente
Kultur Dokumente
Abstract—The Protection coordination of overcurrent system barring to strong section of the network. In power
relays in power framework plays a crucial role to protect the system, the utmost protection system is the overcurrent
electrical distribution systems by presenting primary as well as protection. Either in distribution or sub-transmission
backup protection to system. The coordination between these systems, this type of protection could be used as a primary or
relays should be kept at minimum to minimize the overall secondary protection, also in this scheme adjacent electrical
operating time and assure that the least power outages and equipment protected by proper coordination of relays, which
damage is produced during the fault conditions. This is makes the system reliable, and life worthy. The primary and
necessary to assure that the relays setting should not create an secondary Protection work in parallel as backup protection
unintended operation and consecutive sympathy trips. This
wait for the operating time of primary protection to clear the
paper describes a Modified seeker algorithm (MSA) for
optimal coordination of directional overcurrent relays and is
fault if it fails than backup protection should initiate its
formulated as an optimization problem. The robustness, operation after certain interval of time known as coordination
effectiveness and efficiency of the MSA algorithm is tested on time interval (CTI).The system will malfunction or mal-
IEEE 8 bus. The results achieved by the modified seeker operate if the relays not coordinated in the interval of time.
algorithm are compared with other evolutionary optimization These relaysare useful choice from technical as well as
techniques and it was observed that the proposed scheme is economical point of view for industrial sector in term of
quite competent for dealing with such problems. From primary protection in sub-transmission systems and back up
analyzing the obtained results, it has been found that the MSA protection in transmission system [1, 2]. The faulty section in
approach provides the best and optimum solution. MSA has power system is immediately isolated with the help of circuit
achieved a lot of relaxation to its easy implementation, modesty breakers, once fulfill the requirements of selectivity,
and robustness. MATLAB computer programming has been sensitivity and reliability which make coordination important
implemented to see the effectiveness of the proposed algorithm. for these relays [3]. The main goal of coordination issue is to
assure that relays do not operate out of circle, avoid the
Keywords—Modified Seeker algorithm (MSA), Directional irrelevant disconnectivity of the healthy section and prevent
over current relays, coordination optimization, Power system mal operation of the relays so that the framework has the
protection, Time dial setting minimum possible fault fairing time. The objective of
optimum coordination problem is to sort out an optimum
I. INTRODUCTION relay settings, subject to relay characteristic graphs, and
Recently real protection system gains more importance in constrains limits of relays setting. In ring or multiple source
interconnected distribution system for transferring of real networks the overcurrent relay coordination is highly
power to industries, telecommunication networks as well as constrained optimization problem. Generally, this
to consumer’s level. This continuous supply of power can coordination problem is mixed integer nonlinear
only be possible with a reliable and healthy power system. If programming (MINLP) which can be cleared by using
this electric power system fails to supply the power there is a evolutionary or metaheuristic method. Different evolutionary
possibility of shut down of the plant and industries, in order technique have been interrogated to deal the power system
to keep the system in a healthy condition there is a need to problem in the technical survey [4-8]. In addition the
model a reliable protection system which can supply power changes in network topology and configuration should be
continuously without any interruption. In any power plant the taken into account for optimal relay setting [9-10].The
safety of the power framework must be designed so that the coordination problem is formulated as a linear Programming
protective relay should clear the erroneous area of the system Problem in [11-13]. In [13] the values of time dial setting are
to prevent equipment from damage and ensure minimum minimized with the help of linear formulation. In [14-19]
This research was supported by Korea Electric Power Corporation, different genetic algorithm were resolved to find the
grant number (R17XA05-38). coordination problem. In [17] grey wolf optimizer for relay
ఈ
ܶ ൌ ܶܵܦ ቌ
ೖ ቍ(2)
൬ ൰ ିଵ
536
algorithm starts its initialization by effectuating a population weak or worst member by the best member, same case is
of indiscriminate individuals. However in this method the with the proposed algorithm.In this mechanism there is a
population member is known as seeker which represent their competition between seekers for finding the best and worst
respective population. When the total population is split into position in a sub-population. Those seekers which found the
few sub-populations their starts a competition between the best position in the sub-population are promoted to next
seeker for finding the global optimum. So all sub-populations generation by replacing the worst seekers. If the total
in this competition trying to measure their discovery to number of sub-population is K than in each sub-population
vanish from the local minima. The main and important the worst seeker are discarded and its position is taken by
parameter of this technique is to measure the search direction the best seeker of the remaining K sub-populations. The
and step length of seeker during the race. These parts are
worst seekers in each subpopulation is discarded by best
dependable on the objective value function associated with
constraints. locations of the rest K-1 sub-populations. As shown in Fig.
3 the two worst seekers of each subpopulation are retrieved
A. Step Length with the best seekers of the resting two subpopulations.
In the proposed scheme the step length has been found in
an adaptive way while in previous evolutionary optimization
techniques the step length is fixed. However the step length
should be lower in order to the extremum. The step length
can be illustrated as fuzzy judgment regarding the optimal
point in case of evolutionary technique which are inspiredby
the performance of human search. In this case two types of
membership is assigned that is a linear membership function
and bell-type membership function. These two functions are
used in the fuzzification and defuzzification itinerary. For
step length determination and to model a fuzzy rule all the
fitness points in the section are categorized from minimum to
maximum range. After that each seeker is assigned a number Fig.3. Inter subpopulation learning Mechanism.
dependent on its performance and rank. In the Fuzzy system
that rank or number which is assigned to seeker is fed as an C. Steps of Modified Seeker Algorithm
input to that framework with a linear membership form as The modified seeker algorithm is implemented, as
follows: shown in flow chart
Rank of seeker (s ݏ אൌ ͳ…Npop)
ሺܰ െ ܴ ሻ
ߤ ൌ ߤ௫ െ ሺߤ െ ߤ ሻǤ Ǥ ǡ ܰሺሻ
ሺܰ െ ͳሻ ௫
Where parameter ߤ and ܴ represent the membership
value and the rank of the ith seeker in the splinted area
respectively. The good and bad position in population
depends on the higher and lower membership of the seeker.
The membership can be assigned by using a bell membership
function and can be expressed as
మ ൗିଶఈ ൯
Bell member function = ߤఈ ൌ ݁ ൫ఈೕ ೕ (8)
The membership values for the members outside is[-
3ߙ ͵ߙሿand are fixed atߤ , whereas the parameter ߙ
shows an indicator and could be found byߙ ൌ ߱Ǥ ሺܺ௦௧ െ
ܺௗ ሻ which helps in search radius in a random vector.
However the parameter ߱weighting factor and its function is
to reduce the step length towards future while ܺ௦௧ is the
best seeker in same population,
ఠೌೣ ିఠ
߱ሺݐሻ ൌ ߱௫ െ Ǥ (ݐ9)
௧ೌೣ
Where‘t’ represents the number of iteration. Finally,
using the bell function the step length will defuzzified as
follows:
ߙ ൌ ߙ ඥെሺ݀݊ܽݎሺߤ ǡ ͳሻሻ(10) Fig. 4. General Flow chart of Modified Seeker Algorithm
Where ݀݊ܽݎሺߤ ǡ ͳሻ generates a random number in the IV. RESULTS AND DISCUSSION
interval [ ߤ ǡ ͳሿ.
The proposed algorithm used to coordinate the DOCR
B. Inter sub-population learning Mechanism tested on IEEE 8-bus system and the results had been gained
In all the evolutionary optimization algorithms there is race utilizing Matlab optimization toolbox. The system detail of
for finding the best and optimal position by replacing the IEEE-8 test system is given in [21]. This test system
537
comprises of seven lines and 14 relays as shown in Fig. 5, 8 6093 7 1890
and has 28 design variables and 20 constraints. For pickup 8 6093 9 1165
tap setting values to get a comparison seven discrete tap 9 2484 10 2484
setting value are selected (i.e., 0.5, 0.6, 0.8, 1.0, 1.5, 2.0, 10 3883 11 2344
and 2.5). The proposed setting for current transformer ratio, 11 3707 12 3707
minimum and maximum values of time dial and plug setting 12 5899 13 987
for relays is shown in Table I. A coordination interval of 0.3 12 5899 14 1874
is chosen. Table II shows the short-circuit current for near- 13 2991 8 2991
end short-circuit faults. While Table III, shows seeker 14 5199 1 996
parameter proposed for the IEEE 8 bus system .The optimal 14 5199 9 1165
operating times of primary relays (TDS) value are shown in TABLE III. SEEKER PARAMETERS FOR 8 BUS SYSTEM.
table IV While table V obtains the comparative result of the
proposed technique with other evolutionary algorithm Seeker Parameters value
explain in the refrences. ߤ௫ 0.0111
ߤ 0.9500
߱௫ 0.9000
߱ 0.1000
ܰை 100
TABLE IV. OPTIMAL TDS, FOR 8-BUS SYSTEM.
Relay No Proposed Algorithm
TDS PTS
1 0.1311 2.0
2 0.1215 2.5
3 0.1264 2.5
4 0.1453 2.5
5 0.1810 2.5
6 0.1201 2.5
7 0.1102 2.5
8 0.1203 2.5
9 0.1463 2.5
10 0.1437 2.5
Fig. 5. Single line diagram of 8 bus system 11 0.1754 2.5
12 0.1217 2.5
TABLE I. PROPOSED SETTINGS FOR IEEE 8 BUS SYSTEM 13 0.1054 2.0
14 0.1103 2.5
Relay CTR TDSmin TDSmax PTSmin PTSmax
Total Operating Time σ ܶ݅݅ 5.2375
1 1200/5 0.1 1.1 0.5 2.5
2 1200/5 0.1 1.1 0.5 2.5 TABLE V. COMPARISON OF THE PROPOSED METHOD WITH THE
3 800/5 0.1 1.1 0.5 2.5 LITERATURE.
4 1200/5 0.1 1.1 0.5 2.5 Method Objective function
5 1200/5 0.1 1.1 0.5 2.5 Linear method [28] 11.0645
6 1200/5 0.1 1.1 0.5 2.5
Nonlinear method[28] 6.41169
7 800/5 0.1 1.1 0.5 2.5
8 1200/5 0.1 1.1 0.5 2.5 Genetic algorithm [19] 11.001
9 800/5 0.1 1.1 0.5 2.5 Hybrid GA-LP [18] 10.9499
10 1200/5 0.1 1.1 0.5 2.5 Seeker algorithm [29] 8.4270
11 1200/5 0.1 1.1 0.5 2.5 Proposed algorithm 5.2375
12 1200/5 0.1 1.1 0.5 2.5
13 1200/5 0.1 1.1 0.5 2.5 As seen in table IV and V that the proposed technique
14 800/5 0.1 1.1 0.5 2.5 optimizes the TDS values to minimum. As compared to other
evolutionary techniques, this technique achieves and
TABLE II. NEAR END 3 SHORT CIRCUIT TEST FOR IEE-8 BUS performs better. The depicted methodology gives an optimal
SYSTEM
solution and lower total operating time ሺσ ܶ݅݅ሻand is capable
Primary Fault current Back up Fault current of solving the directional overcurrent relay problem in a fast
Relays (A) relays (A) and better way. Fig. 6 shows best values of objective
1 3232 6 3232
function found during the course of simulation or we can say
2 5924 1 996
the convergence characteristics which show that the
2 5924 7 1890
convergence is fast and obtain better solution for objective
3 3556 2 3556
function in less number of iterations.
4 3783 3 2244
5 2401 4 2401
6 6109 5 1197
6 6109 14 1874
7 5223 5 1197
7 5223 13 987
538
40 [10] H. A. Abyaneh, H. Majid Al-Dabbagh, K. Karegar, S. H. H. Sadeghi,
R.A. J. Khan, “A new optimal approach for coordination of
overcurrent relays in interconnected power systems,” IEEE Trans.
35
Power Deliv. Vol. 18,pp. 430–435, 2003.
[11] A. J. Urdaneta, H. Restrepo, S. Marquez, J. Sanchez, “Coordination
30 of directional overcurrent relay timing using linear programming,”
IEEE Trans. Power Deliv. Vol. 11,pp. 122–129, 1996.
25 [12] H. K. Karegar, H. A. Abyaneh, V. Ohis, M. Meshkin, “Pre-
Best Score
539