Mixed-integer linear programming method for coordination of overcurrent and distance relays incorporating overcurrent relays characteristic selection

Ghotbi-Maleki, Mahdi; Taheri, Mohammad Reza

doi:10.1016/j.ijepes.2019.03.007

Cited by 27 publications

(12 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…OCRs coordination causes large and unacceptable operating times for OCRs, especially in large networks [5]. These issues demonstrate the necessity of using breakpoints (BP) for converting meshed networks to radial ones in order to achieve proper OCRs coordination.…”

Section: • the Weakness Of Intelligent Optimization Algorithms Formentioning

confidence: 99%

“…Table 1 shows the sum of operating times of OCRs for all 36 possible choices of MBPS. These operating times are calculated for maximum SCCs in the OCRs' own protection zones, mentioned in [5]. As can be seen, if {6,8} or {3,11} is selected as the MBPS, the sum of operating times will be 5.25 seconds (the maximum value) and 4.33 seconds (the lowest value), respectively.…”

Section: Problem Statementmentioning

confidence: 99%

“…The number of rows and columns of this matrix are equal to the number of network's loops and the number of network's OCRs, respectively. According to (5), if the OCR is present in the loop , the element of matrix will be equal to 1, and otherwise, will be equal to 0.…”

Section: Problem Statementmentioning

confidence: 99%

“…Overcurrent relays (OCR) are the most widely used relays in power networks, therefore, obtaining the optimal settings of these relays for their fast operation and preventing operation interference is an important problem. This action which is known as the coordination of OCRs, has been presented in the form of an optimization problem that can be solved with different types of optimization algorithms such as intelligent algorithms [1]- [4] and mathematical ones [5]- [6]. A comprehensive study about optimization algorithms has been provided in [7] and [8], also, a powerful optimization algorithm which made based on series and parallel combination of Genetic Algorithm (GA), Particle Swarm Optimization (PSO) and Non-Linear Programming (NLP) has been presented.…”

Section: Introductionmentioning

confidence: 99%

“…• It is not possible to achieve full coordination in some networks and some coordination constraints must be removed [9]. • Establishing the coordination constraints at places far from the generators increases the operating times of OCRs because of low level of short-circuit currents (SCC) [5].…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

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

Ghotbi-Maleki

Chabanloo

Ebadi

et al. 2020

IET Generation, Transmission & Distribution

Self Cite

View full text Add to dashboard Cite

In the process of determination of breakpoints for overcurrent relays (OCR) in power delivery systems, different sets with equal number of OCRs can be selected as minimum breakpoint set (MBPS). Therefore, determination of the most appropriate MBPS is an issue which must be considered. This paper proposes a prioritization between different MBPSs based on the sum of operating times of OCRs. In this case, a set which results the minimum sum of operating times is selected as the appropriate MBPS. For this purpose, the proposed method combines two problems: determination of MBPS and coordination of OCRs, and is expressed in mixed-integer linear programming (MILP) form. Also, a modified depth-first search (DFS) algorithm is applied to determine the OCRs contained loops of studied networks. It is shown that the proposed method has the capability to be combined with previous defined expert rules in this field in order to consider the network conditions in the process of determination of optimal breakpoint set (OBPS). In order to reduce the number of removed coordination constraints, a novel expert rule is added to the existing ones. The proposed method has been implemented on small (8-bus), medium (14-bus and 30-bus) and large (118-bus and 3120-bus) networks, and the results show the effectiveness of proposed method in determining breakpoint set with the least number in first priority and minimum operating times of relays in second priority.

show abstract

Section: • the Weakness Of Intelligent Optimization Algorithms Formentioning

confidence: 99%

Section: Problem Statementmentioning

confidence: 99%

Section: Problem Statementmentioning

confidence: 99%