基于最小生成树算法的配电网络重构

Distribution Network Reconfiguration Based on Minimum Spanning Tree Algorithm

为提高配电网的供电电压质量,提出了一种基于最小生成树算法的配电网络重构方法。首先将整个配电网当成一个赋权图,在潮流计算的基础上,利用Kruskal算法寻找网络的最小生成树,然后通过动态调整各条边的权值并反复迭代进行支路交换操作、细致优化网络,最终得到满足目标函数的网络拓扑。实例表明该方法不仅可以提高供电电压质量,也能够达到降低网损的目的。该方法对所寻网络没有特殊要求,不依赖于网络初始结构,易于解决复杂结构网络的寻优问题,重构速度快、效果理想。

The paper proposes a method of distribution network reconfiguration based on minimum spanning tree algorithm in order to improve voltage quality. As a weighted graph, the entire distribution network seeks its minimum spanning tree based on current calculation by Kruskal algorithm. In the tree-form network, the network topology in accordance with the objective function is obtained by dynamically adjusting the weights of each bands and repeated iteration which carries out branch exchanges as well as precisely optimizing the network. A example shows that no special network and initial network structure are required, this method demonstrates significant advantages in terms of easy management of optimization from complex network with high processing speed and ideal effect, and with this method not only the voltage quality of power supply can be improved, but also the objective of reducing the network loss is achieved.