A simple and efficient approach to determination of minimum set of break point relays for transmission protection system coordination

Rajeev Kumar Gajbhiye*, Anindya De, Rupesh Helwade, S. A. Soman

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Scopus citations

Abstract

Coordination of relays in a meshed system is an iterative process. It involves finding a set of break point relays. In this paper, we propose a new polynomial time approximation algorithm for computation of the minimum break point relay set. In turn, procedure for computation of minimum break point relays requires systematic enumeration of all possible simple loops in the system. Therefore, we also propose a simple method for enumerating all possible loops. The advantages of proposed approach are (1) simplicity and (2) reduced computational complexity. Case studies on various topologies demonstrate the utility of the proposed approach.

Original languageEnglish (US)
Title of host publication2005 International Conference on Future Power Systems
PublisherIEEE Computer Society
ISBN (Print)9078205024, 9789078205029
DOIs
StatePublished - 2005
Event2005 International Conference on Future Power Systems - Amsterdam, Netherlands
Duration: Nov 16 2005Nov 18 2005

Publication series

Name2005 International Conference on Future Power Systems
Volume2005

Other

Other2005 International Conference on Future Power Systems
CountryNetherlands
CityAmsterdam
Period11/16/0511/18/05

Keywords

  • Coordination of distance relays
  • Greedy algorithms
  • Minimal break point set
  • NP-complete

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint Dive into the research topics of 'A simple and efficient approach to determination of minimum set of break point relays for transmission protection system coordination'. Together they form a unique fingerprint.

Cite this