基于最大最小蚁群算法的含分布式电源的配电网重构

摘要

This paper applies max-min ant colony algorithm for solving distribution network recon⁃figuration including distributed generation for the smallest power loss. In the process of reconfigura⁃tion, the formation of radiation network based on the growth of tree guarantees that the ants’paths meet network constraints, which improves the computational efficiency. By setting minimum and maximum value of road pheromone and the global pheromone updating methods, it can avoid the lo⁃cal optimal solution of ant colony algorithm and guarantee the convergence speed. Based on the Mat⁃lab programming, the IEEE69 node example is used for simulation analysis. The network loss reduc⁃es greatly and the voltage improves significantly after the reconfiguration. The optimization effect is remarkable.%以配电网网损最小为目标函数，将最大最小蚁群算法应用于含分布式电源（DG）的配电网重构。在重构过程中，基于生成树来形成辐射网保证了蚂蚁路径均满足网络拓扑约束，提高了计算效率。最大最小蚁群算法通过设置各支路信息素的最大最小值以及采用信息素全局更新方式，既可以避免基本蚁群算法易陷入局部最优解的弊端，又保证了收敛速度。基于Matlab编程，对IEEE69节点配电网进行仿真分析，配电网重构后，网损大大降低，节点电压有效提升，验证了该方法的可行性。