Power distribution network topology analysis method

By using the node degree and adjacent linked list storage method in the distribution network reconstruction, the problem of difficulty in efficiently judging the distribution network topology in the prior art is solved, and rapid and accurate judgment is achieved and algorithm efficiency is improved.

CN119726651APending Publication Date: 2025-03-28QIXIA POWER SUPPLY CO STATE GRID SHANDONG ELECTRIC POWER CO
0 Cites 0 Cited by

Patent Information

Application Number
CN202411698962.9
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-11-26
Publication Date
2025-03-28

AI Technical Summary

Technical Problem

The prior art is difficult to efficiently judge the topological structure in the distribution network reconstruction, resulting in the emergence of infeasible solutions, affecting the algorithm calculation speed and finding the optimal solution.

Method used

The radial operation is judged by the degree of the node, and the storage method of adjacent linked list is adopted. The time complexity is O(n), and parallel search is started at the node with degree of 1, which improves the judgment efficiency.

Benefits of technology

It realizes the rapid and accurate judgment of the topological structure of the distribution network, avoids the emergence of infeasible solutions, and improves the efficiency and accuracy of the algorithm.

✦ Generated by Eureka AI based on patent content.
Patent Text Reader

Abstract

The invention relates to a power distribution network topology analysis method, and belongs to the technical field of power distribution network reconstruction. Comprising the steps of power distribution network topology analysis, wiring analysis and operation mode judgment, data storage is achieved through an adjacency chain table, the space complexity of the method is low, for n nodes, if an adjacency matrix is adopted to represent the topological relation, the needed storage space is O (n2), only O (n + e) is needed when the adjacency chain table is adopted, and the storage mode is more flexible; and the number of each node edge can be obtained more easily. Radial operation is judged through the degrees of the nodes, the time complexity is O (n) by adopting a storage mode of an adjacent linked list, a plurality of starting points can be selected by starting from the nodes with the degrees of 1 in the algorithm, so that the algorithm can perform parallel search, and the judgment efficiency is greatly improved.
Need to check novelty before this filing date? Find Prior Art