一种考虑保护重要性差异的最小断点集选取方案

A Method for Determining MBPS Considering the Importance Differences of Relays

针对复杂环网整定过程中,处于同一环路中的保护容易出现相互等待、不能继续整定的"死锁"情况,提出了一种基于粒子群算法(PSO)的最小断点集MBPS求取方案.该方案考虑了保护间的重要性差异,研究了一种基于电气介数的保护重要性评估方法;为了降低MBPS对保护整定的影响,设计了新的目标函数并基于PSO实现,以保证MBPS基数最小而且重要性最低,为求取全局最优或接近最优的MBPS提供了一种新思路.算例仿真结果表明,新方法能有效地克服同基多组MBPS问题.

In the relay setting progress of complex ring networks, the deadclock phenomenon is easy to occur, which leads to the difficulty in determining where relay should start. To deal with this problem, a method for deter- mining the minimum break point set, or MBPS, was proposed based on PSO. And then to assess the importance difference of relays, the concept of electric betweeness was introduced. At last, the minimum bad effect of the MBPS was ensured, which requires not only the minimum base of the MBPS but also the lowest importance. Thus the global or sub-global optimal MBPS could be obtained, for which a new objective function was designed. Overall, simulation results show that this new method can solve the existing, multi-MPBS nroblem well.