基于保护矩阵和网络化简的最小断点集计算新方法

New Method for Selecting Minimum Break Point Set Based on Relay Matrix and Network Reduction

针对基于网络化简和保护配合关系的最小断点集(MBPS)计算方法所出现的多组同基MBPS问题,提出了一种基于保护三类矩阵(即保护重要度矩阵、保护归属矩阵、保护关联矩阵)和网络化简的MBPS求取方法,并以保护归属矩阵来解决网络的平行线路判据问题。该方法先形成保护三类矩阵,再以化简步骤对其进行动态调整,并按照断点选取原则选取断点,能够获取最优MBPS。最后通过算例验证了该算法的可行性和有效性。

Aiming at the problems of multi - group with the same cardinal number which emergences in a method for determi- ning minimum break point set （MBPS） based on network reduction and coordination relationships of relays, a method for de- termining MBPS based on threes types of relay matrix （ relay - importance matrix, relay - belong matrix, relay - incidence ma- trix） and network reduction is proposed, and the relay- belong matrix is used to solve the criterion of parallel lines in grid. Firstly, this method needs to form three types of relay matrix, then adjust them dynamically according to the simplification steps, and select the break points according to break points selecting rules, which can obtain the optimal MBPS. Finally, the feasibility and validity are proved with the example of simulation.