改进二进制粒子群优化算法在配电网络重构中的应用

Reconfiguration of distribution network based on improved particle swarm optimization

配电网络重构是一个非常复杂的大规模组合优化问题。网络重构中,能否得到有效解,即保证辐射状网络,是一个很关键的问题。对电网拓扑进行简化,配合破圈法更新粒子,得到100%的有效解,大大提高了计算速度。提出一种应用于配电网络重构的改进二进制粒子群优化算法,并结合禁忌搜索算法,使PSO算法跳出局部最优化陷阱,改善了算法的搜索效果,加快了寻优速度。最后对IEEE 69节点系统进行计算,并与相关文献结果进行对比,表明本文改进算法具有快速、高效的全局寻优能力。

Distribution network reconfiguration for loss minimization is a complex, large-scale combinatorial optimization problem. In this problem, ensuring a radiant network is the key. In the paper, the configuration of distribution network is predigested, working with breaking-cycle-basis method to update the particles can gain 100% effective keys and greatly improve the speed of calculation. An improved binary particle swarm optimization applied to solve the distribution network reconfiguration problem is presented. Working with tabu search algorithm, this method can escape partial best key, improve the searching effect of basic PSO and accelerate the speed of searching the best keys. The optimization calculations of sixty-nine-node IEEE testing system by the presented method are conducted and the calculation results are compared with interrelated articles. Its compared results can show that the presented method has fast and high efficient ability to find the best key.