CN112200406B - Park power distribution network energy router access planning method and device - Google Patents
Park power distribution network energy router access planning method and device Download PDFInfo
- Publication number
- CN112200406B CN112200406B CN202010893645.8A CN202010893645A CN112200406B CN 112200406 B CN112200406 B CN 112200406B CN 202010893645 A CN202010893645 A CN 202010893645A CN 112200406 B CN112200406 B CN 112200406B
- Authority
- CN
- China
- Prior art keywords
- node
- matrix
- distribution network
- energy router
- line
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000009826 distribution Methods 0.000 title claims abstract description 75
- 238000000034 method Methods 0.000 title claims abstract description 27
- 239000011159 matrix material Substances 0.000 claims abstract description 167
- 230000035945 sensitivity Effects 0.000 claims abstract description 66
- 230000006872 improvement Effects 0.000 claims abstract description 36
- 230000005855 radiation Effects 0.000 claims abstract description 15
- 238000012163 sequencing technique Methods 0.000 claims abstract description 7
- 238000004364 calculation method Methods 0.000 claims description 24
- 238000011144 upstream manufacturing Methods 0.000 claims description 12
- 238000010276 construction Methods 0.000 claims description 8
- 230000008030 elimination Effects 0.000 claims description 3
- 238000003379 elimination reaction Methods 0.000 claims description 3
- 230000006870 function Effects 0.000 description 13
- 238000010586 diagram Methods 0.000 description 9
- 238000004590 computer program Methods 0.000 description 7
- 238000009434 installation Methods 0.000 description 4
- 238000012545 processing Methods 0.000 description 4
- 238000003860 storage Methods 0.000 description 3
- 238000009825 accumulation Methods 0.000 description 2
- 238000004891 communication Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000008569 process Effects 0.000 description 2
- 230000003044 adaptive effect Effects 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000006243 chemical reaction Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000007726 management method Methods 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000008092 positive effect Effects 0.000 description 1
- 238000011158 quantitative evaluation Methods 0.000 description 1
- 125000006850 spacer group Chemical group 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06313—Resource planning in a project environment
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0639—Performance analysis of employees; Performance analysis of enterprise or organisation operations
- G06Q10/06393—Score-carding, benchmarking or key performance indicator [KPI] analysis
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/06—Energy or water supply
-
- H—ELECTRICITY
- H02—GENERATION; CONVERSION OR DISTRIBUTION OF ELECTRIC POWER
- H02J—CIRCUIT ARRANGEMENTS OR SYSTEMS FOR SUPPLYING OR DISTRIBUTING ELECTRIC POWER; SYSTEMS FOR STORING ELECTRIC ENERGY
- H02J3/00—Circuit arrangements for ac mains or ac distribution networks
- H02J3/38—Arrangements for parallely feeding a single network by two or more generators, converters or transformers
- H02J3/46—Controlling of the sharing of output between the generators, converters, or transformers
-
- H—ELECTRICITY
- H02—GENERATION; CONVERSION OR DISTRIBUTION OF ELECTRIC POWER
- H02J—CIRCUIT ARRANGEMENTS OR SYSTEMS FOR SUPPLYING OR DISTRIBUTING ELECTRIC POWER; SYSTEMS FOR STORING ELECTRIC ENERGY
- H02J2203/00—Indexing scheme relating to details of circuit arrangements for AC mains or AC distribution networks
- H02J2203/20—Simulating, e g planning, reliability check, modelling or computer assisted design [CAD]
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- Entrepreneurship & Innovation (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- Development Economics (AREA)
- General Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- Marketing (AREA)
- Educational Administration (AREA)
- Tourism & Hospitality (AREA)
- Quality & Reliability (AREA)
- Operations Research (AREA)
- Game Theory and Decision Science (AREA)
- Health & Medical Sciences (AREA)
- Biodiversity & Conservation Biology (AREA)
- Life Sciences & Earth Sciences (AREA)
- Public Health (AREA)
- Water Supply & Treatment (AREA)
- General Health & Medical Sciences (AREA)
- Primary Health Care (AREA)
- Power Engineering (AREA)
- Supply And Distribution Of Alternating Current (AREA)
Abstract
The invention discloses a park distribution network energy router access planning method and a park distribution network energy router access planning device, wherein the acquisition comprisesNNumbering the nodes according to the topological structure of the campus radiation type power distribution network of each node; acquiring line impedance parameters of a park power distribution network; constructing an active sensitivity matrix and a reactive sensitivity matrix according to the line impedance parameters; calculating a voltage improvement index of a node in the park power distribution network according to the active sensitivity matrix and the reactive sensitivity matrix; sequencing the nodes from large to small according to the node voltage improvement degree index to obtain an energy router access priority sequence; repeating based on the energy router access priority sequenceN ER Selecting secondary access node and rejecting interval node to determineN ER An access point of an energy router is provided,N ER the number of the energy routers which need to be accessed. The invention can be used for energy pathsAnd performing balance planning by the access point of the device.
Description
Technical Field
The invention relates to the technical field of planning of a park power distribution network, in particular to a park power distribution network energy router access planning method and device.
Background
A large amount of accesses of various distributed energy sources and novel loads in a park power distribution network bring a great deal of new challenges to operation and control of the park power distribution network. The energy router, as a novel device integrating a power electronic technology and an information communication technology, can provide an alternating current/direct current interface for various novel sources and loads, complete voltage/current conversion, collect various electrical quantities in operation, actively perform power flow control, and simultaneously have a certain communication function, so that the energy router plays a key role in future power grid energy management and power control and becomes a construction basis of an energy internet.
After the energy routers are connected to the power distribution network of the park, a plurality of distributed active/reactive power sources are equivalently added in the power distribution network, the energy routers are reasonably planned and controlled, and the safety, the economy and the reliability of the operation of the power system can be improved. However, if the installation position of the energy router is not adapted to the structure of the power distribution network, not only the positive effects of the energy router cannot be fully exerted, but also negative effects such as increased line loss, voltage out-of-limit and the like can be possibly generated. Therefore, the access location must be reasonably estimated and planned.
Disclosure of Invention
Aiming at the problems in the prior art, the invention discloses a park power distribution network energy router access planning method and device, which can perform balanced planning on energy router access points and solve the problem caused by the fact that the installation position of an energy router is not adaptive to the structure of a power distribution network.
The technical scheme of the invention is as follows: a park power distribution network energy router access planning method comprises the following steps:
acquiring a topological structure of a campus radial distribution network comprising N nodes, and numbering the nodes;
acquiring line impedance parameters of a park power distribution network;
constructing an active sensitivity matrix and a reactive sensitivity matrix according to the line impedance parameters;
calculating a voltage improvement index of a node in the park power distribution network according to the active sensitivity matrix and the reactive sensitivity matrix;
sequencing the nodes from large to small according to the node voltage improvement degree index to obtain an energy router access priority sequence;
repeating N based on the energy router access priority sequenceERSelecting secondary access node and rejecting interval node to determine NERAn energy router access point, NERThe number of the energy routers which need to be accessed.
Further, the node numbering comprises the steps of:
numbering nodes at an inlet of a radiation type power distribution network, which comprise N nodes, into a node 0, and taking the node as a current numbering starting point;
selecting a current serial number starting point in the radiation type power distribution network as a line head end, selecting a tail end node of any line connected with the head end as a tail end, and selecting a branch circuit connected with the head end and the tail end as a trunk line;
nodes on the trunk line are numbered in sequence from small to big according to the sequence from the head end to the tail end;
sequentially searching whether each node on the trunk line has a branch according to the sequence of the serial numbers on the trunk line from small to large, if so, regarding the node as a new serial number starting point, and repeating the steps from the second step to the fourth step; otherwise, the next node is continuously retrieved.
Further, obtain the line impedance parameter of garden distribution network, include:
obtaining: line impedance Z between node i and its upstream nodei＝Ri+jXiWherein R isiIs the resistance value of the line impedance between node i and its upstream node, XiIs the reactance value of the line impedance between node i and its upstream node, i being 1,2,3, …, N-1.
Further, an active sensitivity matrix and a reactive sensitivity matrix are constructed according to the line impedance parameters, and the method comprises the following steps:
firstly, constructing an adjacency matrix A for expressing whether any two nodes i and j in a power distribution network are adjacent; i, j ═ 1,2,3, …, N-1;
constructing a reachable matrix M according to the adjacent matrix A;
the construction method of the reachable matrix M comprises the following steps:
M＝Binary((A+I)N-1)
wherein Binary () is the binarization function of the matrix, and the function is to set all non-0 elements in the matrix to 1 (A + I)N-1Representing the N-1 power of the sum of an adjacent matrix and an identity matrix I of the node distribution network;
thirdly, passing through impedance parameters Z of each lineiConstructing a line resistance matrix R and a line reactance matrix X;
the line resistance matrix R is an N-1 order square matrix, and the diagonal elements are R i1,2,3, …, N-1, and the remaining elements are 0;
the line reactance matrix X is an N-1 order square matrix, and the diagonal line element is XiI is 1,2,3, …, N-1, and the remaining elements are 0;
fourthly, calculating an active sensitivity matrix HRAnd a reactive sensitivity matrix HX；
The active sensitivity matrix HRThe calculation method comprises the following steps:
HR＝2MTRM
the reactive sensitivity matrix HXThe calculation method comprises the following steps:
HX＝2MTXM。
further, the method comprisesSaid voltage improvement index IiThe calculation method comprises the following steps:
wherein HR(j,i)Is a matrix HRThe element in the jth row and ith column; hX(j,i)Is a matrix HXThe element in the jth row and ith column; delta is a linear coefficient and satisfies 0<δ<1。
Further, based on the access priority sequence of the energy router, repeating NERSelecting operation of secondary access node and removing operation of interval node to determine NERAn energy router access point comprising the steps of:
calculating the number of interval nodes NRComprises the following steps:
wherein, the number N of the energy routers needing to be accessedERThe quantity is known, and N is the total number of nodes of the radiation type power distribution network;
selecting a node with the maximum voltage improvement degree in the energy router access priority sequence S, and determining the node as an energy router access node;
the energy router determined this time is accessed into the node and N which is closest to the node in electrical distanceR-1 node is removed from the sequence S and recalculated N, NERAnd NR，NERSubtracting 1 during recalculation, and continuing to perform access node selection operation and interval node elimination operation until NERDecreasing until 0.
Further, the operations of selecting the access node and rejecting the interval node are continued, which includes:
the last determined energy router access node and the N closest to the node in electrical distance are eliminatedRSelecting a node with the maximum voltage improvement degree in a sequence S after 1 node, determining the node as an energy router access node, and eliminating N closest to the node in electrical distanceR-1 pieces ofAnd (4) a node.
The utility model provides a park distribution network energy router inserts planning device, includes:
the voltage improvement index calculation module is used for acquiring a topological structure of a campus radiation type power distribution network comprising N nodes and numbering the nodes; acquiring line impedance parameters of a power distribution network in a park; constructing an active sensitivity matrix and a reactive sensitivity matrix according to the line impedance parameters; calculating a voltage improvement index of a node in the park power distribution network according to the active sensitivity matrix and the reactive sensitivity matrix;
the energy router access point determining module is used for sequencing the nodes according to the node voltage improvement degree index from large to small to obtain an energy router access priority sequence; repeating N based on the energy router access priority sequenceERSelecting operation of secondary access node and removing operation of interval node to determine NERAn energy router access point, NERThe number of the energy routers which need to be accessed.
Further, an active sensitivity matrix and a reactive sensitivity matrix are constructed according to the line impedance parameters, and the method comprises the following steps:
firstly, constructing an adjacency matrix A for expressing whether any two nodes i and j in a power distribution network are adjacent; 1,2,3, …, N-1;
secondly, constructing a reachable matrix M according to the adjacent matrix A;
the construction method of the reachable matrix M comprises the following steps:
M＝Binary((A+I)N-1)
wherein, Binary () is the Binary function of matrix, the function is to set all non-0 elements in the matrix as 1 (A + I)N-1The N-1 power of the adjacent matrix and the unit matrix I of the node distribution network is represented.
Thirdly, passing through each line impedance parameter ZiConstructing a line resistance matrix R and a line reactance matrix X;
the line resistance matrix R is an N-1 order square matrix, and the diagonal elements are R i1,2,3, …, N-1, and the remaining elements are 0;
the line reactance matrix X is an N-1 order square matrix and diagonal line elementsIs X i1,2,3, …, N-1, and the remaining elements are 0;
fourthly, calculating an active sensitivity matrix HRAnd a reactive sensitivity matrix HX；
The active sensitivity matrix HRThe calculation method comprises the following steps:
HR＝2MTRM
the reactive sensitivity matrix HXThe calculation method comprises the following steps:
HX＝2MTXM。
the voltage improvement index IiThe calculation method comprises the following steps:
wherein HR(j,i)Is a matrix HRThe element in the jth row and ith column; hX(j,i)Is a matrix HXThe element in the jth row and ith column; delta is a linear coefficient and satisfies 0<δ<1。
Further, repeating N based on the energy router access priority sequenceERSelecting secondary access node and rejecting interval node to determine NERAn energy router access point comprising the steps of:
calculating the number of interval nodes NRComprises the following steps:
wherein, the number N of the energy routers needing to be accessedERN is the total number of nodes of the radiation type power distribution network, wherein N is a known quantity;
selecting a node with the maximum voltage improvement degree in the energy router access priority sequence S, and determining the node as an energy router access node;
the energy router determined this time is accessed into the node and N which is closest to the node in electrical distanceR-1 node is removed from the sequence S and recalculated N, NERAnd NR，NERSubtracting 1 during recalculation, and continuing to perform access node selection operation and interval node elimination operation until NERDecreasing to 0.
The invention has the beneficial effects that: the invention constructs an active sensitivity matrix and a reactive sensitivity matrix, calculates a node voltage improvement degree index, sorts nodes according to the improvement degree index to obtain an energy router access priority sequence S, establishes the access income of each node by the index, namely the improvement degree index, carries out quantitative evaluation, avoids the accumulation of index virtual high nodes by using a regularization method, repeats the operation of selecting access nodes and rejecting interval nodes, ensures the balance planning of an access point of the energy router, solves the problem caused by the incompatibility of the installation position of the energy router and the structure of a power distribution network, and effectively improves the safety, the economy and the reliability of the operation of a power system.
Drawings
FIG. 1 is a block flow diagram of the present invention;
fig. 2 shows a 33-node campus radiating distribution network structure in an embodiment.
Detailed Description
The invention is further described below with reference to the accompanying drawings. The following examples are only for illustrating the technical solutions of the present invention more clearly, and the protection scope of the present invention is not limited thereby.
Example 1:
taking the 33-node (N ═ 33) campus radial distribution network shown in fig. 2 as an example, the invention is applied to access 5 energy routers (N ═ 33)ER5) planning to determine the access location.
Step 1: and acquiring a topological structure of the power distribution network of the campus containing N nodes, and numbering the nodes as 0-N-1.
The topological structure of the park power distribution network is a radiation type power distribution network, and the numbering method is as follows:
numbering nodes at an inlet of a radiation type power distribution network, which comprise N nodes, into a node 0, and taking the node as a current numbering starting point;
selecting a current serial number starting point in the radiation type power distribution network as a line head end, selecting a tail end node of any line connected with the head end as a tail end, and selecting a branch circuit connected with the head end and the tail end as a trunk line;
numbering the nodes on the trunk line from small to large in sequence from the head end to the tail end;
sequentially searching whether each node on the trunk line has a branch according to the sequence of the serial numbers on the trunk line from small to large, and if so, repeating the steps from the second step to the fourth step by taking the node as a new serial number starting point; otherwise, the next node is continuously retrieved.
The numbering results have been noted in fig. 2;
step 2: and acquiring the line impedance parameters of the park distribution network.
The line impedance parameter is a known quantity and can be directly obtained. Let Z be the line impedance value between node i (i ═ 1,2,3, …, N-1) and its upstream nodei＝Ri+jXiWherein R isiIs the resistance value, X, of the line impedance between node i and its upstream nodeiIs the reactance value of the line impedance between node i and its upstream node, j being the imaginary impedance.
The obtained line parameters are shown in Table 1
TABLE 1 line parameter Table
And 3, step 3: constructing an active sensitivity matrix H according to the line impedance parametersRAnd a reactive sensitivity matrix HXThe method comprises the following steps:
constructing an adjacency matrix A;
constructing a reachable matrix M according to the adjacent matrix A;
thirdly, passing through each line impedance parameter ZiConstructing a line resistance matrix R and a line reactance matrix X;
fourthly, calculating an active sensitivity matrix H according to the reachable matrix M, the line resistance matrix R and the line reactance matrix XRAnd a reactive sensitivity matrix HX。
The adjacency matrix A is an N-1 order square matrix and expresses whether any two nodes i and j (i and j are 1,2,3, … and N-1) in the power distribution network are adjacent (no other nodes exist between the two nodes), and the construction method of the matrix A comprises the following steps:
wherein A is(i,j)The element values in the ith row and the jth column in the matrix are represented, where 1 represents that nodes i and j are adjacent, and 0 represents that nodes i and j are not adjacent.
The construction method of the reachable matrix M comprises the following steps:
M＝Binary((A+I)N-1)
wherein, Binary () is the Binary function of matrix, the function is to set all non-0 elements in the matrix as 1 (A + I)N-1And the N-1 power of the adjacent matrix and the unit matrix I of the node distribution network is represented.
The line resistance matrix R is an N-1 order square matrix, and the diagonal elements are Ri(i ═ 1,2,3, …, N-1), the remaining elements being 0:
the line reactance matrix X is an N-1 order square matrix, and the diagonal line element is Xi(i ═ 1,2,3, …, N-1), and the remaining elements are 0:
the active sensitivity matrix HRThe calculation method comprises the following steps:
HR＝2MTRM
the reactive sensitivity matrix HXThe calculation method comprises the following steps:
HX＝2MTXM
and 4, step 4: calculating the voltage improvement index I of the nodes 1-N-1 in the power distribution network of the park according to the active sensitivity matrix and the reactive sensitivity matrixi(i＝1,2,3,…N-1)。
The voltage improvement index IiThe calculation method comprises the following steps:
wherein HR(j,i)Is a matrix HRThe element in the jth row and ith column represents the sensitivity of the voltage at the node j to the active power at the node i; hX(j,i)Is a matrix HXThe element in the jth row and ith column represents the sensitivity of the voltage at the node j to the reactive power at the node i; delta is a linear coefficient and satisfies 0<δ<1, the rated power factor of the energy router can be taken. The invention establishes that the indexes quantitatively evaluate the access benefits, namely the improvement indexes of each node, and avoids the accumulation of the virtual high nodes of the indexes by using a regularization method (the regularization method is the content in brackets of the above index formula).
The calculation results of this example are shown in table 2, taking the coefficient δ as 0.8.
TABLE 2 calculation of Voltage improvement
And 5: according to the node voltage improvement index IiAnd sequencing the N-1 nodes from large to small to obtain an energy router access priority sequence S.
The sequence S obtained by sorting in this example is shown in table 3.
Table 3 energy router access priority sequence S
Step 6: acquiring the number N of energy routers needing to be accessedERCalculating the number of interval nodes NR。
The number N of the energy routers needing to be accessedERIn order to be of a known quantity,number of spacer nodes NRThe calculation method comprises the following steps:
in this example, N is 33, NER＝5，NR＝(33－1)/5＝6。
And 7: repeating N based on an energy router access priority sequence SERSelecting operation of secondary access node and removing operation of interval node to determine NERAn energy router access point.
The access node selection operation and the interval node removing operation are as follows:
firstly, selecting a node with the maximum voltage improvement degree in the current energy router access priority sequence S, namely a first node in the current sequence S, and determining the node as an energy router access node.
Connecting the determined energy router to the node and N which is closest to the node in electrical distanceR-1 node is removed from the sequence S and recalculated N, NERAnd NRFor the next reject operation; n is a radical ofER Subtracting 1 upon recalculation;
the determination process in this embodiment is shown in table 4.
Table 4 energy router access point determination procedure
Finally, in embodiment 1, it is determined that the nodes 17, 11, 32, 26, and 24 are energy router access points according to the present invention.
The invention ensures the balance planning of the access points of the energy routers, solves the problem caused by the incompatibility of the installation positions of the energy routers and the structure of the power distribution network, and effectively improves the safety, the economy and the reliability of the operation of a power system.
Example 2:
an access planning device for a park distribution network energy router comprises:
the voltage improvement degree index calculation module is used for acquiring a topological structure of a campus radial distribution network comprising N nodes and numbering the nodes; acquiring line impedance parameters of a power distribution network in a park; constructing an active sensitivity matrix and a reactive sensitivity matrix according to the line impedance parameters; calculating a voltage improvement index of a node in the park power distribution network according to the active sensitivity matrix and the reactive sensitivity matrix;
the energy router access point determining module is used for sequencing the nodes according to the node voltage improvement degree index from large to small to obtain an energy router access priority sequence; repeating N based on the energy router access priority sequenceERSelecting secondary access node and rejecting interval node to determine NERAn energy router access point, NERThe number of the energy routers which need to be accessed.
Further, an active sensitivity matrix and a reactive sensitivity matrix are constructed according to the line impedance parameters, and the method comprises the following steps:
firstly, constructing an adjacency matrix A for expressing whether any two nodes i, j in a power distribution network are adjacent; 1,2,3, …, N-1;
constructing a reachable matrix M according to the adjacent matrix A;
the construction method of the reachable matrix M comprises the following steps:
M＝Binary((A+I)N-1)
wherein Binary () is the binarization function of the matrix, and the function is to set all non-0 elements in the matrix to 1 (A + I)N-1The N-1 power of the adjacent matrix and the unit matrix I of the node distribution network is represented.
Thirdly, passing through each line impedance parameter ZiConstructing a line resistance matrix R and a line reactance matrix X;
the line resistance matrix R is an N-1 order square matrix, and the diagonal elements are R i1,2,3, …, N-1, and the remaining elements are 0;
the line reactance matrix X is an N-1 order square matrix, and the diagonal line elements are XiI is 1,2,3, …, N-1, and the remaining elements are 0;
fourthly, calculating an active sensitivity matrix HRAnd a reactive sensitivity matrix HX；
The active sensitivity matrix HRThe calculation method comprises the following steps:
HR＝2MTRM
the reactive sensitivity matrix HXThe calculation method comprises the following steps:
HX＝2MTXM。
the voltage improvement index IiThe calculation method comprises the following steps:
wherein HR(j,i)Is a matrix HRThe element in the jth row and ith column; hX(j,i)Is a matrix HXThe element in the jth row and ith column; delta is a linear coefficient and satisfies 0<δ<1。
Further, based on the access priority sequence of the energy router, repeating NERSelecting secondary access node and rejecting interval node to determine NERAn energy router access point comprising the steps of:
calculating the number of interval nodes NRComprises the following steps:
wherein, the number N of the energy routers needing to be accessedERN is the total number of nodes of the radiation type power distribution network, wherein N is a known quantity;
selecting a node with the maximum voltage improvement degree in the energy router access priority sequence S, and determining the node as an energy router access node;
the energy router determined this time is accessed into the node and N which is closest to the node in electrical distanceR-1 node is removed from the sequence S and recalculated N, NERAnd NR，NERSubtracting 1 when recalculating, proceeding with the access nodeSelecting operation and interval node eliminating operation till NERDecreasing until 0.
As will be appreciated by one skilled in the art, embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the application. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
The above description is only a preferred embodiment of the present invention, and it should be noted that, for those skilled in the art, several modifications and variations can be made without departing from the technical principle of the present invention, and these modifications and variations should also be regarded as the protection scope of the present invention.
Claims (6)
1. A park distribution network energy router access planning method is characterized by comprising the following steps:
acquiring a topological structure of a campus radial distribution network comprising N nodes, and numbering the nodes;
acquiring line impedance parameters of a power distribution network in a park;
constructing an active sensitivity matrix and a reactive sensitivity matrix according to the line impedance parameters;
calculating a voltage improvement degree index of a node in the power distribution network of the park according to the active sensitivity matrix and the reactive sensitivity matrix;
sequencing the nodes from large to small according to the node voltage improvement degree index to obtain an energy router access priority sequence;
repeating N based on the energy router access priority sequenceERSelecting operation of secondary access node and removing operation of interval node to determine NERAn energy router access point, NERThe number of the energy routers needing to be accessed is set;
the method for acquiring the line impedance parameters of the park distribution network comprises the following steps:
obtaining: line impedance Z between node i and its upstream nodei＝Ri+jXiWherein R isiIs the resistance value, X, of the line impedance between node i and its upstream nodeiIs the reactance value of the line impedance between node i and its upstream node, i ═ 1,2,3, …, N-1;
the method for constructing the active sensitivity matrix and the reactive sensitivity matrix according to the line impedance parameters comprises the following steps:
firstly, constructing an adjacency matrix A for expressing whether any two nodes i and j in a power distribution network are adjacent; 1,2,3, …, N-1;
secondly, constructing a reachable matrix M according to the adjacent matrix A;
the construction method of the reachable matrix M comprises the following steps:
M＝Binary((A+I)N-1)
wherein, Binary () is the Binary function of the matrix, which is used to set all the non-0 elements in the matrix as 1 (A + I)N-1Representing the N-1 power of the sum of an adjacent matrix and an identity matrix I of the node distribution network;
thirdly, passing through impedance parameters Z of each lineiConstructing a line resistance matrix R and a line reactance matrix X;
the line resistance matrix R is an N-1 order square matrix, and the diagonal elements are RiI is 1,2,3, …, N-1, and the remaining elements are 0;
the line reactance matrix X is an N-1 order square matrix, and the diagonal line element is Xi1,2,3, …, N-1, and the remaining elements are 0;
fourthly, calculating an active sensitivity matrix HRAnd a reactive sensitivity matrix HX；
The active sensitivity matrix HRThe calculation method comprises the following steps:
HR＝2MTRM
the reactive sensitivity matrix HXThe calculation method comprises the following steps:
HX＝2MTXM；
the voltage improvement index IiThe calculation method comprises the following steps:
wherein HR(j,i)Is a matrix HRThe element in the jth row and ith column; hX(j,i)Is a matrix HXThe element in the jth row and ith column; delta is a linear coefficient and satisfies 0<δ<1。
2. The park distribution network energy router access planning method according to claim 1, wherein the node numbering comprises the steps of:
numbering nodes at an inlet of a radiation type power distribution network comprising N nodes as a node 0, and taking the node as a current numbering starting point;
selecting a current serial number starting point in the radiation type power distribution network as a line head end, selecting a tail end node of any line connected with the head end as a tail end, and selecting a branch circuit connected with the head end and the tail end as a trunk line;
numbering the nodes on the trunk line from small to large in sequence from the head end to the tail end;
sequentially searching whether each node on the trunk line has a branch according to the sequence of the serial numbers on the trunk line from small to large, if so, regarding the node as a new serial number starting point, and repeating the steps from the second step to the fourth step; otherwise, the next node is continuously retrieved.
3. The park distribution network energy router access planning method of claim 1, wherein N is repeated based on an energy router access priority sequenceERSelecting secondary access node and rejecting interval node to determine NERAn energy router access point comprising the steps of:
calculating the number of interval nodes NRComprises the following steps:
wherein, the number N of the energy routers needing to be accessedERThe quantity is known, and N is the total number of nodes of the radiation type power distribution network;
selecting a node with the maximum voltage improvement degree in the energy router access priority sequence S, and determining the node as an energy router access node;
the energy router determined this time is accessed into the node and N which is closest to the node in electrical distanceR-1 node is removed from the sequence S and recalculated N, NERAnd NR，NERSubtracting 1 when recalculating and continuing to connectSelecting the node and eliminating the interval node until NERDecreasing until 0.
4. The park power distribution network energy router access planning method according to claim 3, wherein the operations of access node selection and interval node removal are continued, and comprise:
the last determined energy router access node and the N closest to the node in electrical distance are eliminatedRSelecting a node with the maximum voltage improvement degree in a sequence S after 1 node, determining the node as an energy router access node, and eliminating N closest to the node in electrical distanceR-1 node.
5. The utility model provides a park distribution network energy router inserts planning device which characterized in that includes:
the voltage improvement index calculation module is used for acquiring a topological structure of a campus radiation type power distribution network comprising N nodes and numbering the nodes; acquiring line impedance parameters of a power distribution network in a park; constructing an active sensitivity matrix and a reactive sensitivity matrix according to the line impedance parameters; calculating a voltage improvement degree index of a node in the power distribution network of the park according to the active sensitivity matrix and the reactive sensitivity matrix;
the energy router access point determining module is used for sequencing the nodes according to the node voltage improvement degree index from large to small to obtain an energy router access priority sequence; repeating N based on the energy router access priority sequenceERSelecting operation of secondary access node and removing operation of interval node to determine NERAn energy router access point, NERThe number of the energy routers needing to be accessed is set;
the method for acquiring the line impedance parameters of the park distribution network comprises the following steps:
obtaining: line impedance Z between node i and its upstream nodei＝Ri+jXiWherein R isiIs the resistance value, X, of the line impedance between node i and its upstream nodeiIs a line impedance between node i and its upstream nodeReactance value of reactance, i ═ 1,2,3, …, N-1;
and constructing an active sensitivity matrix and a reactive sensitivity matrix according to the line impedance parameters, comprising the following steps:
firstly, constructing an adjacency matrix A for expressing whether any two nodes i and j in a power distribution network are adjacent; 1,2,3, …, N-1;
constructing a reachable matrix M according to the adjacent matrix A;
the construction method of the reachable matrix M comprises the following steps:
M＝Binary((A+I)N-1)
wherein Binary () is the binarization function of the matrix, and is used for setting all non-0 elements in the matrix to be 1 (A + I)N-1Representing the N-1 power of an adjacent matrix and an identity matrix I sum of a node distribution network;
thirdly, passing through impedance parameters Z of each lineiConstructing a line resistance matrix R and a line reactance matrix X;
the line resistance matrix R is an N-1 order square matrix, and the diagonal elements are Ri1,2,3, …, N-1, and the remaining elements are 0;
the line reactance matrix X is an N-1 order square matrix, and the diagonal line elements are XiI is 1,2,3, …, N-1, and the remaining elements are 0;
fourthly, calculating an active sensitivity matrix HRAnd a reactive sensitivity matrix HX；
The active sensitivity matrix HRThe calculation method comprises the following steps:
HR＝2MTRM
the reactive sensitivity matrix HXThe calculation method comprises the following steps:
HX＝2MTXM
the voltage improvement index IiThe calculation method comprises the following steps:
wherein HR(j,i)Is a matrix HRThe element in the jth row and ith column; hX(j,i)Is a matrix HXThe element in the jth row and ith column; delta is a linear coefficient and satisfies 0<δ<1。
6. The park distribution network energy router access planning device of claim 5, wherein N is repeated based on an energy router access priority sequenceERSelecting operation of secondary access node and removing operation of interval node to determine NERAn energy router access point comprising the steps of:
calculating the number of interval nodes NRComprises the following steps:
wherein, the number N of the energy routers needing to be accessedERN is the total number of nodes of the radiation type power distribution network, wherein N is a known quantity;
selecting a node with the maximum voltage improvement degree in the energy router access priority sequence S, and determining the node as an energy router access node;
the energy router determined this time is accessed into the node and N which is closest to the node in electrical distanceR-1 node is removed from the sequence S and recalculated N, NERAnd NR，NERSubtracting 1 during recalculation, and continuing to perform access node selection operation and interval node elimination operation until NERDecreasing until 0.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010893645.8A CN112200406B (en) | 2020-08-31 | 2020-08-31 | Park power distribution network energy router access planning method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010893645.8A CN112200406B (en) | 2020-08-31 | 2020-08-31 | Park power distribution network energy router access planning method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112200406A CN112200406A (en) | 2021-01-08 |
| CN112200406B true CN112200406B (en) | 2022-07-22 |
Family
ID=74005415
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010893645.8A Active CN112200406B (en) | 2020-08-31 | 2020-08-31 | Park power distribution network energy router access planning method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112200406B (en) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105006838A (en) * | 2015-07-24 | 2015-10-28 | 合肥工业大学 | Impedance-self-adaptive inverter reactive voltage control parameter optimization method |
| CN110086167A (en) * | 2019-04-04 | 2019-08-02 | 国网浙江省电力有限公司电力科学研究院 | A kind of alternating current-direct current mixed connection power distribution network self-healing control system and control method |
| CN110752594A (en) * | 2019-08-28 | 2020-02-04 | 南京理工大学 | Power distribution network path optimization method based on improved aggregation hierarchical clustering method |
-
2020
- 2020-08-31 CN CN202010893645.8A patent/CN112200406B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105006838A (en) * | 2015-07-24 | 2015-10-28 | 合肥工业大学 | Impedance-self-adaptive inverter reactive voltage control parameter optimization method |
| CN110086167A (en) * | 2019-04-04 | 2019-08-02 | 国网浙江省电力有限公司电力科学研究院 | A kind of alternating current-direct current mixed connection power distribution network self-healing control system and control method |
| CN110752594A (en) * | 2019-08-28 | 2020-02-04 | 南京理工大学 | Power distribution network path optimization method based on improved aggregation hierarchical clustering method |
Non-Patent Citations (6)
| Title |
|---|
| Graph theory based topology design and energy routing control of the energy internet;Hui Guo 等;《IET Journals》;20181202;第4507-4514页 * |
| Optimal operation of AC–DC distribution network with multi park integrated energy subnetworks considering flexibility;Qi Geng 等;《IET Journals》;20200213;第1004-1019页 * |
| Topology detection in power distribution system using kernel-node-map deep networks;Mengmeng Xiao 等;《IET Journals》;20200722;第4033-4041页 * |
| 电能路由器在交直流配电网中的优化与研究;安祥等;《电子世界》;20160723(第14期);第111-113页 * |
| 能量路由器对于配电网运行优化的影响分析;苗键强等;《中国电机工程学报》;20170520(第10期);第2853-2859页 * |
| 计及网络拓扑下微电网有功调节对电压控制的适应性分析;张忠等;《电力自动化设备》;20170430(第04期);第22-29页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112200406A (en) | 2021-01-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107591800B (en) | Method for predicting running state of power distribution network with distributed power supply based on scene analysis | |
| CN105718493B (en) | Search result ordering method and its device based on decision tree | |
| CN106168797B (en) | A kind of method that modularization obtains the useful item failure probability of nuclear power station fault tree | |
| CN112287605B (en) | Power flow checking method based on graph convolution network acceleration | |
| CN113300367B (en) | Online rapid identification method for key section of power grid and power transmission limit making method and device | |
| CN111126055A (en) | Power grid equipment name matching method and system | |
| CN112200406B (en) | Park power distribution network energy router access planning method and device | |
| CN112883704B (en) | Big data similar text duplicate removal preprocessing method and device and terminal equipment | |
| CN113094899B (en) | Random power flow calculation method and device, electronic equipment and storage medium | |
| CN116930667A (en) | Method, device, equipment and storage medium for testing edge of power grid of transformer area | |
| CN112967154B (en) | Assessment method and device for Well-rolling of power system | |
| CN117076967A (en) | District topology correction method and system based on theoretical line loss data calculation | |
| CN110728299A (en) | Multi-extreme learning machine-based transient stability hierarchical evaluation method after power system fault | |
| CN116070958A (en) | Attribution analysis method, attribution analysis device, electronic equipment and storage medium | |
| CN115345540A (en) | One-dimensional blanking processing method, system, equipment and storage medium | |
| CN112989129B (en) | Power transmission network key perception section identification method and system based on graph theory | |
| CN114970165A (en) | Digital entity automatic modeling method, system and equipment for cable in bridge | |
| CN109447490B (en) | User address-based abnormal change relation discrimination method | |
| CN117911195B (en) | Asynchronous motor cluster equivalent model parameter identification method and device | |
| CN110323743B (en) | Clustering method and device for transient power angle stability evaluation historical data | |
| CN114156864B (en) | Photovoltaic inverter configuration method, device, terminal and storage medium | |
| CN110086209B (en) | Method and device for determining running state of power system | |
| CN118330319B (en) | Phase identification method, system, equipment and medium for trunk low-voltage distribution transformer area | |
| CN107134779B (en) | Automatic selection method and device for power distribution network power flow algorithm | |
| CN117057227A (en) | Equivalent modeling method and related device for photovoltaic power station |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |