CN111737841A - Radial non-cross uniform distribution method of SCDN single line diagram - Google Patents

Abstract

The invention discloses a radial non-crossing uniform distribution method of an SCDN single line diagram, which comprises the steps of acquiring processing data, establishing a branch-trunk line model, determining the position and the included angle of a branch line relative to a trunk line, calculating the horizontal layout of an interconnection-branch line, eliminating the crossing of the interconnection-horizontal branch line, calculating the horizontal layout of a non-interconnection-branch line, eliminating the crossing of the non-interconnection-branch line and finishing the complete non-crossing SCDN single line diagram layout. The invention firstly generates the skeleton diagram of the power distribution network with all the substations as the centers, then completes the rest nodes of the skeleton diagram, then completes the fanning layout of the feeder line, adopts the plane layout method occupied by the space in advance, fundamentally avoids the crossing and the overlapping of the graphs, achieves the layout without crossing, does not need to carry out the subsequent inspection and the elimination of the crossing, and provides an automatic generation and non-crossing optimization method of the SCDN single line diagram for the central urban substation with a plurality of circuits and a plurality of switching stations outgoing lines.

Description

Radial non-cross uniform distribution method of SCDN single line diagram

Technical Field

The invention belongs to the field of situation perception and visualization of an intelligent power grid, and particularly relates to a high-identification single line diagram automatic generation algorithm which is suitable for a large number of switching stations and ring main units in a central city medium-voltage power distribution network under the intelligent power distribution network.

Background

A highly-complex medium-voltage multi-ring looped network which is supplied by an 220/110kV substation group, contains a large number of switching stations, a looped network cabinet, new energy and other power supply and power generation active elements is formed in a central city, physical coupling and information physical coupling are serious, operation difficulty and risk are increasingly aggravated, power grid monitoring and operating personnel are difficult to control, and an excellent situation perception visual control system is urgently needed to support.

The substation is the concept of a central distribution network (SCDN), and is mainly the online situation perception visualization of a large-scale distribution network based on the existing automation and intelligent measurement, so that situation management and control are in the greater part, a topological cognitive mechanism of large-scale first (global-first) is embodied, the operation situation supervision of the distribution network of 'clear at a glance' and 'in a list' is realized, and a user of the substation is mainly a distribution network operation manager.

Based on the situation visualization of the physical fusion of the dynamic slices and the CPS information of the medium-voltage distribution network taking the transformer substation as the center, the method is a core application technology of the high-level stage of one map and the brain of the urban power grid in the urgent need. The force field model or dynamic algorithm-based radial non-crossing uniform distribution method for the single line diagram of the central distribution network of the transformer substation is provided.

The method comprises the steps of firstly forming a skeleton diagram of a power distribution network with all substations as centers, then completing the rest nodes of the skeleton diagram, then arranging feeder line fanning patterns, and adopting a plane layout method occupied by space in advance, thereby fundamentally avoiding the crossing and overlapping of the diagrams, achieving the non-crossing layout, and avoiding the subsequent inspection and the elimination of the crossing.

Disclosure of Invention

Aiming at the defects of the prior art, the invention provides a radial non-cross uniform distribution method of an SCDN single line diagram, and provides an automatic generation non-cross optimization method of the SCDN single line diagram for a central urban transformer substation with a multi-loop multi-switching station outgoing line.

A radial non-crossing uniform distribution method of an SCDN single line diagram specifically comprises the following steps:

step one, data acquisition and processing;

analyzing the selected data document to obtain a data table of each feeder line; acquiring labels of relevant electrical equipment and loads of all 10kV feeders in a data table and 10kV feeders of all other substations to which the feeders are possibly supplied, acquiring topological information of end points-nodes of all the equipment, and extracting information of line sections, power supplies and switch equipment; and acquiring the radial static topology description of the conventional feeder line and the contact resources defined according to the conventional topology, and establishing node information and a line connection relation table.

Step two, establishing a trunk-branch line model;

starting from a 10kV feeder line outlet of the transformer substation, taking a line with the most branch nodes as a main line, namely a 0-level branch line;

step three, determining the relative position and included angle of the contact-1 level branch line and the 0 level branch line

A branch line taking a node on the 0-level branch line as an initial node is defined as a 1-level branch line, and a 1-level branch line which is in communication with other branch lines is defined as a communication-1-level branch line. By k_iThe value represents the location of the ith contact-1 branch relative to the 0 branch:

（1）

calculating the absolute value | α of the included angle between the ith 1-level branch and the 0-level branch_mi|

|α_mi|=π/3-π(m-1)/36，m=1、2、3…（2）

m represents the serial number of the level 1 branch on the node, and the larger the value of m is, | α_miThe smaller the | is.

