Distribution Network Topological Optimization Based on BPSO Algorithm with Introduced Levy Flight

As a commonly used optimization algorithm in distribution network reconfiguration, the Binary Particle Swarm Optimization (BPSO) algorithm has advantages such as simplicity in implementation and strong robustness. However, during the process of distribution network reconfiguration, the traditional BPSO algorithm is prone to getting trapped in local optimal solutions and suffering from particle precocity. Based on the traditional BPSO algorithm, this research introduces the Levy flight factor, enabling particles to escape from local optimal solutions in distribution network reconfiguration and improving the convergence accuracy. In the 33 - bus system, compared with the traditional BPSO algorithm, this method can break free from local optimal solutions and shows good application prospects in distribution network reconfiguration.