基于双向广度优先法的输电断面搜索方法
|
摘要
为了快速、精准、完整地搜索出受潮流转移影响较大的支路组成的输电断面,采用了基于图论中改进的双向广度优先搜索算法。该方法首先以加权邻接矩阵表示电力网络,然后根据改进的双向广度优先法搜索得到开断节点间前K最短路径,通过计算路径中支路的开断分布因子选取初始输电断面,进一步计算初始输电断面的暂态稳定安全裕度筛选出关键输电断面,以此代替对全网的安全性分析,大大缩减了计算量,为后续过载控制策略争取了时间,对防止连锁过载跳闸意义重大。对IEEE39节点系统的案例仿真分析,验证了该算法的可行性和准确性。
In order to search transmission section consisting of the branches that influenced greatly by flow transferring rapidly,accurately,completely,this paper presents an improved double breadth first search algorithm based on graph theory.In the proposed algorithm,firstly,the power network is expressed as weighted adjacency matrix; secondly,the K shortest paths between the breaking nodes are searched,according to the improved double breadth first search method.The initial transmission section is selected by calculation of line tripping distribution factors,and then calculate transient stability safety margin of the initial transmission section to select the key transmission section,replacing security analysis of the entire network which reduces the amount of calculation greatly and gains time for subsequent overload control strategy.It is significant to prevent cascade overload trips.Simulation results of IEEE 39-bus system show that the proposed algorithm is accurate and feasible.
In order to search transmission section consisting of the branches that influenced greatly by flow transferring rapidly,accurately,completely,this paper presents an improved double breadth first search algorithm based on graph theory.In the proposed algorithm,firstly,the power network is expressed as weighted adjacency matrix; secondly,the K shortest paths between the breaking nodes are searched,according to the improved double breadth first search method.The initial transmission section is selected by calculation of line tripping distribution factors,and then calculate transient stability safety margin of the initial transmission section to select the key transmission section,replacing security analysis of the entire network which reduces the amount of calculation greatly and gains time for subsequent overload control strategy.It is significant to prevent cascade overload trips.Simulation results of IEEE 39-bus system show that the proposed algorithm is accurate and feasible.
引文
[1]薛禹胜.综合防御由偶然故障演化为电力灾难——北美“8·14”大停电的警示[J].电力系统自动化,2003,27(18):1-5,37.
[2]印永华,郭剑波,赵建军,等.美加“8.14”大停电事故初步分析以及应吸取的教训[J].电网技术,2003,27(10):8-11,16.
[3]刘迎迎,孙毅,李昕,等.电力系统电压稳定分析方法综述[J].东北电力大学学报,2013,33(5):43-46.
[4]闫常友,周孝信,康建东,等.潮流转移灵敏度以及安全评估指标研究[J].中国电机工程学报,2010,30(19):7-13.
[5]聂宏展,王叫,马方明,等.基于潮流转移识别的紧急减载控制策略研究[J].东北电力大学学报,2016,36(4):1-6.
[6]徐岩,吕彬,林旭涛.潮流转移识别方法的研究与分析[J].电网技术,2013,37(2):411-416.
[7]林济铿,杨添剀,胡世俊,等.基于模糊聚类和最短路径的关键输电断面确定新方法[J].电力系统自动化,2015,39(5):134-141.
[8]周德才,张保会,姚峰,等.基于图论的输电断面快速搜索[J].中国电机工程学报,2006,26(12):32-38.
[9]倪宏坤,徐玉琴.基于动态规划原理分支界限算法的关键输电断面搜索方法[J].华北电力大学学报:自然科学版,2009,36(4):11-15.
[10]熊俊,肖先勇,邓武军,等.基于广度优先搜索算法和区域节点行向量法的复杂配电网络可靠性评估[J].电网技术,2007,31(9):27-32.
[11]陈晓玲,杨军,罗超,等.一种大电网潮流转移路径快速搜索方法[J].电网技术,2015,39(4):1045-1052.
[12]匡桂娟.广度优先搜索算法在互连网络通信中的应用[D].青岛:青岛大学,2005.
[13]王桂平,张帅.基于双向广度优先搜索的魔力方块问题求解[J].计算机工程,2011,37(20):219-222.
[14]王增平,李刚,任建文.基于前K最短路径的输电断面搜索新算法[J].电工技术学报,2012,27(4):193-201.
[15]S.A.Paluch.Multilable algorithm for K shortest paths problem[J].Komunikacie,2009,11(3):11-14.
[16]张富超,钟成元,张富春,等.基于源流路径剖分的输电断面快速搜索[J].电力系统保护与控制,2015,43(12):8-13.
[17]聂宏展,袁晓丹,张会强,等.基于多支路开断和关键支路集的快速潮流转移识别[J].电力系统保护与控制,2014,42(17):38-43.
[18]赵峰,孙宏斌,谭嫣,等.综合考虑多种电网安全主题的关键断面自动发现方法[J].电网技术,2014,38(5):1169-1174.
[2]印永华,郭剑波,赵建军,等.美加“8.14”大停电事故初步分析以及应吸取的教训[J].电网技术,2003,27(10):8-11,16.
[3]刘迎迎,孙毅,李昕,等.电力系统电压稳定分析方法综述[J].东北电力大学学报,2013,33(5):43-46.
[4]闫常友,周孝信,康建东,等.潮流转移灵敏度以及安全评估指标研究[J].中国电机工程学报,2010,30(19):7-13.
[5]聂宏展,王叫,马方明,等.基于潮流转移识别的紧急减载控制策略研究[J].东北电力大学学报,2016,36(4):1-6.
[6]徐岩,吕彬,林旭涛.潮流转移识别方法的研究与分析[J].电网技术,2013,37(2):411-416.
[7]林济铿,杨添剀,胡世俊,等.基于模糊聚类和最短路径的关键输电断面确定新方法[J].电力系统自动化,2015,39(5):134-141.
[8]周德才,张保会,姚峰,等.基于图论的输电断面快速搜索[J].中国电机工程学报,2006,26(12):32-38.
[9]倪宏坤,徐玉琴.基于动态规划原理分支界限算法的关键输电断面搜索方法[J].华北电力大学学报:自然科学版,2009,36(4):11-15.
[10]熊俊,肖先勇,邓武军,等.基于广度优先搜索算法和区域节点行向量法的复杂配电网络可靠性评估[J].电网技术,2007,31(9):27-32.
[11]陈晓玲,杨军,罗超,等.一种大电网潮流转移路径快速搜索方法[J].电网技术,2015,39(4):1045-1052.
[12]匡桂娟.广度优先搜索算法在互连网络通信中的应用[D].青岛:青岛大学,2005.
[13]王桂平,张帅.基于双向广度优先搜索的魔力方块问题求解[J].计算机工程,2011,37(20):219-222.
[14]王增平,李刚,任建文.基于前K最短路径的输电断面搜索新算法[J].电工技术学报,2012,27(4):193-201.
[15]S.A.Paluch.Multilable algorithm for K shortest paths problem[J].Komunikacie,2009,11(3):11-14.
[16]张富超,钟成元,张富春,等.基于源流路径剖分的输电断面快速搜索[J].电力系统保护与控制,2015,43(12):8-13.
[17]聂宏展,袁晓丹,张会强,等.基于多支路开断和关键支路集的快速潮流转移识别[J].电力系统保护与控制,2014,42(17):38-43.
[18]赵峰,孙宏斌,谭嫣,等.综合考虑多种电网安全主题的关键断面自动发现方法[J].电网技术,2014,38(5):1169-1174.