Calculating the actual value α of the included angle between the ith branch line of level 1 and the branch line of level 0_mi

α_mi=k_i*|α_mi|=k_i*(π/3-π(m-1)/36) ，m=1、2、3…（3）

Step four, calculating the horizontal layout of the contact-branch line

Defining the branch line which is in communication with other branch lines as a communication-branch line; the 0-level branch line is arranged along the positive direction of the x axisAnd defining a node between the level 1 branch line and the level 0 trunk line as a source node. A branch line with a node with the level 1 branch line is defined as a level 2 branch line, and a node between the level 1 branch line and the level 2 branch line is defined as a level 1 node. And sequentially defining 3, 4 and 5 … level branches and 3, 4 and 5 … level nodes. And defining the a +1 level branch line as a lower level branch line of the a level branch line, wherein the initial distance between nodes is dis. Defining the initial node coordinate of the ith a-level branch line as (x)_i，y_i) Coordinate (x) of the jth a-level node on the ith a-level branch_ij，y_ij) Comprises the following steps:

x_ij=x_i(j-1)+dis*cos(k_i*α_mi)

y_ij=y_i(j-1)+dis*sin(k_i*α_mi) （4）

coordinates of each node of the three-level branch line and the branch lines above the three levels: the coordinates (x) of the initial node of the ith branch line are obtained from the coordinates of the node of the previous branch line_i，y_i) The coordinate of the jth node of the ith secondary branch line is (x)_ij，y_ij) Calculating the same formula (4);

step five, eliminating the cross among the connection lines;

a line intersection type is defined 3. The first type of crossover is: the communication line between two virtual communication nodes of the same generalized switching station passes through the trunk line; the second type of crossover is: a connecting line between two virtual connecting nodes of the same generalized switching station does not pass through a main line, but is crossed with a connecting line of another switching station; the third type of crossover is: the included angles between two branch lines and a main line of the virtual connection node of the same generalized switching station are arranged in sequence from large to small, but one of the two branch lines is too long, so that the connection lines are crossed;

for the first crossing type, the positions of the 2 virtual contact switch nodes belonging to the same generalized switching station at the clockwise side and the anticlockwise side relative to the main lines of the virtual contact switch nodes are changed, so that the crossing is eliminated;

for the second type of crossing, eliminating the crossing by exchanging the serial numbers m of the branch lines of the 2 virtual contact switch nodes of different switching stations on the same trunk line;

for the third cross type, distance shortening processing is carried out through a formula (5);

dis_L=dis₀-5*（L+1） （5）

dis0 is equal to the set initial distance between nodes, formula (5) is calculated circularly, L is the number of circulations, and dis is the result after each circulation calculation, and the result dis of each circulation calculation is substituted into dis calculation coordinates in formula (4) until the connecting lines of the branch lines do not intersect.

Sixthly, determining the relative position and included angle of the non-contact branch line

A non-contact-level 1 leg is defined as a level 1 leg that has no contact with other legs. By k_iThe value represents the location of the ith non-contact-1 level branch relative to the 0 level branch.

Calculating the absolute value | α of the included angle between the ith non-contact-a level branch and the superior branch_niL and included angle α_ni

|α_ni|=π/3-π(n-1)/36，n=1、2、3…（6）

According to the absolute value of the included angle | α_niI determines k of the ith non-contact-a level branch_iValue and angle α_ni

α_ni=k_i*|α_ni|=k_i*(π/3-π(n-1)/36) ，n=1、2、3…（7）

① n =1, | α_ni| take maximum value α_max= pi/3, when α_ni=α_maxWhen there is no branch, k of the 1 st non-contact-a level branch_i=1；

② if α_ni=α_maxThere is a branch line, α_ni=-α_maxWhere there is no branch, k for the 1 st non-contact-a class branch_i=-1；

