Professional Documents
Culture Documents
discussions, stats, and author profiles for this publication at: https://www.researchgate.net/publication/3275457
CITATIONS
READS
64
174
3 AUTHORS:
Dinesh Birla
R.P. Maheshwari
SEE PROFILE
SEE PROFILE
Hari Om Gupta
Jaypee Institute of Information Technology
176 PUBLICATIONS 1,331 CITATIONS
SEE PROFILE
1176
I. INTRODUCTION
setting
and time dial setting (TDS) for each DOCR of the
system.
Presently, the DOCR coordination process is usually
performed using optimization techniques. In optimization
techniques, an objective function is minimized subject to some
coordination constraints. The conventional objective function
and constraints for DOCR coordination problem are defined in
Sections II and III respectively.
Thorough coordination studies of sample 6-bus system given
in Fig. 1, the IEEE 14-bus system and IEEE 30-bus system are
carried out. It is observed by the analysis that all remaining valid
constraints after relaxing few constraints (criteria for relaxation
described in Section IV) are not satisfied in the optimization
process with conventional objective function. It is also observed
that if the objective function is changed to running sum of all violating constraints, all valid considered constraints are satisfied.
The problem of infeasibility of constraints does not arise with
this approach. In this regard, results of the study on sample 6-bus
and IEEE 30-bus systems only are presented in the paper.
This paper also investigates the quality of coordination
achieved by performing DOCR coordination based on faults
simulated at near ends only as compared to the faults on both
ends, i.e., near-ends as well as far-ends. The results of IEEE-30
bus and sample 6-bus systems on this aspect are presented in
Section IV. Near-end faults based optimization approach is
described in Section II.
In the work presented here, DOCR coordination process is
performed by simultaneously optimizing settings involving all
complexities of the coordination problem. Solution of the nonlinear function, thus formed, is obtained by using the sequential
quadratic programming technique (SQP). For this purpose, the
1177
Fig. 2.
followed this philosophy of near-end faults based DOCR coordination process [4].
Near-end faults based optimization approach is briefly described below.
Assuming a network of relays, the near-end objective function
to be minimized can be expressed as
(B)
where
and
are the operating times of primary relay
and backup relay
, respectively, for the near-end
.
fault of relay
The selectivity constraints here are considered based only on
the near-end faults. For the near-end fault shown in Fig. 2, one
selectivity constraint exists and it is as
(C)
As usual, limits on relay settings (TDS and ) and bounds on
the operation times of primary relays are the other coordination
constraints.
The considerations of the weight factors and far-end faults in
the problem formulation do not have any effect on the optimal
solution of coordination [18]. The present paper investigates this
viewpoint of near-end faults based approach and finds that this
concept is a realistic and tenable argument for proper simplification of the DOCR coordination problem. The study reported in
this paper also verifies that this simplification of the problem
yields better objective function optimal value. However, it is
found that such simplification of the problem impairs the coordination quality of the system marginally because some of the
constraints based on far-end faults are not satisfied by solution
obtained from near-end faults based approach. This is demonstrated in this paper by results of the study carried on a sample
6-bus and IEEE 30-bus systems.
[2] considered transient configurations arising due to dynamic changes in the network topology of a system. [4] has
reported an adaptive coordination scheme based on near-end
faults and it is claimed that their problem dimensionality was
reduced to a quarter as compared to [2]. Furthermore, consideration of parallel lines case and coordination of directional
overcurrent relays with second-zone distance relays and breaker
failure relays shall aid additional constraints [19][21]. These
additional constraints are not taken into account here. Inclusion
of these additional constraints and solving the problem based on
only near-end faults will be computationally efficient to some
extent. But, some of the far-end fault constraints corresponding
to these additional constraints will be violated.
1178
(1)
(2)
(3)
(4)
where
number of equality constraints;
number of inequality constraints;
number of variables;
variable of the problem;
lower limit of the variable ;
upper limit of the variable .
SQP approximates the objective function to quadratic
form and constraints in linear form successively. All problem
functions are assumed to be continuously differentiable. The
(5)
Subject to
(6)
(7)
(8)
is the gradient of
at
.
where
The matrix
is a positive definite approximation to the Hessian of the Lagrangian function. is the search direction (change
in variable during iteration). Once has been computed, the
major iteration proceeds by determining a step length that produces a sufficient decrease in an augmented Lagrangian merit
function. If an optimal point is not reached, Hessian matrix
is updated to incorporate the information obtained from current
iterate. It must be emphasized that the nonlinear constraints will
not generally be satisfied until an optimal point is reached.
that
The major iterations generate a sequence of iterates
converge to , a first-order Kuhn-Tucker point of the optimization problem of (1). At a typical major iteration, the new iterate
is defined by
(9)
where
current iterate;
step length (a nonnegative scalar);
search direction (change in variable during iteration)
Forming the Lagrangian function using (1)(3), we have
(10)
Applying first-order Kuhn-Tucker conditions for the optimality of the Lagrangian in (10), we have the following:
;
1)
;
2)
;
3)
and
.
4)
The first condition says that partial derivatives of the Lagrangian function must be zero at the optimal solution point. The
second and third conditions are simply equality and inequality
constraints. The fourth condition is called a complementary
slackness condition and provides a mathematical way to handle
the problem of constraints.
In summary, the SQP optimization routine in Matlab Toolbox
first determines a point that satisfies the first-order Kuhn-Tucker
conditions and thereafter, each iteration includes the following.
a) The solution of a quadratic programming subproblem.
b) A line search with an augmented Lagrangian merit
function.
c) Updating of approximate Hessian of the Lagrangian
function.
IV. RESULTS
A. IEEE 30-Bus System
Four-hundred selectivity constraints are generated for the
faults simulated at near-ends and far-ends for IEEE 30-bus
system, if parallel lines are replaced by equivalent single line.
319 constraints are expected to be valid constraints in this study
after relaxing 81 constraints based on the following criteria.
1) The majority of selectivity constraints are relaxed when
the DOCR fault currents fall below their pick-up current.
The corresponding coordination constraint is not included
in the optimization routine [Discussion, 20].
2) Few constraints are relaxed when directions of fault currents for associated relays in a selectivity constraint are
opposite to each other, those constraints are also relaxed
[28].
Out of the 319 remaining valid constraints, 167 constraints
belong to near-end faults and 152 constraints belong to far-end
faults.
The problem has been solved by three approaches.
i) Approach I: based on only near-end faults with objective
function
ii) Approach II: based on both, near-end as well as far-end
faults with conventional objective function
.
iii) Approach III: based on both near-end as well as far-end
faults with objective function as running sum of violations
of all violating constraints
Tables I and III present the values of the selectivity constraints, i. e. Backup Relay TimePrimary Relay TimeCTI
in seconds. The negative value indicates violation of the selectivity constraint. Coordination time interval (CTI) is taken as
0.2 s.
Out of 319 valid constraints, 12 are not satisfied with approach I as shown in Table I. Four constraints out of these 12
remain unsatisfied with approach II. These correspond to constraint numbers 9 to 12 in Table I, whereas these 12 constraints
are satisfied using proposed approach III as shown in Table I.
This avoids undesired operations of relays (may be sympathy
trips also) involving these constraints. Thus, proposed approach
III satisfies all valid 319 constraints. Of course, the value of the
objective function increases to 116.5894 as compared to the approach I optimal point 102.3916, and approach II optimal point
103.8503 as shown in Table II. It is expected as quality of coordination is improved. But, still primary relay operating times
do not violate the acceptable limits to clear the corresponding
faults.
Significant reductions in time delays for back-up relays for
few constraints corresponding to far-end faults are obtained
when approach II and approach III solve the problem. This
is shown in Table III. These reductions bring back-up relays in more favorable positions to provide effective back-up
protection.
B. The 6-Bus System (Fig. 1)
There are 48 selectivity constraints generated for the faults
simulated at near-ends and far-ends for sample 6-bus system.
1179
TABLE I
CONSTRAINTS FOR IEEE 30-BUS SYSTEM WHICH ARE NOT SATISFIED
BY APPROACH I BUT SATISFIED WITH APPROACHES II AND III AND
CONSTRAINTS WHICH ARE NOT SATISFIED BY APPROACHES I AND II
BUT SATISFIED BY APPROACH III
TABLE II
COMPARISON OF OPTIMAL VALUES OF OBJECTIVE FUNCTION OBTAINED
BY ALL THREE APPROACHES FOR IEEE 30-BUS SYSTEM
TABLE III
CONSTRAINTS FOR IEEE 30-BUS SYSTEM WHICH ARE SIGNIFICANTLY
IMPROVED BY APPROACH II AND III AS COMPARED TO APPROACH I
TABLE IV
COMPARISON OF OPTIMAL VALUES OF OBJECTIVE FUNCTION OBTAINED
BY ALL THREE APPROACHES FOR SAMPLE 6-BUS SYSTEM (FIG. 1)
1180
TABLE V
COMPARISON OFTDS AND I VALUES FOR SAMPLE 6-BUS SYSTEM (FIG. 1) BY ALL THREE APPROACHES
TABLE VI
COMPARISON OF RESPECTIVE TIMES TAKEN BY ALL THREE APPROACHES FOR 6-BUS SYSTEM (FIG. 1) AND IEEE 30-BUS SYSTEM
TDS and values obtained for all three approaches are given
in Table V. Comparison of time taken by all three approaches for
6-bus and IEEE 30-bus systems is given in Table VI.
TDS is taken in the range of (0.051.1). For phase relays the
pick-up setting is determined by allowing a margin for overload
above the nominal current as under [32]
overload factor
nominal current
V. CONCLUSION
This paper concludes that solving the DOCR coordination
problem based on only near-end faults does not loose objective function optimal value but sacrifices quality of coordination
mildly. It is because some of the constraints based on far-end
faults are not satisfied by this approach. When the problem is
solved based on near-end as well as far-end faults these constraints are satisfied. In making this observation authors also feel
that for small systems approach based on near-end faults is acceptable both in terms of objective function optimal value and
coordination quality. However, for large interconnected systems
in a given situation one does not know which pair may be a critical pair. So, the approach based on near-end and far-end faults is
a better approach. Even with this approach all valid constraints
are not satisfied.
When the problem is solved by changing the objective function to running sum of violations of all valid constraints, it satisfies all considered valid constraints. This will have marked
effect on improvement of coordination quality for large interconnected systems. It will increase security and dependability
of protection systems. It has been observed in this investigation
that even for IEEE 30-bus system this technique has reduced the
threat of sympathy trips to minimum.
APPENDIX
Data for 6-bus sample system [35] given in Fig. 1
Bus code: 1 slack bus, 0 load bus, 2 generator bus.
TABLE VII
BUS DATA ARRAY AND LINE DATA OR NETWORK TOPOLOGY ARRAY
Base
Table VII.
REFERENCES
[1] C. R. Mason, The Art and Science of Protective Relaying. New Delhi,
India: Wiley Eastern Limited, 1987.
[2] A. J. Urdaneta, L. G. Perez, and H. Restrepo, Optimal coordination of
directional overcurrent relays considering dynamic changes in the network topology, IEEE Trans. Power Del., vol. 12, no. 5, pp. 14581463,
Oct. 1997.
[3] H. A. Abyaneh, M. Al-Dabbagh, H. K. Karegar, S. H. H. Sadeghi, and
R. A. H. Khan, A new optimal approach for coordination of overcurrent
relays in interconnected power systems, IEEE Trans. Power Del., vol.
18, no. 2, pp. 430435, Apr. 2003.
[4] A. Y. Abdelaziz, H. E. A. Talaat, A. I. Nosseir, and A. A. Hajjar, An
adaptive protection scheme for optimal coordination of overcurrent relays, Electr. Power Syst. Res., vol. 61, pp. 19, 2002.
[5] R. E. Albrecht, W. E. Nisja, Feero, G. D. Rockefeller, and C. L. Wagner,
Digital computer protective device coordination programIGeneral
program description, IEEE Trans. Power App. Syst., vol. PAS-83, no.
4, pp. 402410, Apr. 1964.
[6] S. E. Zocholl, J. K. Akamine, A. E. Hughes, M. S. Sachdev, L. Scharf,
and H. S. Smith, Computer representation of overcurrent relay characteristics, IEEE Trans. Power Del., vol. 4, no. 3, pp. 16591667, Jul.
1989.
[7] M. J. Damborg, R. Ramaswami, S. S. Venkata, and J. M. Postforoosh,
Computer aided transmission protection system design, part-IAlgorithms, IEEE Trans. Power App. Syst., vol. PAS-103, no. 1, pp. 5159,
Jan. 1984.
, Computer aided transmission protective system design, part
[8]
IIImplementation and results, IEEE Trans. Power App. Syst., vol.
PAS-103, no. 1, pp. 6065, Jan. 1984.
[9] R. Ramaswami, M. J. Damborg, S. S. Venkata, A. K. Jampala, and J.
Postforoosh, Enhanced algorithms for transmission protective relay coordination, IEEE Trans. Power Del., vol. PWRD-1, no. 1, pp. 280287,
Jan. 1986.
[10] B. Rao and S. Rao, Computer aided coordination of directional relay:
Determination of break points, IEEE Trans. Power Del., vol. 3, no. 2,
pp. 545548, Apr. 1988.
[11] A. H. Knable, Electrical Power Systems EngineeringProblems and
Solutions. New York: McGraw Hill, 1967.
[12] K. A. Brown and J. M. Parker, A personal computer approach to overcurrent protective device coordination, IEEE Trans. Power Del., vol. 3,
no. 2, pp. 509513, Apr. 1988.
1181
1182