配电网负荷均衡的网络分割算法

随着配电网规模的不断扩大 ,配电网网络重构算法的实时性越来越难以满足工程实用化的要求。而网络重构的结果其实是将一个配电网分割成几部分 ,各部分通过常开的联络开关相连。基于此 ,提出了配电网负荷均衡的新算法———网络分割算法。该算法将负荷均衡作为一个网络优化问题 ,利用配电网的一种新模型———分层拓扑模型 ,将全局最优问题转为多阶段分割问题 ;同时 ,充分利用配电网负荷均衡的特点 ,通过寻找源点分支负荷大于负荷平均值的下确界负荷和小于负荷平均值的上确界负荷的方法 ,实现了配电网的负荷全局最优均衡。算例的仿真结果说明了该算法的正确、有效和快速。

Graph partitioning method of loads equalization for distribution networks

Along with enlargement of scope of distribution networks and increase of amount of region and complex coupling,algorithms of reconfiguration for distribution networks are becoming difficult to satisfy real time requirement of engineering applications,especially for restoration for distribution networks.In fact,it is results of reconfiguration for distribution networks to partition distribution networks into some portion.Every portion connects with switches whose position is open.Therefore reconfiguration for distribution networks can be comprehended as partitioning of distribution networks whose object is global optimization.Based on the comprehension,this paper provides a new algorithm--graph partitioning method which make loads equalization as network optimization and is described by hierarchical topology model.It is found that partition of loads is relation of the smallest load of vertex that is bigger than average and the biggest load of vertex that is smaller than average.The graph partitioning method,which optimizes a network by ordering the loads instead of combining the switches,realize a fast algorithm of the loads global optimal equalization for distribution networks by searching of the smallest load of vertex that is bigger than average and the biggest load of vertex that is smaller than average.Results of test show that the method presented is applicable and efficient.