Computation of Optimal Break Point Set of Relays—An Integer Linear Programming Approach

Gajbhiye, Rajeev; De, Ashoke; Soman, S. A.

doi:10.1109/tpwrd.2007.905539

Cited by 18 publications

(10 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…According to [15], the computation time for coordination increases with the size of the breakpoint set (BPS). If the cardinality of a BPS is minimal, the computational time of the directional relay coordination algorithm can improve significantly [25]. Therefore, it is advantageous to operate from a MBPS.…”

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

Section: Methods For Determining a Minimum Breakpoint Setmentioning

confidence: 99%

“…In Reference [25], an integer linear programming approach is proposed. However, as the size of the system increases, the computation time for the algorithm can increase exponentially due to the enumeration of loops involved in this algorithm [25], as will be seen in Section 5.…”

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

“…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%

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

“…A 400-kV network of western power grid, India [16] has been taken to check the effectiveness of this methodology. It consists of 46 buses spread over five states namely Maharashtra, Madhya Pradesh, Chhattisgarh, Gujarat and Goa.…”

Section: Implementation Of Olr Algorithm In a Section Of Indian Powermentioning

confidence: 99%

Implementation of Controlled Islanding Scheme for Self-healing Smart Grid

Khair¹,

Rihan²,

Zuhaib³

2018

IJET

View full text Add to dashboard Cite

With increase in deregulations and renewable sources of generation, the power system network is leading towards more geographical spread and interconnectedness. This causes significant challenges requiring on-line monitoring and control. It also provides a path for disturbances to propagate causing cascading failure, even blackouts. Wide area detection of potential island formation and controlled separation is considered as an effective tool against a blackout under severe disturbances. In the present work one line remaining algorithm has been utilized for implementation of controlled islanding in a section of Indian power grid.

show abstract

Computation of Optimal Break Point Set of Relays—An Integer Linear Programming Approach

Cited by 18 publications

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

Implementation of Controlled Islanding Scheme for Self-healing Smart Grid

Contact Info

Product

Resources

About