基于前<em>K</em>最短路径的输电断面搜索新算法

Abstract
Figure/Table
References
Related Citation (10)

Download: PDF (464 KB) HTML (1 KB)
Export: BibTeX | EndNote (RIS)

Abstract Power flow transferring caused by overload lines removal is an important reason for cascading overload trips. By analyzing the features of flow transferring caused by overload removal, the conception of flow transferring factor (FTF) is introduced, a new definition of transmission section is given. According to the path feature of flow transferring. A new algorithm for fast searching transmission section is given. By converting the real-time power network into a topology, based on dynamic programming theory, it fast finds out the K shortest paths between the two nodes of the overload line in a subgraph with overload line as it’s center, finally finds out the transmission section suffered greatly from power flow transferring. The security analysis of the whole system is reduced to the analysis of a transmission section; the workload of further analysis is greatly reduced, so it’s very beneficial to avoid cascading overload trips.The simulation results of CEPRI 36-bus system show that the proposed algorithm is effective.

Key words： Flow transferring transmission section flow transferring factor graph theory K shortest paths dynamic programming

Received: 06 December 2011 Published: 20 March 2014

PACS:	TM712
	TM734

	Service

	E-mail this article
	Add to my bookshelf
	Add to citation manager
	E-mail Alert
	RSS
	Articles by authors
	Wang Zengping
	Li Gang
	Ren Jianwen

Cite this article:

Wang Zengping,Li Gang,Ren Jianwen. A New Search Algorithm for Transmission Section Based on K Shortest Paths[J]. Transactions of China Electrotechnical Society, 2012, 27(4): 193-201.

URL:

http://dgjsxb.ces-transaction.com/EN/ OR http://dgjsxb.ces-transaction.com/EN/Y2012/V27/I4/193

