Professional Documents
Culture Documents
Research Article
Optimal Overcurrent Relay Coordination Using Optimized
Objective Function
Seyed Hadi Mousavi Motlagh1,2 and Kazem Mazlumi1
1
2
1. Introduction
Protection of distribution networks is one of the most important issues in power systems. Overcurrent relay is one of
the most commonly used protective relays in these systems.
There are two types of settings for these kinds of relays: current and time settings. A proper relay setting plays a crucial
role in reducing undesired effects of faults on the power systems [1, 2]. Overcurrent relays commonly have plug setting
(PS) ranging from 50 to 200% in steps of 25%. The PS shows
the current setting of the overcurrent relays. For a relay
installed on a line, PS is defined by two parameters: the minimum fault current and the maximum load current. However,
the most important variable in the optimal coordination of
overcurrent relays is the time multiplier setting (TMS) [3].
So far, some researches have been carried out on coordination of overcurrent relays [37]. Due to the difficulty of
nonlinear optimal programming techniques, the usual optimal coordination of overcurrent relays is generally carried out
by linear programming techniques, including simplex, twophase simplex, and dual simplex methods [3]. In these methods, the discrimination time of the main and backup relays
(mb ) are considered as constraints and then the optimal
coordination problem is solved using both objective function
2
parts of the network. Obviously, in this case, the number of
interrupted customers increases and consequently the power
quality declines.
In [10], continuous genetic algorithm has been used
in a ring fed distribution system for optimal coordination
of overcurrent relays. In [11], an objective function has
been proposed in which the problem of miscoordination
has almost been solved. The objective function of [11] can
prevent the appearance of inappropriate results which make
miscoordination. Suitable parameter initializing has been
considered in the objective function of the paper that weights
both the time and the delay time of the backup relays. The
main shortcoming of the objective function of [11] is that
some of the coefficients of objective function are set by try and
error. It is proved by experience that using such coefficients
cannot guarantee accessing to the smallest operation time of
the relays. In some cases, using inappropriate parameters in
objective function may result in some miscoordination.
In this paper, a new method for directional overcurrent
relay coordination is proposed in which not only the miscoordination is omitted but also operation times of the relays
are the smallest. This is because, in this novel algorithm,
the coefficients of the previous proposed objective function
are considered a part of the optimization problem. So the
coefficients of the objective function are not constant and
they are not set by try and error. In the proposed method,
the coefficients are calculated based on the optimization
technique. The optimization problem of this paper is solved
using a hybrid genetic and particle swarm optimization
algorithm. This method is applied to 6-bus and 30-bus sample
networks. The results of this method are compared with the
results of the existing ones. The simulation results and the
comparisons demonstrate the effectiveness and the advantage
of the proposed algorithm.
3. Problem Statement
To prevent overcurrent relays miscoordination and to find the
optimum results of the objective function of [11], the novel
objective function is formulated as follows:
= 1 ( ) + 2
(mb (mb mb )) ,
(1)
(2)
where b and m are the operating time of the backup and main
relays when a fault occurs next to the main relay. The value
of coordination time interval (CTI) is mainly chosen based
on the practical limitations, which consist of the relay overtravel time, the breaker operating time, and the safety margin
for the relay error [15]. Generally, the suitable CTI is selected
between 0.2 and 0.5 second. In this study, CTI is considered to
be 0.3 seconds. According to the proposed objective function
of [11], the weighting coefficients (, 1 , 2 ) are set by try and
error and also the coefficients of (, ) are constant and
cannot guarantee accessing to the smallest operation time of
the relays.
The first term of (1) is the sum of overcurrent relays
operating time and the second term is the coordination
constraint. To describe the role of the second term of the
above object function, consider that mb must be positive;
then the relative expression (mb (mb |mb |) is equal
to mb . Exactly the mentioned equation, if mb is negative
is, as follows:
(1 + 2) (mb ) .
(3)
Start
Initial generation
GA operators
Evaluate objective
function
End iteration?
Mutation
No
Crossover
Update Pbest
Yes
Update gbest
Selection
Position update
PSO operators
End
4. New Method
In this paper, the five coefficients of (1), that is, , 1 , 2 ,
, and , beside TMSs, are incorporated as a part of
the optimization parameters. The new objective function is
shown in (1).
To understand the importance of these coefficients the
following notes are helpful.
(i) To assure minimizing the main relay operating time,
a great value must be assigned to 1 and .
(ii) To assure minimizing the backup relay operation
time, a great value must be assigned to 2 and .
(iii) To prevent miscoordination and have faster and more
accurate convergence, choose a large value for and
.
According to the above notes, it is obvious that determining these five coefficients as well as the TMS of the relays
with an optimization algorithm will result in a better relay
coordination. Therefore, the method presented in this paper
optimizes the objective function coefficients as well as the
TMSs of the relays to have a tradeoff between the fast operating time and preventing miscoordination. The algorithm
applied to the relays coordination optimization problem
for the proposed technique is provided in Figure 1. In the
first step of the algorithm, the initial values are randomly
guessed. The initial values consist of both relays TMS and
the coefficients of the objective function. The relay settings
are packed into a packet; each packet is a probable result for
the optimization problem; and therefore each member of a
packet represents a TMS of a relay. In addition, there are five
extra coefficients that should be optimized which belong to
the objective function (1 , 2 , , , and ). In the second
step, the packet is evaluated by the objective function of (1).
The objective function determines the value of each packet
by receiving the TMS of all relays. After evaluation process,
the best packet is chosen from the least objective function
output point of view. In the next step, finishing criteria of
algorithm are checked to be the limited iterations and yield a
TMS
+ ,
(sc /0 ) 1
(4)
Backup relay
Primary relay
SC current
Backup relay
current
9
7
7
1
2
3
4
5
14
1
9
6
10
11
12
14
13
8
5
13
4961
4961
5362
5362
3334
2234
1352
4965
4965
4232
4232
2682
1443
2334
3480
5365
5365
2490
4232
4232
410
1520
1528
804
3334
2234
1352
411
1522
794
407
2682
1443
2334
3480
1529
805
2490
407
794
Maximum load
current
Relay number
Maximum load
current
416
666
500
666
458
458
541
8
9
10
11
12
13
14
458
450
458
541
458
500
666
(5)
(m,b)=1
Mutate range
Crossover range
Number of variables
Number of population
Maximum iteration
Maximum subiteration GA
Maximum subiteration PSO
0.3
0.7
19
100
200
10
10
(6)
R10
R2
R8
R4
R9
R14
R7
R6
R13
R1
R3
R5
R12
R11
54
42
79
57
85
86
14
38
81
82
39
80
36
40
37
41
78
76
30
29
72
35
55
12
50 52
58
74
77
84
31
24
67
56
71
70
26
49
13
65
25
34
83
33 73
15
66
75
69
68
20
23
32
22
63
19
59 16
47
62
18
64
21
48
61
5
46
45
44
3
2
1
Coordination output
TMS1
TMS2
TMS3
TMS4
TMS5
TMS6
TMS7
TMS8
TMS9
TMS10
TMS11
TMS12
TMS13
TMS14
1
2
3
4
5
6
7
8
9
10
11
12
13
14
89
87
27
21
32
43
54
65
6,14
14,1
14,9
16
9,10
10,11
11,12
12,14
12,13
13,8
7,5
7,13
TMS
Reference [11]
0.15
0.35
0.25
0.1
0.1
0.25
0.2
0.25
0.05
0.15
0.25
0.4
0.1
0.15
0.5894
1.2173
0.9621
0.6636
0.7660
0.7623
0.7059
0.7625
0.3479
0.6883
0.9835
1.1847
0.4665
0.5944
0
0.4673
0.0028
0.6290
0.2657
0.2057
0.1885
0
0.4825
1.3181
0
0.0532
0.3173
0.2195
0.0492
0.0489
0.8135
0.2292
0
1.4086
6.699
2.75
1
2
25
0.1
15.722
100
2
0.3
0.8
91
200
500
10
10
Table 7: Continued.
TMS
0.3092
0.3092
0.3467
0.2095
0.7561
0.5671
0.248
0.7271
0.5679
0.6679
0.67
0.423
0.621
0.9412
0.9268
0.2343
0.5493
0.5749
0.3947
0.5669
0.2716
0.5094
0.5468
0.7716
0.7482
0.6391
0.6033
0.6351
0.6351
0.6358
0.4274
0.5374
0.252
0.2694
0.3322
0.8262
0.4902
0.1732
0.1731
0.1627
0.6102
0.2748
0.656
0.2103
0.2249
0.397
0.1756
0.5501
0.117
0.117
0.119
0.068
0.102
0.227
0.091
0.189
0.107
0.245
0.241
0.160
0.195
0.25
0.170
0.074
0.139
0.190
0.105
0.163
0.059
0.090
0.139
0.142
0.217
0.239
0.203
0.184
0.184
0.183
0.088
0.118
0.090
0.089
0.084
0.174
0.106
0.05
0.061
0.068
0.123
0.115
0.25
0.076
0.084
0.081
0.056
0.179
Relay number
49
50
51
52
53
54
55
56
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
80
81
82
83
84
85
86
0.7792
0.1803
0.654
0.6578
0.6173
0.5556
1.0366
0.5839
0.6095
0.2618
0.4635
0.2769
0.3095
0.3954
0.5534
0.3576
0.5278
0.5855
0.7435
0.5109
0.6543
0.2269
0.477
0.2072
0.6521
0.3362
0.5226
0.2853
0.4494
0.4341
0.3934
0.8588
0.9303
0.5091
0.3488
0.3566
TMS
0.155
0.061
0.211
0.166
0.129
0.093
0.224
0.143
0.176
0.065
0.129
0.056
0.061
0.066
0.128
0.094
0.099
0.099
0.161
0.095
0.113
0.078
0.143
0.070
0.204
0.104
0.115
0.073
0.116
0.137
0.111
0.154
0.202
0.077
0.144
0.079
4,1
6,1
7,1
45,1
4,2
6,2
7,2
44,2
5,3
8,4
16,4
48,4
8,5
16,5
47,5
9,6
10,7
11,7
12,7
13,7
43,7
51,7
10,8
11,8
12,8
13,8
43,8
50,8
53,9
52,10
42,11
14,12
15,12
26,13
27,13
28,13
29,13
30,13
58,13
26,15
27,15
28,15
29,15
30,15
56,15
17,16
0.3529
0
0.3146
0.3418
0.3529
0
0.3146
0.3565
0
0
0.56
0.1792
0
0.5385
0.5848
0.6558
0.015
0
0.2883
0.0488
0.0184
0.0165
0.0076
0
0.2671
0.0494
0.0161
0.5093
0
0.0881
0.3288
0.0006
0
0.005
0.027
0.0001
0.0001
0
0.0262
0
0
0
0
0
0
0.0001
18,16
19,16
20,16
21,18
23,19
32,19
64,19
22,20
23,21
32,21
62,21
70,22
24,23
25,24
69,25
68,26
65,27
31,28
72,28
31,29
71,29
33,30
74,30
33,31
73,31
34,32
35,33
77,33
35,34
76,34
36,35
37,35
39,37
40,37
81,37
39,38
40,38
80,38
41,39
84,40
83,41
38,42
86,42
38,43
85,43
2,44
0.0021
0.1591
0
1.0402
0
0.0027
0
0.5459
0.0023
0
0.2384
0
0.3009
0
0
0.4949
0.2957
0
0
0
0
0
0
0
0.0514
0.6332
0
0.0416
0.2067
0
0
0.2988
0.2264
0.2523
0
0.3152
0.3684
0.0055
0
0
0
0.1969
0
0.5089
0.3278
0.0333
3,44
1,45
3,45
1,46
2,46
6,47
7,47
44,47
45,47
46,48
4,49
7,49
44,49
45,49
4,50
6,50
44,50
45,50
16,51
47,51
48,51
49,52
11,53
12,53
13,53
43,53
50,53
51,53
10,54
12,54
13,54
43,54
50,54
51,54
10,55
11,55
13,55
43,55
50,55
51,55
10,56
11,56
12,56
43,56
50,56
51,56
0
0.0337
0
0
0
0
0.3238
0.3147
0.3
0
0
0
0
0
0.3518
0
0.3118
0.2971
0.3311
0.3843
0
0
0
0.2759
0.0489
0.0171
0.5228
0.0163
0
0
0
0
0
0
0
0
0
0
0
0
0.0082
0
0.2863
0.0169
0.5088
0.0146
15,57
55,57
14,58
55,58
8,59
47,59
48,59
18,60
19,60
20,60
59,60
17,61
19,61
20,61
59,61
17,62
18,62
20,62
59,62
17,63
18,63
19,63
59,63
61,64
63,65
32,66
62,66
64,66
66,67
67,68
27,69
28,69
29,69
30,69
56,69
58,69
26,70
28,70
29,70
30,70
56,70
58,70
26,71
27,71
29,71
30,71
0
0
0.1002
0
0
0.5927
0.1788
0
0.1665
0.0008
0.3069
0
0
0
0
0
0.0312
0.0022
0.3093
0
0.0059
0.1605
0.3125
0
0
0.0072
0.2319
0
0
0
0.0239
0
0
0.0006
0.0331
0.0202
0.0155
0
0
0.0003
0.0368
0.0215
0
0.0031
0.0142
0.006
56,71
58,71
26,72
27,72
28,72
30,72
56,72
58,72
26,73
27,73
28,73
29,73
56,73
58,73
71,74
72,74
23,75
62,75
64,75
73,76
74,76
75,77
76,78
77,78
37,79
78,79
36,80
78,80
85,81
86,81
40,82
80,82
81,82
39,83
80,83
81,83
82,84
54,85
10,86
11,86
12,86
13,86
50,86
51,86
0.0122
0.0025
0
0
0
0
0
0
0.0003
0
0
0
0.0081
0
0.2501
0
0.0048
0.2319
0
0.4701
0
0
0
0
0
0.2437
0
0.3633
0
0
0
0
0
0
0
0
0
0
0
0.0116
0.2807
0.0363
0.5105
0
TMS
Case 1
=1
1 = 1
2 = 100
=2
N=2
29.8211
15.15
Case 2
= 10
1 = 10
2 = 1
=2
N=2
24.115
14.55
Case 3
= 10
1 = 1
2 = 10
=2
N=2
26.9
15.6
Case 4
= 585.5
1 = 15
2 = 5
= 12.5
N=6
22.19
11.32
7. Conclusion
In this paper, a new flexible technique for overcurrent relays
coordination has been proposed. In this new technique, the
coefficients of the conventional objective functions have been
improved by optimization problem to obtain the minimum
values for the TMSs of the relays. In the proposed technique, GAPSOA optimization method is used to solve the
optimization problem. This proposed method is tested on 6bus case study and 30-bus IEEE case study. The results of
the simulation show the flexibility of the technique and the
best reliability because of the smallest TMS and mb
compared to the conventional coordination methods.
Conflict of Interests
The authors declare that there is no conflict of interests
regarding the publication of this paper.
References
[1] R. Mohammadi, H. A. Abyaneh, F. Razavi, M. Al-Dabbagh,
and S. H. H. Sadeghi, Optimal relays coordination efficient
method in interconnected power systems, Journal of Electrical
Engineering, vol. 61, no. 2, pp. 7583, 2010.
[2] K. Mazlumi and H. A. Abyaneh, Relay coordination and protection failure effects on reliability indices in an interconnected
sub-transmission system, Electric Power Systems Research, vol.
79, no. 7, pp. 10111017, 2009.
[3] D. Birla, R. P. Maheshwari, and H. O. Gupta, Time overcurrent
relay coordination: a review, International Journal of Emerging
Electric Power Systems, vol. 2, no. 2, 2005.
[4] M. Ojaghi, Z. Sudi, and J. Faiz, Implementation of full adaptive
technique to optimal coordination of overcurrent relays, IEEE
Transactions on Power Delivery , vol. 28, no. 1, pp. 235244, 2013.
[5] C. W. So and K. K. Li, Overcurrent relay coordination by
evolutionary programming, Electric Power Systems Research,
vol. 53, no. 2, pp. 8390, 2000.
[6] C. W. So, K. K. Li, K. T. Lai, and K. Y. Fung, Application of genetic algorithm for overcurrent relay coordination, in Proceedings of the 6th International Conference on Developments in
Power System Protection, pp. 6669, 1997.
[7] C. W. So and K. K. Li, Time coordination method for power
system protection by evolutionary algorithm, IEEE Transactions on Industry Applications, vol. 36, no. 5, pp. 12351240,
2000.
[8] J. A. Sueiro, E. Diaz-Dorado, E. Miguez, and J. Cidras, Coordination of directional overcurrent relay using evolutionary algorithm and linear programming, International Journal of Electrical Power & Energy Systems, vol. 42, no. 1, pp. 299305, 2012.
[9] M. Ezzeddine and R. Kaczmarek, A novel method for optimal
coordination of directional overcurrent relays considering their
available discrete settings and several operation characteristics,
Electric Power Systems Research, vol. 81, no. 7, pp. 14751481,
2011.
[10] P. P. Bedekar and S. R. Bhide, Optimum coordination of
overcurrent relay timing using continuous genetic algorithm,
Expert Systems with Applications, vol. 38, no. 9, pp. 1128611292,
2011.
[11] F. Razavi, H. A. Abyaneh, M. Al-Dabbagh, R. Mohammadi,
and H. Torkaman, A new comprehensive genetic algorithm
method for optimal overcurrent relays coordination, Electric
Power Systems Research, vol. 78, no. 4, pp. 713720, 2008.
[12] D. E. Goldberg, Genetic Algorithms in Search Optimization and
Machine Learning, Addison-Wesley, Reading, Mass, USA, 1989.
[13] D. Adler, Genetic algorithms and simulated annealing: a marrage proposal, in Proceedings of the IEEE International Conference on Neural Networks, vol. 2, pp. 11041109, 1993.
[14] K. Premalatha and A. M. Natarajan, Hybrid PSO and GA for
global maximization, International Journal of Open Problems in
Computer Science and Mathematics, vol. 2, no. 4, 2009.
[15] H.-J. Lee, G. Son, and J.-W. Park, Study on wind-turbine generator system sizing considering voltage regulation and overcurrent relay coordination, IEEE Transactions on Power Systems, vol. 26, no. 3, pp. 12831293, 2011.
10
[16] T. Amraee, Coordination of directional overcurrent relays
using seeker algorithm, IEEE Transactions on Power Delivery,
vol. 27, no. 3, pp. 14151422, 2012.
[17] P. P. Bedekar and S. R. Bhide, Optimum coordination of directional overcurrent relays using the hybrid GA-NLP approach,
IEEE Transactions on Power Delivery, vol. 26, no. 1, pp. 109119,
2011.
[18] R. M. Chabanloo, H. A. Abyaneh, S. S. H. Kamangar, and F.
Razavi, Optimal combined overcurrent and distance relays
coordination incorporating intelligent overcurrent relays characteristic selection, IEEE Transactions on Power Delivery, vol.
26, no. 3, pp. 13811391, 2011.
[19] H. Sharifian, H. A. Abyaneh, S. K. Salman, R. Mohammadi,
and F. Razavi, Determination of the minimum break point set
using expert system and genetic algorithm, IEEE Transactions
on Power Delivery, vol. 25, no. 3, pp. 12841295, 2010.
[20] Power system test cases, 1999, http://www.ee.washington.edu/
research/pstca/pf30/ieee30cdf.txt.
[21] P. G. Slade, J.-L. Wu, E. J. Stacey et al., The utility requirements
for a distribution fault current limiter, IEEE Transactions on
Power Delivery, vol. 7, no. 2, pp. 507515, 1992.
[22] J. R. S. S. Kumara, A. Atputharajah, J. B. Ekanayake, and F.
J. Mumford, Over current protection coordination of distribution networks with fault current limiters, in Proceedings of
the IEEE Power Engineering Society General Meeting (PES 06),
Montreal, Canada, 2006.
International Journal of
Rotating
Machinery
Engineering
Journal of
Volume 2014
The Scientific
World Journal
Hindawi Publishing Corporation
http://www.hindawi.com
Volume 2014
International Journal of
Distributed
Sensor Networks
Journal of
Sensors
Hindawi Publishing Corporation
http://www.hindawi.com
Volume 2014
Volume 2014
Volume 2014
Journal of
Control Science
and Engineering
Advances in
Civil Engineering
Hindawi Publishing Corporation
http://www.hindawi.com
Volume 2014
Volume 2014
Journal of
Robotics
Hindawi Publishing Corporation
http://www.hindawi.com
Volume 2014
Volume 2014
VLSI Design
Advances in
OptoElectronics
International Journal of
Navigation and
Observation
Hindawi Publishing Corporation
http://www.hindawi.com
Volume 2014
Chemical Engineering
Hindawi Publishing Corporation
http://www.hindawi.com
Volume 2014
Volume 2014
Antennas and
Propagation
Hindawi Publishing Corporation
http://www.hindawi.com
Aerospace
Engineering
Volume 2014
Volume 2014
Volume 2014
International Journal of
International Journal of
International Journal of
Modelling &
Simulation
in Engineering
Volume 2014
Volume 2014
Volume 2014
Advances in
Volume 2014