Importance Assessment of Distribution Network Nodes Based on an Improved MBCC-HITS Algorithm

By accurately identifying important nodes in the distribution network and implementing priority protection measures or optimizing the network layout, a system’s anti-interference capability can be effectively enhanced while reducing the probability of failures. Inspired by the MBCC-HITS algorithm, this paper proposes an improved MBCC-HITS algorithm based on node degree centrality (DCHITS) for evaluating important nodes in distribution networks. Building upon the MBCC-HITS algorithm, the DCHITS algorithm incorporates node degree centrality to enhance the evaluation framework, supplementing the influence of topological structure factors on node importance assessment, thereby more accurately reflecting the actual conditions of the distribution network. In the IEEE 33 system, the DCHITS algorithm was compared with the node degree and node betweenness algorithms, as well as the MBCC-HITS algorithm, using two indicators: the scale of load loss and the maximum subgroup size. The results demonstrate that the DCHITS algorithm outperforms the others in both indicators. Specifically, compared to the MBCC-HITS algorithm, the scale of load loss increased by 0.55%, and the maximum subgroup size decreased by 8.21%. compared to the node degree and node betweenness algorithm, the scale of load loss increased by 6.63%, and the maximum subgroup size decreased by 5.38%. These findings indicate that the DCHITS algorithm is more rational and effective in identifying the important nodes in distribution networks.