Distribution Network Reconfiguration Algorithm Based On Binary Particle Swarm Optimization

Distribution network reconfiguration is a complicated combinatorial optimization problem, nonlinear and multi-objective. The problem is one of the Non-Polynomial (NP) hard problems in power system. This thesis presents a new method based on binary particle swarm optimization (BPSO) algorithm to solve network reconfiguration of distribution system for power loss reduction. Beside the identification of radial network and the convergence property of BPSO algorithm are also studied in this paper.A new method based on node-branch matrix searching is presented to identify network radial pattern. The method is effective, fast, and insensitive to distribution network topology. New population generated by common stochastic optimization algorithm may not ensure that the distribution network has a radial pattern, which however, could be solved by present method.Still, the performance of BPSO algorithm in convergence and the probability to find out global solution effect have also been fully investigated, according to different numbers of initial population and inertia factors.The results of three typical distribution network testing systems justify the efficiency and feasibility of the presented method in this thesis.