利用2-树计算环网方向保护配合最小断点集  

Determination of minimum break point set for coordination of direction protective relay in multi-loop networks based on 2-tree

作　　者：周文越[1] 吕飞鹏[1] 

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

出　　处：《华北电力大学学报（自然科学版）》2012年第6期13-17,22,共6页Journal of North China Electric Power University：Natural Science Edition

摘　　要：计算最小断点集(MBPS)是进行复杂环网方向保护整定计算的第一个步骤。通过割节点将复杂环网分解为多个子网络,对每一个子网络,提出了一种通过寻找2-树得到其MBPS的方法,然后将每个子网络的MBPS相加,进而得到全网的MBPS。该方法不需要寻找网络简单回路,计算量小,求出的MBPS基数可达到最小。通过算例验证所提出方法的正确性和实用性。The first step during the setting calculation of protection in a complex multi-loop network is calculating the minimum break point set （MBPS）. Firstly the whole network is partitioned into several sub-networks by finding the cut vertices. Then a method which is finding the 2-tree is proposed for getting the MBPS of each sub-network. By adding the MBPS of each sub-network, the MBPS of the whole network is obtained. By using the proposed method, it is no need to find the directed simple loops. The correctness and practicability of the proposed method are verified by the ex- amples.

关 键 词：整定计算 最小断点集 2-树 图论 网络分解 

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