基于量子蚁群算法的配电网故障恢复重构[*]

FAULT RECOVERY AND RECONSTRUCTION OF DISTRIBUTION NETWORK BASED ON QUANTUM ANT COLONY ALGORITHM

关键词:  配电网故障恢复重构  量子蚁群算法  分布式电源，IEEE33节点配电网

Key words:  Fault recovery and reconstruction of distribution network  Quantum ant colony algorithm  Distributed generation

摘要:

本文就分布式电源高渗透的配电网故障恢复难度大，场景复杂多变，且传统智能优化算法在解决配电网故障恢复重构问题时会出现算法收敛速度慢，准确率不高的问题进行了深入研究，采用量子蚁群算法解决该问题，有望突破传统方法面临的壁垒。通过对配电网故障恢复重构问题进行合理建模与简化，对量子蚁群算法进行有效改进，为配电网故障恢复重构问题设计一种高效、可靠、快速、准确的方案。在IEEE33节点配电网上测试，实验结果证明改进的量子蚁群算法收敛速度快，寻优效率高。

Abstract:

This paper conducts in-depth research on the difficulty of fault recovery in distribution networks with high penetration of distributed power sources, the complexity and variability of scenarios, and the slow convergence speed and low accuracy of traditional intelligent optimization algorithms in solving the problem of fault recovery and reconstruction in distribution networks. Using quantum ant colony algorithm to solve this problem is expected to break through the barriers faced by traditional methods. By reasonably modeling and simplifying the problem of fault recovery and reconstruction in the distribution network, the quantum ant colony algorithm is effectively improved to design an efficient, reliable, fast, and accurate solution for the problem of fault recovery and reconstruction in the distribution network. Multiple application scenarios are divided to reasonably arrange the configuration of multiple types of distributed power sources, explore the role of distributed power sources, and verify the superiority of the proposed algorithm. The experimental results show that the improved quantum ant colony algorithm has fast convergence speed and high optimization efficiency.