基于贪婪算法的配网多阶段快速重构新方法  

Fast Multi-stage Reconfiguration Method for Distribution System Based on Greedy Algorithm

作　　者：赵胜举 么莉 林济铿[2] 张旭 ZHAO Shengju;YAO Li;LIN Jikeng;ZHANG Xu(School of Electronic Information Engineering,Tianjin University,Tianjin 300072,China;School of Electrical Engineering,Tongji University,Shanghai 201804,China)

机构地区：[1]天津大学电气自动化与信息工程学院,天津300072 [2]同济大学电子与信息工程学院,上海201804

出　　处：《中国电力》2022年第6期33-41,共9页Electric Power

基　　金：国家自然科学基金资助项目(基于图论的智能电网电力孤岛的模型和优化,51177107)。

摘　　要：针对多阶段动态重构计算速度慢的问题,提出一种动态重构新方法。该方法基于给定的寻优尺度参数M,对以开关动作次数最多的两个相继阶段为中心的2M+2个阶段进行各种可能合并,分别对各个合并后的新阶段进行静态重构,然后选择目标函数值最小的合并方案为当前最优合并方案;如此反复迭代,直到目标函数值不再减少且当前解为可行解时,即得到近似最优解。方法在获得与全局最优解近似解的前提下,其计算速度都比全局最优解快近2个数量级。算例表明该方法因其求解的高效性而具有较好的工程应用前景。Aiming at the slow-speed computation problem of the multi-stage dynamic reconfiguration,a new dynamic reconfiguration method is proposed.Based on the given optimization scale parameter M,the proposed method makes all possible merges for 2M+2 phases which are centered on the two successive phases with the highest number of switching actions,and carries out static reconfiguration for each new merged phase,and then selects the merging scheme with a minimum objective function value as the current optimal merging scheme;repeat the iteration until the objective function value is no longer reduced and the current solution is a feasible solution,thereby obtaining the approximate optimal solution.On the premise of obtaining an approximate solution to the global optimal solution,the calculation speed is nearly 2 orders of magnitude faster than the global optimal solution.Case study shows that the proposed method has good engineering application prospect because of its high efficiency in solution.

关 键 词：配网重构 最优流法 Mayeda生成树 贪婪算法 多阶段动态重构 

分 类 号：TM73[电气工程—电力系统及自动化] TP18[自动化与计算机技术—控制理论与控制工程]