摘要
提出了一种快速识别与过载支路相关的关键输电断面的图论方法。该方法根据实时的网络拓扑结构与潮流分布状态建立系统状态图,再利用图论中有向图的邻接矩阵与路径矩阵,通过简单的矩阵运算,快速地识别出受过载支路断开影响最严重的输电断面,从而减小了进一步分析计算的负担,为实现快速的关键输电断面安全性保护、避免连锁跳闸奠定了基础。文中采用中国电科院CEPRI36节点系统进行了仿真计算,结果验证了该算法的有效性和可行性。
This paper proposes an algorithm fast searching for key transmission section based on graph theory. This algorithm firstly establishes state graph of power system according to real-time information of networks topology and load flow, and then, with the use of the adjacency matrix and path matrix of the directed graph, fast finds out the key transmission sections suffered greatly from the outages of over-load lines through simple calculation of matrix. As a result, the works of further calculation and security analysis can be reduced greatly. And fast security protection of key sections to prevent cascading tripping can be achieved accordingly. At last, the validity of proposed algorithm is verified by the calculation result of CEPR136 test system.
出处
《中国电机工程学报》
EI
CSCD
北大核心
2006年第12期32-38,共7页
Proceedings of the CSEE
基金
国家自然科学重大项目(50595410).~~
关键词
电力系统
输电断面
安全分析
图论
快速搜索
power system
transmission section
security analysis
graph theory
fast search
