首页 | 本学科首页   官方微博 | 高级检索  
     

一种新的大规模配电网络重构的图论算法——图的谱划分算法
引用本文:张鹏,郭永基.一种新的大规模配电网络重构的图论算法——图的谱划分算法[J].电力系统自动化,2002,26(18):25-29.
作者姓名:张鹏  郭永基
作者单位:清华大学电机系,北京市,100084
摘    要:建立了配电网网络重构的图的多划分模型,提出了基于图的谱划分的算法,用于求解大规模配电网络的馈线间重构问题,针对规模巨大的实际配电系统,应用图的多级划分思想,提出了图的压缩算法以提高计算效率。算法避免了目前各种配电网络重构算法迭代过程中大量的潮流计算负担,且不依赖于系统的初始拓扑。其寻优能力不逊于常见的重构算法,且能高效地求取全局或近全局最优解,具有实用前景。

关 键 词:大规模配电网络重构  图论算法  图的谱划分算法  启发式算法  馈线  潮流计算
收稿时间:1/1/1900 12:00:00 AM
修稿时间:1/1/1900 12:00:00 AM

A NOVEL SPECTRAL PARTITIONING METHOD FOR LARGE-SCALE DISTRIBUTION SYSTEM FEEDER RECONFIGURATION
Zhang Peng,Guo Yongji.A NOVEL SPECTRAL PARTITIONING METHOD FOR LARGE-SCALE DISTRIBUTION SYSTEM FEEDER RECONFIGURATION[J].Automation of Electric Power Systems,2002,26(18):25-29.
Authors:Zhang Peng  Guo Yongji
Abstract:This paper proposes a novel spectral partitioning algorithm, viz. recursive spectral bisection, for weighted graph partitioning that models large scale distribution feeder reconfiguration problem. Since the large scale network may not be partitioned efficiently, we present a multi level method to speed up. Firstly we replace the graph by a coarse approximation and partition it instead in order to get a rough partitioning, and then uncoarsen to get the final partitions. This algorithm can overcome the weakness of many of the previously described reconfiguration algorithms, i.e. they require a load flow solution to be performed in each iteration of the reconfiguration. Besides, the result is independent of the initial topology of networks. Hence it can achieve the global or near global optimum solution in shorter time than other methods and makes it possible to achieve on line distribution feeder reconfiguration for loss reduction and load balancing.
Keywords:distribution network  feeder reconfiguration  graph partitioning  spectral partitioning
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《电力系统自动化》浏览原始摘要信息
点击此处可从《电力系统自动化》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号