基于改进禁忌算法的配电网络重构

Network Reconfiguration in Distribution Systems Using a Modified TS Algorithm

为了提高配电网络重构的优化质量和优化效率,提出了一种结合变异运算的最优邻域禁忌搜索算法。通过在禁忌算法中引入小概率变异扰动,增强禁忌算法跳出局部最优解的能力,提高了算法的全局寻优能力;利用配电网的结构特点,快速、简易地确定邻域最大降损开关交换,提高邻域候选解集的质量,提高了算法的搜索效率。3个算例的计算结果表明,本文算法计算速度快,寻优效果好,有效提高了网络重构的优化效率和优化质量。

To improve network reconfiguration result and efficiency, an optimal neighborhood Tabu Search（TS） algorithm combined with mutation operation is proposed in this paper. By introducing mutation operation into TS algorithm, the ability to escape from local optimum is enhanced and the global search ability of the TS algorithm is strengthened. By taking advantage of distribution network structure features, the switch exchange leading to the maximum power loss reduction can be easily and quickly determined within each loop. The quality of neighboring candidate solution set and the searching efficiency of TS algorithm are improved. Test results show that the method can save considerable computation time and effectively improve the optimizing quality and efficiency of the network reconfiguration.