基于蚁群算法的配电网故障恢复重构

Ant Colony Algorithm for Service Restoration Reconfiguration in Distribution Networks

研究了故障后输电线路的重构优化问题,提出了一种求解目标最优的故障恢复重构算法。该算法基于蚁群算法,以电压稳定为前提,建立了以降低网损和操作开关数目最少为目标的数学模型。该算法不依赖初始参数的设置,具有全局搜索的能力,可通过改变权重系数将网损、开关操作数目等多目标优化问题转化为单目标优化,提高算法效率。实例证明该算法可以准确得到配电网故障后电网重构的最佳方案。

After researching the reconfiguration optimization of the post-fault transmission line, the paper proposes a new reconfiguration algorithm that seeks optimal object. The algorithm is based on ant colony system and considers voltage stability, thus building the mathematical model which considers the network loss reduction and the possible number minimization of switching operation; it is independent of the initial weight, capable of global search, and can transform multi-object optimization of network losses and switching operation times, etc. into single-object optimization by changing the weight coefficient, which improves the efficiency of algorithm. Sample test shows that the ant colony algorithm can solve the optimization question of post-fault distribution network reconfiguration effectively.