# Novel Faulted-Section Location Method for Active Distribution Networks of New-Type Power Systems
## 6 Conclusions  
A fault section location algorithm combining the improved matrix algorithm and the GTA is proposed. The algorithm uses protection action and equipment status information, and can locate fault sections more efficiently. Firstly, considering the frequent changes in the topology of the active distribution network, a method for constructing the node status list is proposed. According to the idea of depth-first traversal in the tree search method, a topology search method for suspicious fault regions is proposed. The fault regions are obtained by combining the protection action regions to ensure they contain all possible fault sections. This algorithm can streamline the fault system and reduce the matrix calculation dimension. Secondly, an improved matrix algorithm is proposed to adapt to the access of DG, which is computed in a non-square matrix form. It can accurately locate single faults and multiple faults in non-T-connected sections. However, due to the limitations of the matrix calculation, the algorithm cannot accurately determine whether the T-connected sections of \(l_{i}=1\) and \(l_{i}=0\) are faulty in multiple faults. Therefore, based on the traditional matrix algorithm and superposition principle, this section proposes a verification method \begin{table}
\begin{tabular}{c c c c c} \hline \hline
**Algorithm** & **Computational Complexity** & **Average Convergence Algebra** & **Average Positioning** & **Average Execution Time/s** \\ \hline IA & \(2^{22}\) & 79 & 68.2 & 3.809 \\ IQGA & \(2^{22}\) & 33 & 91.8 & 2.358 \\ IGA & \(2^{22}\) & 43 & 55.7 & 2.986 \\ GTA & \(2^{15}\) & 20 & 96.3 & 1.689 \\ \hline \hline \end{tabular}
\end{table} 
Table 14: Comparison of results of algorithms for faults with fault information error location. \begin{table}
\begin{tabular}{c c c c c} \hline \hline
**Algorithm** & **Computational Complexity** & **Average Convergence Algebra** & **Average Positioning** & **Average Execution Time/s** \\ \hline IA & \(2^{22}\) & 74 & 70.3 & 3.747 \\ IQGA & \(2^{22}\) & 28 & 93.5 & 2.485 \\ IGA & \(2^{22}\) & 42 & 56.5 & 2.953 \\ GTA & \(2^{15}\) & 20 & 99.1 & 1.666 \\ \hline \hline \end{tabular}
\end{table} 
Table 12: Comparison of results of algorithms for single fault location. \begin{table}
\begin{tabular}{c c c c} \hline \hline
**Algorithm** & **Computational Complexity** & **Average Convergence Algebra** & **Average Positioning** & **Average Execution Time/s** \\ \hline IA & \(2^{22}\) & 79 & 68.2 & 3.809 \\ IQGA & \(2^{22}\) & 33 & 91.8 & 2.358 \\ IGA & \(2^{22}\) & 43 & 55.7 & 2.986 \\ GTA & \(2^{15}\) & 20 & 96.3 & 1.689 \\ \hline \hline \end{tabular}
\end{table} 
Table 13: Comparison of results of algorithms for multiple fault location. to improve tolerance performance. The GTA locates the fault sections when the verification is incorrect. Taking advantage of the fast calculation speed of the matrix can reduce the dimension of GTA optimization. Thirdly, the GTA is proposed to solve the problems that the improved matrix algorithm cannot accurately locate the multiple faults with T-connected sections and faults with fault information errors. A fault hypothesis based on equipment status and protection action information is proposed; a fitness function is constructed to reflect the difference between the actual and expected status of the fault information; the calculation equation of the expected status of the fault information is derived; the genetic coding rules, natural selection rules, greedy algorithm, and parameter selection are introduced. The GTA is used to find the fault hypothesis that reasonably explains received fault information, and the fault section location results are obtained. By comparing the optimization results with the fault information obtained by monitoring, error fault information can be obtained, which is convenient for the staff to maintain. Finally, the proposed algorithm is simulated in various fault conditions in the IEEE-34 node active distribution network.