[1] 葛睿, 董昱, 吕跃春. 欧洲“11.4”大停电事故分析及对我国电网运行工作的启示[J]. 电网技术, 2007, 31(3): 1-6.
Ge Rui, Dong Yu, Lü Yuechun .Analysis of large- scale blackout in UCTE power grid and lessons to be drawn to power grid operation in China[J]. Power System Technology, 2007, 31(3): 1-6.
[2] 李再华, 白晓民, 丁剑. 西欧大停电事故分析[J]. 电力系统自动化, 2007, 31(1): 1-3.
Li Zaihua, Bai Xiaomin, Ding Jian．Analysis of large- scale blackout in Western Europe[J] Automation of Electric Power System, 2007, 31(1): 1-3.
[3] 张保会. 加强继电保护与紧急控制系统的研究提高互联电网安全防御能力[J]. 中国电机工程学报, 2004, 24(7): 1-6.
Zhang Baohui.Strengthen the protection relay and urgency control system to improve the capability in the interconnected power network[J]. Proceedings of the CSEE, 2004, 24(7): 1-6.
[4] 曹一家, 丁理杰, 江全元, 等. 基于协同学原理的电力系统大停电预测模型[J]. 中国电机工程学报, 2005, 25(18): 13-19.
Cao Yijia, Ding Lijie, Jiang Quanyuan, et al. A predictive model of power system blackout based on synergetic theory[J]. Proceedings of the CSEE, 2005, 25(18): 13-19.
[5] 陈晓刚, 孙可, 曹一家. 基于复杂网络理论的大电网结构脆弱性分析[J]. 电工技术学报, 2007, 22(10): 138-144.
Chen Xiaogang, Sun Ke, Cao Yijia. Structural vulnerability analysis of large power grid based on complex network theory[J]. Transactions of China Electrotechnical Society, 2007, 22(10): 138-144．
[6] 陈小平, 顾雪平. 基于遗传模拟退火算法的负荷恢复计划制定[J]. 电工技术学报, 2009, 24(1): 171- 175.
Chen Xiaoping, Gu Xueping. Determination of the load restoration plans based on genetic simulated annealing algorithms[J]. Transactions of China Electrotechnical Society, 2009, 24(1): 171-175.
[7] 周德才, 张保会, 姚峰. 基于图论的输电断面快速搜索[J]. 中国电机工程学报, 2006, 26(12): 32-38.
Zhou Decai, Zhang Baohui, Yao Feng. Fast search for transmission section based on graph theory[J]. Proceedings of the CSEE, 2006, 26(12): 32-38.
[8] 张保会, 姚峰, 周德才. 输电断面安全性保护及其关键技术研究[J]. 中国电机工程学报, 2006, 26(21): 1-7.
Zhang Baohui, Yao Feng, Zhou Decai. Study on security protection of transmission sections and its key techonlogies[J]. Proceedings of the CSEE, 2006, 26(21): 1-7.
[9] 倪宏坤, 徐玉琴. 基于动态规划原理分支界限算法的关键输电断面搜索方法[J]. 华北电力大学学报, 2009, 36(4): 11-15.
Ni Hongkun, Xu Yuqin. Fast search for the key transmission section based on dynamic-programming principle[J]. Journal of North China Electric Power University, 2009, 36(4): 11-15.
[10] 张玮, 潘贞存, 赵建国. 新的防止大停电事故的后备保护减载控制策略[J]. 电力系统自动化, 2007, 31(8): 27-31.
Zhang wei, Pan Zhencun, Zhao Jianguo.New load shedding control strategy for backup protection against cascading outages[J]. Automation of Electric Power Systems, 2007, 31(8): 27-31.
[11] 程临燕, 张保会, 郝治国. 基于线路功率组成的关键输电断面快速搜索[J]. 中国电机工程学报, 2010, 30(10): 50-56.
Cheng Linyan, Zhang Baohui, Hao Zhiguo. Fast search for key transmission section based on power component of line[J]. Proceedings of the CSEE, 2010, 30(10): 50-56.
[12] 徐慧明, 毕天妹, 黄少锋.基于WAMS的潮流转移识别算法[J]. 电力系统自动化, 2006, 30(14): 14-19.
Xu Huiming, Bi Tianshu, Huang Shaofeng.WAMS based flow transfer identification[J]. Automation of Electric Power Systems, 2006, 30(14): 14-19.
[13] 王成山, 许晓非, 余贻鑫.基于割集功率空间上的静态电压稳定域局部可视化方法[J]. 中国电机工程学报, 2004, 24(9): 13-18.
Wang Chengshan, Xu Xiaofei, Yu Yixin. Visualization of power system static voltage stability region in cut-set space[J]. Proceedings of the CSEE, 2004, 24(9): 13-18.
[14] 卢开澄. 图论及其应用[M]. 北京: 清华大学出版社, 1995.
[15] 余贻鑫, 段刚. 基于最短路算法和遗传算法的配电网重构[J]. 中国电机工程学报, 2000, 20(9): 44-49.
Yu Yixin, Duan Gang. Shortest path algorithm and genetic algorithm based distribution system reconfiguration[J]. Proceedings of the CSEE, 2000, 20(9): 44-49.
[16] 韩忠晖, 顾雪平, 刘艳. 考虑机组启动时限的大停电后初期恢复路径优化[J]. 中国电机工程学报, 2009, 29(4): 21-26.
Han Zhonghu, Gu Xueping, Liu Yan. Optimization of restoration paths considering unit start-up time requirements at early stage of power system restoration[J]. Proceedings of the CSEE, 2009, 29(4): 21-26.
[17] Matthew W, Carlyle R, Kevin W. Near shortest and K-shortest simple paths[J]. Networks, 2005, 46(2): 98-109.
[18] 柴登峰, 张登荣.前N条最短路径问题的算法及应用[J]. 浙江大学学报, 2002, 36(5): 531-534.
Chai Dengfeng, Zhang Dengrong. Algorithm and its application to N shortest paths problem[J]. Journal of Zhejiang University, 2002, 36(5): 531-534.
[19] 傅俊伟, 李兴明, 陈捷. 基于背离路径的Kth最短路径实用搜索算法[J]. 计算机技术与发展, 2009, 19(2): 120-126.
Fu Junwei, Li Xingming, Chen Jie. A practical algorithm for finding the shortest Kth path based on deviation path[J].Computer Technology and Develo- pment, 2009, 19(2): 120-126.
[20] 戴树贵, 陈文兰. 一个求解k短路径实用算法[J]. 计算机工程与应用, 2005, 41(36): 63-65.
Dai Shugu, Chen Wenlan. A practical algorithm for the k shortest-path problem[J].Computer Engineering and Applications, 2005, 41(36): 63-65.
[21] 李成江. 新的k最短路算法[J]. 山东大学学报. 2006, 41(4): 40-43.
Li Chengjiang. A new algorithm to find the k shortest paths[J]. Journal of Shan Dong University, 2006, 41(4): 40-43.