基于最优流法与Mayeda生成树算法相结合的单阶段配网重构新方法

针对随机类优化算法用于配网重构计算时间长，而启发式算法用于配网重构存在的低精度解等的缺点，提出一种基于最优流法与Mayeda生成树算法相结合的单阶段配网重构新方法。该方法利用最优流法从支路交换的候选集中快速确定用于Mayeda生成树算法中用于支路交换的支路，从而既回避了随机进化选择方法进化慢的缺点，又回避了穷举法生成过多的劣树的缺点，等效于采用优化技术局部剔除了部分比当前树更劣的树，而明显加快其最优树的搜索过程。方法的优点是充分利用了最优流方法的快速性、Mayeda生成树算法的解空间的完备性，进行良好的结合实现了两者的优势互补，而提高其计算效率。算例验证了方法的有效性。方法因其快速性及至少得到次优解的特点而具有工程应用价值。

A New Method for One-Stage Distribution System Reconfiguration Based on Optimal Flow Algorithm and Mayeda Spanning Tree Algorithm

For the problem that the stochastic optimization algorithms have long calculation time and the heuristic algorithm has low accuracy when used for distribution network reconfiguration, this paper presents a new method of one-stage distribution network reconfiguration based on the optimal flow method and Mayeda spanning tree algorithm. The optimal flow method is employed to quickly select the branches that are used for branch exchanging in the Mayeda spanning tree algorithm from the candidate sets of branch exchanging, which avoids the slow evolution problem of the stochastic evolutionary selection method as well as the problem of too many poor trees generated by the exhaustive method, and is equivalent to partially eliminating the trees that are worse than the current tree by using the optimization technique, consequently speeding up the searching process for the optimal tree. The proposed method enjoys the advantages of the efficiency of the optimal flow method and the completeness of the solution space of Mayeda spanning tree algorithm, which are well integrated to improve the computational efficiency. The proposed method has been proved effective by case study and is valuable for engineering application due to its efficiency and its ability to find at least a suboptimal solution.