③ if α_ni|=α_maxWhere there are branches, then | α_ni|₌(pi/3-pi (n-1)/36, n =2, and repeatedly judging whether a branch line exists;

and repeating the steps until all the non-contact branch lines are uniformly distributed on two sides of the superior branch line.

Step seven, calculating the horizontal layout of the non-contact-branch line;

and (4) finishing the coordinates of the non-contact-branch node according to the calculation method in the step (4) and finishing the initial horizontal layout.

And step eight, completing sector splicing after rotating and scaling the sectors of the single feeder in the initial horizontal layout, and initially establishing a complete SCDN layout.

Step nine, eliminating cross nodes of non-contact-branch lines;

step 9.1, numbering non-contact branch lines with cross nodes according to the distance sequence from the starting point of the branch line at the upper level, and respectively arranging a 1 st branch line, a 2 nd branch line … and the like from the starting point;

step 9.2, define kk_iiIndicating the position of the ii 2-level branch relative to the 1-level branch

（8）

When ii > =3, and is an odd number, kkii = (-1) × kkii.

kk_iiA1 means clockwise of the first branch line, and a-1 means counterclockwise.

Step 9.3, determining the ii level 1 node path on the i level non-contact-1 branch_iiThe coordinates of (a).

When i is<Path 3 time, path_iiThe coordinates of (a) remain unchanged;

when i is>Path when =3_iiAngle xita _00 with main trunk line_iiComprises the following steps:

xita_00_ii=arctan((y_pathi-1(1)- y_pathi-1(dd))/ (x_pathi-1(1)- x_pathi-1(dd))),dd=2、3、4…（9）

（x_pathi-1(dd)，y_pathi-1(dd)) are the coordinates of the dd node on the i-1 th non-contact level 1 branch and on branches below level 1.

① when xita _00_iiWhen all are greater than 0 or all are less than 0,

（10）

② when xita _00_iiWhen more than 0 or less than 0 is present at the same time,

（11）

therefore, the node path on the ii level 1 branch on the ith non-contact-1 level branch_iiCoordinate (x) of_pathii，y_pathii) Comprises the following steps:

r_ii=dis*(ii-1)

（x_pathii，y_pathii）=（x_pathi-1(1)，y_pathi-1(1)）+ r_iie^j’*xita_00（12）

where rii is the sector radius of pathii with respect to the source node corresponding to the non-contact-1 branch, and j' represents an imaginary number;

and 9.4, taking the node as a previous node, wherein the nodes which are directly connected with the previous node are collectively called the subsequent node. Traversing successor node of ii level 1 node on non-contact level 1 leg_iTo node_iSequencing according to the number of the subsequent nodes from least to most, wherein the row with the most number of the subsequent nodes is arranged at the outermost end; the number is jj;

step 9.5, solving the node of the successor node_iThe coordinates of (a):

xita_0=arctan((y_pathii(i)- y_pathii(i-1))/( x_pathii(i)- x_pathii(i-1)))

xita_1=xita_0+kk_ii*π/180*jj （13）

r =(( y_pathii(i)- y_pathii(i-1))²+( x_pathii(i)- x_pathii(i-1))²)^1/2

(x_pathiii(jj)’, y_pathiii(jj)’)=( x_pathii(i)’, y_pathii(i)’)+r*e^j’*xita_1

the xita _0 represents the included angle between the non-contact-1 level branch line and the main trunk line; xita _1 is the jj-th node_iThe included angle of the non-contact-1 level branch line; r is a node_iThe sector radius of (a); (x)_pathiii(jj)’, y_pathiii(jj)') is the jth node_iThe coordinates of (a).

Step 9.6, traverse node_iNode _ wai of_iDetermine node _ wai_iAngle xita — 22 relative to the non-contact-1 branch:

xita_22_j=arctan((y_pathii(ii+1)- y_nodei+1(j))/( x_pathii(ii+1)- x_nodei+1(j))) （14）

in the formula, a node_i+1All successors of node ii +1 of the non-contact-1 branch, j being node_i+1According to node_i+1And path_iiThe maximum included angle of (i + 1) is determined absolutely for xita _22

(1) When xita _22_jWhen all are greater than 0 or all are less than 0,

（15）

(2) when xita 22j is present at the same time greater than 0 or less than 0,

（16）

(3) when the nodei +1 is not present,

xita_22=arctan((y_pathii(ii)- y_pathii(ii+1))/( x_pathii(ii)- x_pathii(ii+1)))（17）

i.e. branch line with an angle xita _22, the first two cases being with node_i+1The branch line of the middle and maximum included angles is parallel to the path in the third case_iiParallel.

Step 9.7, solving the subsequent node _ wai_iThe coordinates of (a):

xita_2=xita_22+kk_ii*π/360*j

r =0.5*(( y_pathii(ii)- y_pathii(ii+1))²+( x_pathii(ii)- x_pathii(i+1))²)^1/2（18）

(x_{node_waii}(j)’, y_{node_waii}(j)’)=( x_nodeii(jj)’, y_nodeii(jj)’)+r*e^j’*xita_2

wherein xita _2 is a node_iThe included angle of the jth subsequent node; r is the node radius node _ wai_iRelative to node_iThe radius of (a); (x)_nodeii(jj)’，y_nodeii(jj)') jj-th node_i(x) of (C)_{node_waii}(j)’，y_{node_waii}(j) ') is node _ wai of jth_iThe coordinates of (a);

