【摘要】 复杂环网保护配合关系中所有有向简单回路的确定是求解最小断点集的关键步骤。文章提出了一种基于图论理论确定复杂环网有向简单回路的新方法,引入层间隔回路判断原则,通过搜索简化后的网络节点邻接矩阵,同时利用保护配合关系的对称性,无需回溯便可快速确定全网所有有向简单回路。该方法形成的网络矩阵规模较小,计算流程简单直观。算例结果证明了该方法的正确性和实用性。更多还原

【Abstract】 The determination of all directed simple loops during relay coordination of complicated multi-loop power network is the key procedure to solve the least breakpoint set. The authors propose a novel graph theory based method to determine directed simple loops in which a judging principle is led in. By means of searching simplified nodal adjacent matrix of the network and adopting the symmetry in relay coordination, all directed simple loops of the whole network can be quickly determined while the back tracing is not needed. The scale of network matrix formed by the proposed method and its calculation amount are small. The correctness and practicability of the proposed method are verified by results of calculation examples.更多还原