By Topic

Optimal-Probabilistic Method to Compute the Reach Settings of Distance Relays

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Sorrentino, E. ; Univ. Simon Bolivar, Caracas, Venezuela ; De Andrade, V.

This paper presents a novel method to optimize the settings of the resistive and reactive reaches of the zones of the distance relays. The method considers the probabilistic behavior of the variables that affect the apparent impedance seen by relays: prefault load flow, fault type, faulted line, distance up to the fault, fault resistance, and measurement errors. The optimization has been conceptually formulated as a multiobjective problem, with two objective functions: 1) minimize the probability of loss of sensitivity and 2) minimize the probability of loss of selectivity. To solve this problem, a preference function is defined, which is equal to the weighted sum of the two objective functions. A factor of weight represents the relative importance of selectivity regarding the sensitivity, and it is selected for each zone. This method was applied to a system with 7 busbars (3 of them with generation), where there are 18 distance relays with quadrilateral characteristic, and with an independent setting of the reactive and resistive reaches for the phase distance function and the ground distance function. The results obtained are compared with the results of other methods of adjustment.

Published in:

Power Delivery, IEEE Transactions on  (Volume:26 ,  Issue: 3 )