Fast Search Algorithm for Key Transmission Sections Based on Topology Converging Adjacency Matrix

Abstract

The traditional method of searching transmission section generally has the problem of omission and time-consuming. A topology converging algorithm of power grid adjacency matrix is proposed in this paper. It aggregates neighboring buses based on a simple matrix transformation rule, and identify key transmission sections based on matrix operations and power flow distribution factors. This method has the advantage of no presetting the sub-zone, which can avoid the simplification of the grid topology in the sub-zone and improve the calculation accuracy. The complex logical operations of the traversal algorithm adopted by most of traditional methods can be avoided, and the calculation speed can be effectively improved. Besides, the algorithm also has a memory characteristic which can be applied to the online search of key transmission sections. The results of several IEEE test systems show the effectiveness of the proposed algorithm.

Keywords

• Key transmission sections
• power grid operation monitoring
• adjacency matrix
• topology converging
• blackouts