| 注册
首页|期刊导航|电工技术学报|基于前K最短路径的输电断面搜索新算法

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

王增平 李刚 任建文

电工技术学报2012,Vol.27Issue(4):193-201,9.
电工技术学报2012,Vol.27Issue(4):193-201,9.

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

A New Search Algorithm for Transmission Section Based on K Shortest Paths

王增平 1李刚 1任建文1

作者信息

  • 1. 华北电力大学新能源电力系统国家重点实验室保定071003
  • 折叠

摘要

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.

关键词

潮流转移/输电断面/潮流转移系数/图论/前K最短路径/动态规划

Key words

Flow transferring/transmission section/flow transferring factor/graph theory/K shortest paths/dynamic programming

分类

信息技术与安全科学

引用本文复制引用

王增平,李刚,任建文..基于前K最短路径的输电断面搜索新算法[J].电工技术学报,2012,27(4):193-201,9.

基金项目

国家自然科学基金重点项目 ()

电工技术学报

OA北大核心CSCDCSTPCD

1000-6753

访问量0
|
下载量0
段落导航相关论文