step 9.8, repeat steps 9.6 and 9.7 until node _ wai_iDoes not exist;

step ten, splicing into a complete non-cross SCDN single line diagram layout according to the rotation and zooming processing of the sectors of the single feeder in the initial layout.

The invention has the following beneficial effects: the calculation is quick, no cross is generated, the subsequent cross point classification and elimination are not needed, and the time and the labor are saved.

Drawings

Fig. 1 is a classification of cross-connection situations.

Fig. 2 is a topological diagram after completion of a single feeder skeleton diagram.

Fig. 3 is a single feeder non-crossing topological graph after a feeder fanning pattern cloth office algorithm.

Fig. 4 is a diagram of the algorithm of the present invention forming the central urban area SCDN initial single line.

Detailed Description

The invention is further explained in the following with reference to the drawings

Step one, data acquisition and processing;

analyzing the JSON document, acquiring conventional feeder line radial static topology description and contact resources defined according to conventional topology, and completing establishment of node information and a line connection relation table;

step two, establishing a trunk-branch line model;

starting from a 10kV feeder line outlet of the transformer substation, taking a line with the most branch nodes as a main line, namely a 0-level branch line;

step three, determining the relative position and included angle of the contact-1 level branch line and the 0 level branch line

A branch line taking a node on the 0-level branch line as an initial node is defined as a 1-level branch line, and a 1-level branch line which is in communication with other branch lines is defined as a communication-1-level branch line. By k_iThe value represents the location of the ith contact-1 branch relative to the 0 branch:

（19）

calculating the absolute value | α of the included angle between the ith 1-level branch and the 0-level branch_mi|

|α_mi|=π/3-π(m-1)/36，m=1、2、3…（20）

m represents the serial number of the level 1 branch on the node, and the larger the value of m is, | α_miThe smaller the | is.

Calculating the actual value α of the included angle between the ith branch line of level 1 and the branch line of level 0_mi

α_mi=k_i*|α_mi|=k_i*(π/3-π(m-1)/36) ，m=1、2、3…（21）

Step four, calculating the horizontal layout of the contact-branch line

Defining the branch line which is in communication with other branch lines as a communication-branch line; and arranging the 0-level branch line along the positive direction of the x axis, and defining a node between the 1-level branch line and the 0-level trunk line as a source node. A branch line with a node with the level 1 branch line is defined as a level 2 branch line, and a node between the level 1 branch line and the level 2 branch line is defined as a level 1 node. And sequentially defining 3, 4 and 5 … level branches and 3, 4 and 5 … level nodes. And defining the a +1 level branch line as a lower level branch line of the a level branch line, wherein the initial distance between nodes is dis. Defining the initial node coordinate of the ith a-level branch line as (x)_i，y_i) Coordinate (x) of the jth a-level node on the ith a-level branch_ij，y_ij) Comprises the following steps:

x_ij=x_i(j-1)+dis*cos(k_i*α_mi)

y_ij=y_i(j-1)+dis*sin(k_i*α_mi) （22）

coordinates of each node of the three-level branch line and the branch lines above the three levels: the coordinates (x) of the initial node of the ith branch line are obtained from the coordinates of the node of the previous branch line_i，y_i) The coordinate of the jth node of the ith secondary branch line is (x)_ij，y_ij) Calculating the same formula (22);

step five, eliminating the cross among the connection lines

As shown in fig. 1, 3 line crossing types are defined. The first type of crossover is: the tie lines 7-f in fig. 1, which pass through the bus; the second type of crossover is: in fig. 1, the two tie lines 8-h and 9-g do not pass through the bus bar but cross each other; the third type of crossover is: the connection lines 5-d and 6-e in fig. 1 are also the second type in nature, and the difference is that the virtual connection nodes (5 and d, 6 and e) belong to the same generalized switching station, and the included angles between the two branch lines and the trunk line are arranged in sequence from large to small;

for the first cross type, 2 virtual contact switch nodes belonging to the same generalized switching station are close to each other on the coordinate position, so that 7 is positioned on the counterclockwise side of the feeder line 1, and g is positioned on the clockwise side of the feeder line 2;

for the second cross type, positions of 8 and 9 or g and h are exchanged, the solution is that branch lines with a trunk line node 2 as a starting source node are sequenced through an included angle with the trunk line, the included angle is 1 at the maximum, and so on, the serial numbers of two virtual interconnection switches of the same generalized switching station are the same;

for the third cross type, distance shortening processing is carried out through a formula (23);

dis_L=dis₀-5*（L+1） （23）

dis0 is equal to the set initial distance between nodes, the formula (23) is calculated circularly, L is the number of circulations, and dis is the result after each circulation calculation, and the result dis of each circulation calculation is substituted into the dis calculation coordinate in the formula (22) until the connecting lines of the branch lines do not intersect.

