摘要
建立了配电网络重构的图的多划分模型 ,提出了基于图的谱划分的算法 ,用于求解大规模配电网络的馈线间重构问题。针对规模巨大的实际配电系统 ,应用图的多级划分思想 ,提出了图的压缩算法以提高计算效率。算法避免了目前各种配电网络重构算法迭代过程中大量的潮流计算负担 ,且不依赖于系统的初始拓扑。其寻优能力不逊于常见的重构算法 ,且能高效地求取全局或近全局最优解 。
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.
出处
《电力系统自动化》
EI
CSCD
北大核心
2002年第18期25-29,共5页
Automation of Electric Power Systems
