Method of Distribution Network Fault Location Based on Improved Binary Snake Optimization Algorithm

Guan-feng LI , Zhi-jian LIANG , Wu YANG

Science Technology and Engineering ›› 2024, Vol. 24 ›› Issue (18) : 7710 -7718.

PDF
Science Technology and Engineering ›› 2024, Vol. 24 ›› Issue (18) : 7710-7718 DOI: 10.12404/j.issn.1671-1815.2304725
research-article
Method of Distribution Network Fault Location Based on Improved Binary Snake Optimization Algorithm
Author information +
History +
PDF

Abstract

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 optimization) algorithm was proposed. The SPM chaotic mapping was used to generate high-quality random number sequences, which improves the randomness of individuals in the algorithm population. A dynamic mutation strategy based on genetic algorithms was also introduced. 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.

Cite this article

Download citation ▾
Guan-feng LI, Zhi-jian LIANG, Wu YANG. Method of Distribution Network Fault Location Based on Improved Binary Snake Optimization Algorithm. Science Technology and Engineering, 2024, 24(18): 7710-7718 DOI:10.12404/j.issn.1671-1815.2304725

登录浏览全文

4963

注册一个新账户 忘记密码

References

Funding

PDF (2188KB)

16

Accesses

0

Citation

Detail

Sections
Recommended

/

〈 〉