Minimum Breakpoint Set Determination for Directional Overcurrent Relay Coordination in Large-Scale Power Networks via Matrix Computations

Liu, Lufeng; Fu, Lijun

doi:10.1109/tpwrd.2016.2583222

Cited by 16 publications

(19 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…These methods will be compared to the proposed approach later in the paper. In [22] lower-upper (LU) factorization of a rectangular bus-branch adjacency matrix…”

Section: Methods For Determining a Minimum Breakpoint Setmentioning

confidence: 99%

“…However, LU factorization involves row reduction, which can be computationally expensive for larger systems [23,24]. Additionally, as will be shown later, the solutions found in [22] are not necessarily the minimal breakpoint sets. According to [15], the computation time for coordination increases with the size of the breakpoint set (BPS).…”

Section: Methods For Determining a Minimum Breakpoint Setmentioning

confidence: 99%

“…As discussed in [22], algorithms for determining a MBPS are of three types: (1) Algorithms based on graph theory, (2) algorithms based on coordination of relays, or (3) algorithms based on optimization [22]. In this paper, a graph theory method is utilized as an intermediate step towards optimal relay coordination.…”

Section: Of 17mentioning

confidence: 99%

See 2 more Smart Citations

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

“…These methods will be compared to the proposed approach later in the paper. In [22] lower-upper (LU) factorization of a rectangular bus-branch adjacency matrix…”

Section: Methods For Determining a Minimum Breakpoint Setmentioning

confidence: 99%

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

show abstract

“…ii) Apply network graph theory For rest of the network, the Minimum break point set relays can be determined from LU factorization of reduced and permuted incidence matrix. L-matix indicates minimum break point sets [30]- [35]. Table 12, shows the minimum break point set obtained for the test systems.…”

Section: Methodsmentioning

confidence: 99%

“…There can be multiple choices to minimum break point relays. In this subsection we will concentrate on computation of minimum break point set of relays based on critical element finding and network graph theory [26]- [30].…”

Section: A Minimization Of the Number Of Relaysmentioning

confidence: 99%

Intelligent Coordination of Overcurrent and Distance Relays using Meta Heuristic Algorithms

Roy¹,

PERLI²,

Babu³

2018

IJEEI

View full text Add to dashboard Cite

Relay coordination is very important from the point of view of security and healthy operation of power system. Relays should be organized in such a way that every relay should have at least one back up relay and coordination time interval between primary and secondary relays should be maintained. This paper presents the solution of relay coordination problem using Teaching learning based optimization technique (TLBO) by utilizing an IEEE 5 bus and IEEE 30 bus test system. The obtained results are compared with the results obtained from other contemporary meta-heuristic techniques like Genetic Algorithm (GA) and Particle Swarm Optimization technique (PSO). It is observed that TLBO is the best among those with respect to process speed. After this we have done an extension of the work by introducing critical element and network graph theory based relay minimization technique. It is expected that this analysis will be helpful to maintain the network reliability and healthy flow of power.

show abstract

References

2021

Optimal Coordination of Power Protective Devices With Illustrative Examples

View full text Add to dashboard Cite

Minimum Breakpoint Set Determination for Directional Overcurrent Relay Coordination in Large-Scale Power Networks via Matrix Computations

Cited by 16 publications

References 19 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

Intelligent Coordination of Overcurrent and Distance Relays using Meta Heuristic Algorithms

References

Contact Info

Product

Resources

About