Power distribution network D-PMU optimal configuration method considering node difference
A technology for optimizing configuration and distribution network, applied in the field of power system, can solve problems such as inapplicability of optimal configuration scheme, failure to consider node importance and installation conditions, etc.
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0039] In order to solve the problem that distribution network measurement data is scarce and considerable problems are serious, embodiments of the present invention provide a distribution network D-PMU optimal configuration method that is suitable for actual engineering applications and considers node differences, see Figure 1 to Figure 4 , see the description below:
[0040] S100: Establishing a distribution network node-branch association matrix and a node association matrix by using an association matrix method;
[0041] Wherein, the step S100 includes:
[0042] S1001: Define distribution network system node-branch correlation matrix R=[r ik ]:
[0043]
[0044] Among them, r ik Indicates the connection value between node i and branch k, that is, the connectivity. When i is connected to k, r ik = 1, otherwise r ik =0. It can be seen from the definition that when the switch of branch k is turned off, it is no longer connected to the two previously connected nodes,...
Embodiment 2
[0152] The distribution network D-PMU optimal configuration algorithm proposed by the present invention is applied to the actual distribution network system of Guangzhou Nansha Yuan'an Station. According to the given electrical main wiring diagram of the distribution network system, the corresponding electrical topology diagram is generated as follows: Figure 5 As shown, the node-branch correlation matrix and node correlation matrix are obtained by using the correlation matrix method, and the node-branch adjacency table is calculated by using the breadth-first search algorithm, and the number of branches connected to each node is obtained.
[0153] According to formulas (3), (4), (5), and (6), four single node vulnerability indicators of node degree, node cohesion degree, node betweenness and node closeness are calculated respectively for each node in a given system. Using the entropy method of formulas (7) and (8) to get d 1 ~ d 4 The objective weights of the four indicato...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


