一种适用于继电保护在线整定的极小断点集求取算法

An algorithm to calculate the minimal break point set for relay protection online setting

复杂环网中继电保护在线整定的顺利进行依赖于极小断点集的快速求取,但现有极小断点集求取算法在算法复杂度、断点集维数及计算效率等方面还存在不足。对此,提出了一种适用于继电保护在线整定的极小断点集求取算法。该方法基于图论中基本割集矩阵与基本回路矩阵的固有关系,将复杂环网的断点集求取问题转换成了基于基本割集矩阵的基本回路断点集求取问题。通过动态调整基本割集矩阵,逐步计算得到网络极小断点集。算例分析表明,所提算法能够在有效的时间内求得网络极小断点集,大大降低了问题的复杂性。

The smooth online setting of relay protection in a complex loop network depends on the fast calculation of the minimal break point set.However,the existing algorithm for this set has some shortcomings in algorithm complexity,dimension of breakpoint set and computational efficiency.An algorithm to calculate the minimal break point set for relay protection online setting is proposed.Based on the inherent relationship between basic cut set matrix and basic loop matrix in graph theory,the problem of finding the break point set of a complex loop network is transformed into that of finding the break point set of basic loop based on basic cut set matrix.The minimal break point set of the network is obtained by adjusting the basic cut set matrix dynamically.Example analysis shows that the proposed algorithm can obtain the minimal break point set of the network in an effective time,and this greatly reduces the complexity of the problem.