检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]四川大学电气信息学院,四川省成都市610065
出 处:《电网技术》2006年第21期94-98,共5页Power System Technology
摘 要:复杂环网保护配合关系中所有有向简单回路的确定是求解最小断点集的关键步骤。文章提出了一种基于图论理论确定复杂环网有向简单回路的新方法,引入层间隔回路判断原则,通过搜索简化后的网络节点邻接矩阵,同时利用保护配合关系的对称性,无需回溯便可快速确定全网所有有向简单回路。该方法形成的网络矩阵规模较小,计算流程简单直观。算例结果证明了该方法的正确性和实用性。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.
关 键 词:电力系统 图论 环网方向保护 有向简单回路 节点邻接矩阵
分 类 号:TM771[电气工程—电力系统及自动化]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.15