摘要
针对开关操作次数在目标函数中的权重系数难以确定的问题,提出仅以网损最小为优化的目标函数,给出不同开关操作次数下使目标函数最优的开关组合.采用深度优先搜索算法搜索并标记网络重构过程中形成的环网,在满足配电网约束条件下进行解环.每种解环方案类比为一个单独的细菌,目标函数为其引诱剂,应用细菌群体趋药性算法,选择出使目标函数为最优的故障恢复重构方案.仿真结果验证了该算法在配电网故障恢复重构中的有效性.
Aiming at the problem that the weight coefficient of switching operation times in objective function is difficult to determine,the optimal objective function is the minimum network loss.The optimal switching combination of the objective function under different switching operation times is given.A depth-first search algorithm is used to search and mark the loops formed in the process of network reconfiguration,and the loops are solved under the constraints of distribution network.Each decoupling scheme is analogous to a single bacterium,and the objective function is its attractant.By using the bacterial colony chemotaxis algorithm,the fault recovery reconstruction scheme which makes the objective function the best is selected.The simulation results validate the effectiveness of the proposed algorithm in fault recovery and reconfiguration of distribution network.
作者
邢晓敏
孙奇
张鹏宇
李茂清
Xing Xiaomin;Sun Qi;Zhang Pengyu;Li Maoqing(Electrical Engineering College,Northeast Electric Power University,Jilin Jilin 132012;State Grid Jilin Electric Power Co.LTD,Changchun Jilin 130021)
出处
《东北电力大学学报》
2019年第3期38-43,共6页
Journal of Northeast Electric Power University
基金
国家自然科学基金项目(51507029)
关键词
故障恢复
网络重构
深度优先搜索
离散细菌群体趋药性算法
Distribution Network
Fault Recovery
Network Reconfiguration
Depth First Search
Discrete Bacterial Colony Chemotaxis
