Research on Grounding Grid Corrosion Diagnosis Based on Genetic K‐Means Algorithm

ABSTRACT Grounding grid corrosion is one of the main reasons that affect the stable operation of electrical equipment in substations and endanger personal safety. After many years of operation, the grounding conductors will be eroded by soil. It may even cause major accidents and economic losses. Therefore, it is of great significance to diagnose the corrosion faults of the grounding grid and find out the corroded conductors. In this paper, the genetic K‐means algorithm (GKA) is proposed to solve the mathematical model and judge the corrosion of grounding conductors. This algorithm combines GA's global searching ability and K‐means's local searching ability, which improves the diagnosis result. In the simulation experiment, compared with the single GA's diagnosis, the diagnosis results of GKA were improved, and the number of misdiagnosed branches decreased by 66.7%. The simulation results show that the proposed algorithm takes less time to run, can eliminate the misdiagnosed branches commendably, and improve the accuracy of diagnosis. The proposed method provides a new idea to evaluate the corrosion degree of the grounding grid. The clustering algorithm is used to classify branches with similar corrosion degrees to achieve the purpose of corrosion diagnosis.

Authors

Institutions

Publication Details

Journal
Energy Science & Engineering
Published
2025-04-17
DOI
https://doi.org/10.1002/ese3.70087
Citations
2
Primary Topic
Non-Destructive Testing Techniques
Type
article
Field-Weighted Citation Impact
1.43

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Research on Grounding Grid Corrosion Diagnosis Based on Genetic K‐Means Algorithm

Mingxian Huang, Zhenshan Zhang, Longsheng Huang, Yunhao Song et al.
2 citations
Energy Science & Engineering
Non-Destructive Testing Techniques
1.43
article

Research on Grounding Grid Corrosion Diagnosis Based on Genetic K‐Means Algorithm

Mingxian Huang, Zhenshan Zhang, Longsheng Huang, Yunhao Song, Xianghui Xiao, Luchang Guan
article en
2 citations

Abstract

ABSTRACT Grounding grid corrosion is one of the main reasons that affect the stable operation of electrical equipment in substations and endanger personal safety. After many years of operation, the grounding conductors will be eroded by soil. It may even cause major accidents and economic losses. Therefore, it is of great significance to diagnose the corrosion faults of the grounding grid and find out the corroded conductors. In this paper, the genetic K‐means algorithm (GKA) is proposed to solve the mathematical model and judge the corrosion of grounding conductors. This algorithm combines GA's global searching ability and K‐means's local searching ability, which improves the diagnosis result. In the simulation experiment, compared with the single GA's diagnosis, the diagnosis results of GKA were improved, and the number of misdiagnosed branches decreased by 66.7%. The simulation results show that the proposed algorithm takes less time to run, can eliminate the misdiagnosed branches commendably, and improve the accuracy of diagnosis. The proposed method provides a new idea to evaluate the corrosion degree of the grounding grid. The clustering algorithm is used to classify branches with similar corrosion degrees to achieve the purpose of corrosion diagnosis.

Energy Science & EngineeringVol. 13(6)
Foshan University (CN)
National Natural Science Foundation of China, National Key Research and Development Program of China
Openalex Percentile: Top 21%
Non-Destructive Testing Techniques
1.43
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.