The order and relative positions of the tie-1 branch lines after the cross is eliminated are shown in the table below

Non-contact 1-level spur numbering	Belonging trunk line	The source node	Order of position m	Relative trunk position k i
					5	Main line 1	1	1	1
6	Main line 1	1	2	1
					7	Main line 1	2	1	1
8	Main line 1	2	2	1
					9	Main line 1	2	3	1
d	Main trunk line 2	a	1	-1
					e	Main trunk line 2	a	2	-1
f	Main trunk line 2	b	1	-1
					g	Main trunk line 2	b	2	-1
h	Main trunk line 2	b	3	-1

Sixthly, determining the relative position and included angle of the non-contact branch line

A non-contact-level 1 leg is defined as a level 1 leg that has no contact with other legs. By k_iThe value represents the location of the ith non-contact-1 level branch relative to the 0 level branch.

Calculating the absolute value | α of the included angle between the ith non-contact-a level branch and the superior branch_niL and included angle α_ni

|α_ni|=π/3-π(n-1)/36，n=1、2、3…（24）

According to the absolute value of the included angle | α_niI determines k of the ith non-contact-a level branch_iValue and angle α_ni

α_ni=k_i*|α_ni|=k_i*(π/3-π(n-1)/36) ，n=1、2、3…（25）

① n =1, | α_ni| take maximum value α_max= pi/3, when α_ni=α_maxWhen there is no branch, k of the 1 st non-contact-a level branch_i=1；

② if α_ni=α_maxThere is a branch line, α_ni=-α_maxWhere there is no branch, k for the 1 st non-contact-a class branch_i=-1；

③ if α_ni|=α_maxWhere there are branches, then | α_ni|₌(pi/3-pi (n-1)/36, n =2, and repeatedly judging whether a branch line exists;

and repeating the steps until all the non-contact branch lines are uniformly distributed on two sides of the superior branch line.

Step seven, calculating the horizontal layout of the non-contact-branch line;

and (4) finishing the coordinates of the non-contact-branch node according to the calculation method in the step (4) and finishing the initial horizontal layout.

And step eight, completing sector splicing after rotating and scaling the sectors of the single feeder lines in the initial horizontal layout, and initially establishing a complete SCDN layout, wherein the abscissa and ordinate axes have no specific dimension and are only used for representing the relative plane space position of each node, and the same principle is shown in FIGS. 3 and 4.

Step nine, eliminating cross nodes of non-contact-branch lines;

step 9.1, numbering non-contact branch lines with cross nodes according to the distance sequence from the starting point of the branch line at the upper level, and respectively arranging a 1 st branch line, a 2 nd branch line … and the like from the starting point;

step 9.2, define kkii to represent the position of the ii 2-level branch relative to the 1-level branch

（26）

When ii is>And if it is an odd number, kk_ii=（-1）*kk_ii。

kk_iiA1 means clockwise of the first branch line, and a-1 means counterclockwise.

Step 9.3, determining the ii level 1 node path on the i level non-contact-1 branch_iiThe coordinates of (a).

When i is<Path 3 time, path_iiThe coordinates of (a) remain unchanged;

when i is>Path when =3_iiAngle xita _00 with main trunk line_iiComprises the following steps:

xita_00_ii=arctan((y_pathi-1(1)- y_pathi-1(dd))/ (x_pathi-1(1)- x_pathi-1(dd))),dd=2、3、4…（27）

（x_pathi-1(dd)，y_pathi-1(dd)) are the coordinates of the dd node on the i-1 th non-contact level 1 branch and on branches below level 1.

(1) When xita _00_iiWhen all are greater than 0 or all are less than 0,

（28）

(2) when xita _00_iiWhen more than 0 or less than 0 is present at the same time,

（29）

therefore, the node path on the ii level 1 branch on the ith non-contact-1 level branch_iiCoordinate (x) of_pathii，y_pathii) Comprises the following steps:

r_ii=dis*(ii-1)

（x_pathii，y_pathii）=（x_pathi-1(1)，y_pathi-1(1)）+ r_iie^j’*xita_00（30）

in the formula, r_iiIs path_iiJ' represents an imaginary number relative to the sector radius of the source node corresponding to the non-contact-1 level branch;

and 9.4, taking the node as a previous node, wherein the nodes which are directly connected with the previous node are collectively called the subsequent node. Traversing successor node of ii level 1 node on non-contact level 1 leg_iTo node_iSequencing according to the number of the subsequent nodes from least to most, wherein the row with the most number of the subsequent nodes is arranged at the outermost end; the number is jj;

