Method of Distribution Network Fault Location Based on Improved Binary Snake Optimization Algorithm
With the integration of DGs(distributed generations)into the distribution network,the traditional single-source radial network is transformed into a complex network with multiple power sources.Traditional fault location methods are difficult to adapt to the construction of complex operating conditions.A novel fault segment localization method based on IBSO(improved binary snake op-timization)algorithm was proposed.The SPM chaotic mapping was used to generate high-quality random number sequences,which im-proves the randomness of individuals in the algorithm population.A dynamic mutation strategy based on genetic algorithms was also intro-duced.According to different search states and evolutionary stages,the mutation rate and mode were dynamically adjusted.The flexibility and accuracy of the algorithm were improved significantly.The simulation results show that the proposed method is suitable for locating single and multiple fault sections in distribution networks with distributed generation.It has better convergence,speed,and accuracy compared with the snake optimization algorithm,traditional binary particle swarm algorithm,and genetic algorithm.
NETL
NSTL
万方数据
