基于GN分区的输电断面快速搜索  

Fast Searching of Transmission Section Based on GN Partition

作　　者：任建文[1] 魏俊姣 

机构地区：[1]新能源电力系统国家重点实验室(华北电力大学),河北保定071003

出　　处：《现代电力》2015年第3期42-48,共7页Modern Electric Power

基　　金：国家自然科学基金项目(50837002)

摘　　要：提出了一种基于电网分区的输电断面快速搜索方法。该方法在利用复杂网络社团划分中的GN算法对电网进行分区的基础上,结合图论中的路径矩阵等相关知识实现输电断面搜索。同时在对电网进行分区时,本文通过关键介数等指标确保脆弱线路以及重载线路优先成为区间联络线,从而有效克服了传统电网分区由于忽略电网拓扑结构以及线路负载情况而存在的问题,以此最大程度减小未进行区内选择带来的漏选问题。采用IEEE39节点系统标准算例,验证所提方法有效可行。A novel fast algorithm for searching the transmission section based on partition of power grid is presented in this paper,which partitions power grid by applying GN algorithm in complex grid community detection,and searches transmission section by combing related knowledge of path matrix in graph theory.At the same time,such comprehensive indexes as key betweenness are used to search vulnerable lines and the heavy load lines as interval contact lines when partitioning grid.Therefore,previous problems caused by not considering grid topological structure and line load in the traditional network partition are effectively solved,which can overcome the leaking select problems brought by not be chosen in grid area greatly.Simulation results of IEEE39-bus system show that the proposed algorithm is feasible and available.

关 键 词：电网分区 GN算法 脆弱线路 输电断面 关键介数 

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