step 9.5, solving the node of the successor node_iThe coordinates of (a):

xita_0=arctan((y_pathii(i)- y_pathii(i-1))/( x_pathii(i)- x_pathii(i-1)))

xita_1=xita_0+kk_ii*π/180*jj

r =(( y_pathii(i)- y_pathii(i-1))²+( x_pathii(i)- x_pathii(i-1))²)^1/2（31）

(x_pathiii(jj)’, y_pathiii(jj)’)=( x_pathii(i)’, y_pathii(i)’)+r*e^j’*xita_1

the xita _0 represents the included angle between the non-contact-1 level branch line and the main trunk line; xita _1 is the jj-th node_iThe included angle of the non-contact-1 level branch line; r is a node_iSector half ofDiameter; (x)_pathiii(jj)’, y_pathiii(jj)') is the jth node_iThe coordinates of (a).

Step 9.6, traverse node_iNode _ wai of_iDetermine node _ wai_iAngle xita — 22 relative to the non-contact-1 branch:

xita_22_j=arctan((y_pathii(ii+1)- y_nodei+1(j))/( x_pathii(ii+1)- x_nodei+1(j))) （32）

in the formula, a node_i+1All successors of node ii +1 of the non-contact-1 branch, j being node_i+1According to node_i+1And path_iiThe maximum included angle of (i + 1) is determined absolutely for xita _22

(1) When xita _22_jWhen all are greater than 0 or all are less than 0,

（33）

(2) when xita 22j is present at the same time greater than 0 or less than 0,

（34）

(3) when the nodei +1 is not present,

xita_22=arctan((y_pathii(ii)- y_pathii(ii+1))/( x_pathii(ii)- x_pathii(ii+1)))（35）

i.e. branch line with an angle xita _22, the first two cases being with node_i+1The branch line of the middle and maximum included angles is parallel to the path in the third case_iiParallel.

Step 9.7, solving the subsequent node _ wai_iThe coordinates of (a):

xita_2=xita_22+kk_ii*π/360*j

r =0.5*(( y_pathii(ii)- y_pathii(ii+1))²+( x_pathii(ii)- x_pathii(i+1))²)^1/2（36）

(x_{node_waii}(j)’, y_{node_waii}(j)’)=( x_nodeii(jj)’, y_nodeii(jj)’)+r*e^j’*xita_2

wherein xita _2 is a node_iThe included angle of the jth subsequent node; r is the node radius node _ wai_iRelative to node_iThe radius of (a); (x)_nodeii(jj)’，y_nodeii(jj)') jj-th node_i(x) of (C)_{node_waii}(j)’，y_{node_waii}(j) ') is node _ wai of jth_iThe coordinates of (a);

step 9.8, repeat steps 9.6 and 9.7 until node _ wai_iDoes not exist, as shown in fig. 3;

step ten, splicing into a complete non-cross SCDN single line diagram layout according to the rotation and zooming processing of the sectors of the single feeder in the initial layout, as shown in figure 4.

Claims (1)

1. A radial non-cross uniform distribution method of an SCDN single line graph is characterized in that: the method specifically comprises the following steps:

step one, data acquisition and processing;

analyzing the selected data document to obtain a data table of each feeder line; acquiring labels of relevant electrical equipment and loads of all 10kV feeders in a data table and 10kV feeders of all other substations to which the feeders are possibly supplied, acquiring topological information of end points-nodes of all the equipment, and extracting information of line sections, power supplies and switch equipment; acquiring conventional feeder radial static topology description and contact resources defined according to conventional topology, and establishing node information and a line connection relation table;

step two, establishing a trunk-branch line model;

starting from a 10kV feeder line outlet of the transformer substation, taking a line with the most branch nodes as a main line, namely a 0-level branch line;

determining the relative position and the included angle of the contact-1 level branch line and the contact-0 level branch line;

defining the branch line with the node on the 0-level branch line as the initial node as the 1-level branch lineA line defining a level 1 branch line in communication with other branch lines as a communication-level 1 branch line; by k_iThe value represents the location of the ith contact-1 branch relative to the 0 branch:

（1）

calculating the absolute value | α of the included angle between the ith 1-level branch and the 0-level branch_mi|

|α_mi|=π/3-π(m-1)/36，m=1、2、3…（2）

m represents the serial number of the level 1 branch line on the node, and the larger the value of m is, the smaller the value of | alpha mi | is;

calculating the actual value α of the included angle between the ith branch line of level 1 and the branch line of level 0_mi

α_mi=k_i*|α_mi|=k_i*(π/3-π(m-1)/36) ，m=1、2、3…（3）

