DocumentCode
1532496
Title
Determination of the Minimum Breakpoint Set of Directional Relay Networks Based on k-Trees of the Network Graphs
Author
Vinnakota, Bapeswara-Rao V. ; Ababei, Cristinel
Author_Institution
Dept. of Electr. & Comput. Eng., North Dakota State Univ., Fargo, ND, USA
Volume
26
Issue
4
fYear
2011
Firstpage
2318
Lastpage
2323
Abstract
We propose a new graph theory-based algorithm for the determination of the minimum breakpoint set of meshed systems. We show that if there is a k-tree in the graph G(V,E) associated with the system, then the minimum breakpoint set has a cardinality of |E|-|V|+k. The proposed algorithm implements an iterative procedure to identify such a k-tree and having minimum k. It is found that the cardinality of the minimum breakpoint set is 9 for the IEEE 14-bus system and 16 for the IEEE 30-bus system. These minimum values are smaller than the previously best reported results of 10 and 18 for the same systems.
Keywords
iterative methods; relay protection; trees (mathematics); IEEE 14-bus system; IEEE 30-bus system; directional relay networks; graph theory; iterative procedure; k-trees; meshed systems; minimum breakpoint set; network graphs; Algorithm design and analysis; Graph theory; Relays; Runtime; Breakpoints; directional relays; k-trees; minimum number of breakpoints;
fLanguage
English
Journal_Title
Power Delivery, IEEE Transactions on
Publisher
ieee
ISSN
0885-8977
Type
jour
DOI
10.1109/TPWRD.2011.2150249
Filename
5783494
Link To Document