【摘要】 提出了基于保护主后备配合关系,利用保护配合依赖关系有向图节点邻接矩阵计算环网方向保护最优配合顺序的新方法。根据节点入度最大的原则逐步选择断点,根据节点出度为0的原则确定保护配合顺序,通过对节点邻接矩阵简单的行列化简运算逐步计算大规模复杂环网最小断点集和确定全网保护最优配合顺序。该方法简单直观,大大降低了问题的复杂度和计算量。更多还原

【Abstract】 Based on the coordination relationship between primary protection and backup protection and utilizing node adjacency matrix of directed graph of coordination dependency relationship,a novel method to determine optimal coordination sequence of directional protections in mesh network is proposed.According to the maximum in-degree principle,break point is chosen;by checking zero out-degree nodes,the coordination sequence of directional protections is determined.By means of simplification operation for rows and columns in node adjacency matrix,the minimum break point set of large-scale complicated mesh network is calculated step by step and the optimal coordination sequence of directional protections in whole network is determined.The proposed method is simple and straightforward,the complexity and the calculation amount of this problem can be greatly reduced.更多还原