Step four, calculating the horizontal layout of the contact-branch line;

defining the branch line which is in communication with other branch lines as a communication-branch line; setting a 0-level branch line along the positive direction of an x axis, and defining a node between a 1-level branch line and the 0-level trunk line as a source node; defining a branch line with a node with the level 1 branch line as a level 2 branch line, and defining a node between the level 1 branch line and the level 2 branch line as a level 1 node; sequentially defining 3, 4 and 5 … level branches and 3, 4 and 5 … level nodes; defining an a +1 level branch line as a lower level branch line of the a level branch line, and setting the initial distance between nodes as dis; defining the initial node coordinate of the ith a-level branch line as (x)_i，y_i) Coordinate (x) of the jth a-level node on the ith a-level branch_ij，y_ij) Comprises the following steps:

x_ij=x_i(j-1)+dis*cos(k_i*α_mi)

y_ij=y_i(j-1)+dis*sin(ki*α_mi) （4）

coordinates of each node of the three-level branch line and the branch lines above the three levels: the coordinates (x) of the initial node of the ith branch line are obtained from the coordinates of the node of the previous branch line_i，y_i) The coordinate of the jth node of the ith secondary branch line is (x)_ij，y_ij) Calculating the same formula (4);

step five, eliminating the cross among the connection lines;

defining 3 line crossing types; the first type of crossover is: the communication line between two virtual communication nodes of the same generalized switching station passes through the trunk line; the second type of crossover is: a connecting line between two virtual connecting nodes of the same generalized switching station does not pass through a main line, but is crossed with a connecting line of another switching station; the third type of crossover is: the included angles between two branch lines and a main line of the virtual connection node of the same generalized switching station are arranged in sequence from large to small, but one of the two branch lines is too long, so that the connection lines are crossed;

for the first crossing type, the positions of the 2 virtual contact switch nodes belonging to the same generalized switching station at the clockwise side and the anticlockwise side relative to the main lines of the virtual contact switch nodes are changed, so that the crossing is eliminated;

for the second type of crossing, eliminating the crossing by exchanging the serial numbers m of the branch lines of the 2 virtual contact switch nodes of different switching stations on the same trunk line;

for the third cross type, distance shortening processing is carried out through a formula (5);

dis_L=dis0-5*（L+1） （5）

dis₀equal to the set initial distance between nodes, and calculating formula (5) in a cyclic manner, L being the number of cycles, dis_LFor each loop calculated result, the result dis of each loop calculation is_LSubstituting dis calculation coordinates in a formula (4) until connecting lines of the branch lines are not crossed;

sixthly, determining the relative position and the included angle of the non-contact branch line;

defining a non-contact-1 level branch as a 1 level branch which is not in contact with other branches; by k_iThe value represents the position of the ith non-contact-1 level branch relative to the 0 level branch;

calculating the absolute value | α of the included angle between the ith non-contact-a level branch and the superior branch_niL and included angle α_ni

|α_ni|=π/3-π(n-1)/36，n=1、2、3…（6）

According to the absolute value of the included angle | α_niI determines k of the ith non-contact-a level branch_iValue and angle α_ni

α_ni=k_i*|α_ni|=k_i*(π/3-π(n-1)/36)，n=1、2、3…（7）

① n =1, | α_ni| take maximum value α_max= pi/3, when α_ni=α_maxWhen there is no branch, k of the 1 st non-contact-a level branch_i=1；

② if α_ni=α_maxThere is a branch line, α_ni=-α_maxIf no branch line exists, ki = -1 of the 1 st non-contact-a level branch line;

③ if α_ni|=α_maxWhere there are branches, then | α_niI = (| = (pi/3-pi (n-1)/36, n = 2), and repeatedly judging whether a branch line exists;

repeating the steps until all the non-contact branch lines are uniformly distributed on the two sides of the superior branch line;

step seven, calculating the horizontal layout of the non-contact-branch line;

according to the calculation method in the step 4, completing the coordinates of the non-contact-branch nodes and completing the initial horizontal layout;

step eight, completing sector splicing after rotating and zooming the sectors of the single feeder in the initial horizontal layout, and initially establishing a complete SCDN layout;

step nine, eliminating cross nodes of non-contact-branch lines;

step 9.1, numbering non-contact branch lines with cross nodes according to the distance sequence from the starting point of the branch line at the upper level, and respectively arranging a 1 st branch line, a 2 nd branch line … and the like from the starting point;

step 9.2, define kk_iiIndicating the position of the ii 2-level branch relative to the 1-level branch;

（8）

when ii is>And if it is an odd number, kk_ii=（-1）*kk_ii；

kk_iiWhen the value is 1, the first stage is at the clockwise side of the first stage branch line, and when the value is-1, the counter-clockwise side is shown;

step 9.3, determining the ii level 1 node path on the i level non-contact-1 branch_iiThe coordinates of (a);

when i is<Path 3 time, path_iiThe coordinates of (a) remain unchanged;

when i is>Path when =3_iiAngle xita _00 with main trunk line_iiComprises the following steps:

xita_00_ii=arctan((y_pathi-1(1)- y_pathi-1(dd))/ (x_pathi-1(1)- x_pathi-1(dd))),dd=2、3、4…（9）

（x_pathi-1(dd)，y_pathi-1(dd)) are the coordinates of the dd node on the i-1 th non-contact level 1 branch and on branches below level 1;

