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

Abstract

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.

A new approach for solving set covering problem using jumping particle swarm optimization method

“…Through simulation and computational results they claimed that the BPSO technique performed well over other approaches in maximizing the disjoint set covers. Moirangthem et al (2012) proposed an approach based on PSO to identify the break point set in directional loops and multiloop settings and coordination of directional relays in system protection. In this approach they have converted the problem into set covering problem and then determined the break point set using PSO based technique.…”

Determination of optimal breakpoint set of overcurrent relays using modified depth‐first search and mixed‐integer linear programming

“…In the papers of second category, OCRs that can break all loops of network are selected as MBPS using intelligent 2 optimization algorithms such as GA [18], PSO [19] Biogeography-Based Optimization (BBO) [20], and mathematical optimization algorithm LP [21]. The coefficients of objective function in [18] are obtained based on the expert rules.…”

“…5 is mentioned in (18). Since the of given loops in (19) are the same as the in (18), therefore, this matrix is the same for repetitive loops. Therefore, it is possible to detect whether any loop is repetitive or not by comparing its with s of previously determined loops.…”

Minimum break relay dependency set approach for coordination of directional relays in multi‐loop networks

“…In recent years, the problem of determining MBPS of multi‐loop networks has been studied extensively. The MBPS calculation method can mainly be classified into three types: graph theory based methods [2–6], relay dependency function based methods [7–10], and artificial intelligence based methods [11–16]. Most graph theory based methods need to construct all the directed simple loops of a given system, which will be time consuming for large power systems.…”