基于网络化简和配合关系的最小断点集计算方法  

A Novel Method for Determining Minimum Break Point Set Based on Network Graph Simplification and Coordination Relationships of Relays

作　　者：刘丹[1] 吕飞鹏[1] 

机构地区：[1]四川大学电气信息学院,四川省成都市610065

出　　处：《电力系统自动化》2008年第16期24-27,共4页Automation of Electric Power Systems

基　　金：四川省应用基础研究资助项目(2007JY085)~~

摘　　要：基于保护主后备配合依赖关系有向图,提出了通过有向图化简计算保护配合最小断点集(MBPS)的新方法。定义了配合依赖关系有向图化简操作的顺序和原则,按照优先级顺序将保护分类,根据保护后备依赖度最大原则从具有较高优先级的类中选择候选断点,将化简过程中得到的自环顶点选为断点。所述方法适用于环网全网配合和同段配合中MBPS的计算。Based on the directed graph of primary relay and backup relay＇s coordination relationships, a new method to determine the minimum break point set （MBPS） by graph simplification is proposed in this paper. The sequence and the principle of the directed graph simplification are given, and relays are classified according to the priority. The candidate break point is chosen from the higher priority category having the largest backup dependency degree, meanwhile the vertex of the selfloop obtained during contraction operation is selected as a break point. The presented method can be applied to solve the MBPS problem for the coordination of entire network or in the same zone.

关 键 词：保护整定计算 最小断点集 最小反馈顶点集 

分 类 号：TM744[电气工程—电力系统及自动化]