Determination of minimum break point set for protection co-ordination using a functional dependency concept

Elrefaie, H.B.; Irving, M.R.

doi:10.1016/0142-0615(93)90005-8

Cited by 6 publications

(9 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A method is proposed in [32] based upon a functional dependency approach. The cardinality of the MBPS is also discussed in this reference.…”

Section: Methods For Determining a Minimum Breakpoint Setmentioning

confidence: 99%

“…According to [32,33], the cardinality of the MBPS is |MBPS| = e − v + 2. Let r k denote relay k. For the 5-bus, 9-line system shown in Figure 2, the method detailed in [32] determines that the MBPS is A = {r 2 , r 3 , r 8 , r 9 , r 14 , r 16 }. However, for this small system, an alternative breakpoint set can be found by visual inspection.…”

Section: Methods For Determining a Minimum Breakpoint Setmentioning

confidence: 99%

See 1 more Smart Citation

A Graph Theory Method for Identification of a Minimum Breakpoint Set for Directional Relay Coordination

2019

View full text Add to dashboard Cite

The energy grid becomes more complex with increasing penetration of renewable resources, distributed energy storage, distributed generators, and more diverse loads such as electric vehicle charging stations. The presence of distributed energy resources (DERs) requires directional protection due to the added potential for energy to flow in both directions down the line. Additionally, contingency requirements for critical loads within a microgrid may result in looped or meshed systems. Computation speeds of iterative methods required to coordinate loops are improved by starting with a minimum breakpoint set (MBPS) of relays. A breakpoint set (BPS) is a set of breakers such that, when opened, breaks all loops in a mesh grid creating a radial system. A MBPS is a BPS that consists of the minimum possible number of relays required to accomplish this goal. In this paper, a method is proposed in which a minimum spanning tree is computed to indirectly break all loops in the system, and a set difference is used to identify the MBPS. The proposed method is found to minimize the cardinality of the BPS to achieve a MBPS.

show abstract

“…A method is proposed in [32] based upon a functional dependency approach. The cardinality of the MBPS is also discussed in this reference.…”

Section: Methods For Determining a Minimum Breakpoint Setmentioning

confidence: 99%

Section: Methods For Determining a Minimum Breakpoint Setmentioning

confidence: 99%

A Graph Theory Method for Identification of a Minimum Breakpoint Set for Directional Relay Coordination

2019

View full text Add to dashboard Cite

show abstract

“…The sequence for setting the relays is displayed by a relative sequence matrix (RSM) [2]. As in [9][10][11], the proposed approaches by the authors are based on functional dependency that applies heuristic method for selecting BPS. The set of all primary and back up relays are sorted out by the back up relays is the set of sequential pairs (SSPs) [2][3][4].…”

Section: Introductionmentioning

confidence: 99%

“…The methodology developed by the authors in [8] does not require the generation of all the directed loops. As in [9][10][11], the proposed approaches by the authors are based on functional dependency that applies heuristic method for selecting BPS. In [12], the authors propose an improve algorithm using the concept of partitioning graphs into forest.…”

Section: Introductionmentioning

confidence: 99%

Determination of minimum break point set using particle swarm optimization for system‐wide protective relay setting and coordination

Moirangthem

Dash

Ramaswami

2011

Int Trans Elec Energy Syst

View full text Add to dashboard Cite

SUMMARY This paper proposes an effective approach based on particle swarm optimization to identify the break point set. Determining the directional loops and the optimal break point set in the multiloop is the first step during setting and coordination of directional relays in system protection. Arbitrary starting relay locations and arbitrary consideration of relay sequence to set and coordinate relays will result in navigating loops many times and usually result in futile attempts to achieve system‐wide relay coordination. First, the network is reduced if there are any parallel lines or three end nodes. Second, all the directed loops are enumerated to enhance the algorithm. In this paper, the problem is formulated as a set covering problem, and break point set is determined using particle swarm optimization technique. Effectiveness of the proposed algorithm is implemented in different test system, and the results are compared with the existing methods. Copyright © 2011 John Wiley & Sons, Ltd.

show abstract

“…In [8], the methodology developed does not require the generation of all the directed loops. As in [9][10][11], the proposed approaches are based on functional dependency, which applies heuristic method for selecting BPS. As in [12], an improved algorithm has been applied by partitioning graphs into forests.…”

Section: Introductionmentioning

confidence: 99%

Zero-one Integer Programming Approach to Determine the Minimum Break Point Set in Multi-loop and Parallel Networks

Moirangthem¹,

Dash²,

Ramaswami³

2012

Journal of Electrical Engineering and Technology

View full text Add to dashboard Cite

-The current study presents a zero-one integer programming approach to determine the minimum break point set for the coordination of directional relays. First, the network is reduced if there are any parallel lines or three-end nodes. Second, all the directed loops are enumerated to reduce the iteration. Finally, the problem is formulated as a set-covering problem, and the break point set is determined using the zero-one integer programming technique. Arbitrary starting relay locations and the arbitrary consideration of relay sequence to set and coordinate relays result in navigating the loops many times and futile attempts to achieve system-wide relay coordination. These algorithms are compared with the existing methods, and the results are presented. The problem is formulated as a setcovering problem solved by the zero-one integer programming approach using LINGO 12, an optimization modeling software.

show abstract

Determination of minimum break point set for protection co-ordination using a functional dependency concept

Cited by 6 publications

References 4 publications

A Graph Theory Method for Identification of a Minimum Breakpoint Set for Directional Relay Coordination

A Graph Theory Method for Identification of a Minimum Breakpoint Set for Directional Relay Coordination

Determination of minimum break point set using particle swarm optimization for system‐wide protective relay setting and coordination

Zero-one Integer Programming Approach to Determine the Minimum Break Point Set in Multi-loop and Parallel Networks

Contact Info

Product

Resources

About