基于最短路算法和最小节点电压法的配电网络重构  

Distribution Network Reconfiguration Based on Shortest Path Algorithm and Minimum Node Voltage Algorithm

作　　者：王磊[1] 柯丽芳[2] 姚李孝[2] 吕娟[1] 

机构地区：[1]西北电力设计院,陕西西安710075 [2]西安理工大学,陕西西安710048

出　　处：《电网与清洁能源》2011年第6期4-7,12,共5页Power System and Clean Energy

基　　金：陕西省自然科学基础研究计划资助项目(2005E239)

摘　　要：提出了一种基于最短路算法和最小节点电压法的配电网络重构方法。首先将整个配电网当成一个赋权图,在潮流计算的基础上,利用最短路径法为每个负荷分别寻找供电路径,然后在形成的树状网络中利用最小节点电压法进行支路交换操作细致优化网络,从而得到满足目标函数的网络拓扑。实例表明该方法对所寻网络没有特殊要求,不依赖于网络初始结构,易于解决复杂结构网络的寻优问题,重构速度较快、结果理想。The paper proposes one method of distribution network reconfiguration based on shortest path algorithm and minimum node voltage algorithm. As a kind of weighted graph, the entire distribution network seeks the power supply way separately by the shortest path algorithm for each load based on current calculation. In the tree-form network formed, careful network optimization as well as network analysis situs in accordance with the objective function are obtained by minimum node voltage algorithm which carries out sub circuit exchanges. The example shows that no special network and initial network structure is required, and this method demonstrates significant advantages in terms of easy management of optimization of the complex network, with high processing speed and ideal effects.

关 键 词：配电网重构 赋权图 最短路算法 最小节点电压法 

分 类 号：TM714[电气工程—电力系统及自动化]