(1) when xita _00_iiWhen all are greater than 0 or all are less than 0,

（10）

(2) when xita _00_iiWhen more than 0 or less than 0 is present at the same time,

（11）

therefore, the node path on the ii level 1 branch on the ith non-contact-1 level branch_iiCoordinate (x) of_pathii，y_pathii) Comprises the following steps:

r_ii=dis*(ii-1)

（x_pathii，y_pathii）=（x_pathi-1(1)，y_pathi-1(1)）+ r_iie^j’*xita_00（12）

in the formula, r_iiIs path_iiSector radius, j, of the source node corresponding to the non-contact-1 level leg' represents an imaginary number;

step 9.4, taking the node as a forward node, wherein the nodes which are directly connected with the forward node are collectively called as the backward node; traversing successor node of ii level 1 node on non-contact level 1 leg_iTo node_iSequencing according to the number of the subsequent nodes from least to most, wherein the row with the most number of the subsequent nodes is arranged at the outermost end; the number is jj;

step 9.5, solving the node of the successor node_iThe coordinates of (a):

xita_0=arctan((y_pathii(i)- y_pathii(i-1))/( x_pathii(i)- x_pathii(i-1)))

xita_1=xita_0+kk_ii*π/180*jj （13）

r =(( y_pathii(i)- y_pathii(i-1))²+( x_pathii(i)- x_pathii(i-1))²)^1/2

(x_pathiii(jj)’, y_pathiii(jj)’)=( x_pathii(i)’, y_pathii(i)’)+r*e^j’*xita_1

the xita _0 represents the included angle between the non-contact-1 level branch line and the main trunk line; xita _1 is the jj-th node_iThe included angle of the non-contact-1 level branch line; r is a node_iThe sector radius of (a); (x)_pathiii(jj)’, y_pathiii(jj)') is the jth node_iThe coordinates of (a);

step 9.6, traverse node_iNode _ wai of_iDetermine node _ wai_iAngle xita — 22 relative to the non-contact-1 branch:

xita_22_j=arctan((y_pathii(ii+1)- y_nodei+1(j))/( x_pathii(ii+1)- x_nodei+1(j)))（14）

in the formula, a node_i+1All successors of node ii +1 of the non-contact-1 branch, j being node_i+1According to node_i+1And path_iiThe maximum included angle of (i + 1) is determined absolutely for xita _22

(1) When xita _22_jWhen all are greater than 0 or all are less than 0,

（15）

(2) when xita _22_jWhen more than 0 or less than 0 is present at the same time,

（16）

(3) when node_i+1In the absence of the presence of the agent,

xita_22=arctan((y_pathii(ii)- y_pathii(ii+1))/( x_pathii(ii)- x_pathii(ii+1))) （17）

i.e. branch line with an angle xita _22, the first two cases being with node_i+1The branch line of the middle and maximum included angles is parallel to the path in the third case_iiParallel connection;

step 9.7, solving the subsequent node _ wai_iThe coordinates of (a):

xita_2=xita_22+kk_ii*π/360*j

r =0.5*(( y_pathii(ii)- y_pathii(ii+1))²+( x_pathii(ii)- x_pathii(i+1))²)^1/2（18）

(x_{node_waii}(j)’, y_{node_waii}(j)’)=( x_nodeii(jj)’, y_nodeii(jj)’)+r*e^j’*xita_2

wherein xita _2 is a node_iThe included angle of the jth subsequent node; r is the node radius node _ wai_iRelative to node_iThe radius of (a); (x)_nodeii(jj)’，y_nodeii(jj)') jj-th node_i(x) of (C)_{node_waii}(j)’，y_{node_waii}(j) ') is node _ wai of jth_iThe coordinates of (a);

step 9.8, repeat steps 9.6 and 9.7 until node _ wai_iDoes not exist;

step ten, splicing into a complete non-cross SCDN single line diagram layout according to the rotation and zooming processing of the sectors of the single feeder in the initial layout.

Images