CN102447254A - Tidal current method of annular distribution network based on compensating current - Google Patents

Tidal current method of annular distribution network based on compensating current Download PDF

Info

Publication number
CN102447254A
CN102447254A CN2010105010622A CN201010501062A CN102447254A CN 102447254 A CN102447254 A CN 102447254A CN 2010105010622 A CN2010105010622 A CN 2010105010622A CN 201010501062 A CN201010501062 A CN 201010501062A CN 102447254 A CN102447254 A CN 102447254A
Authority
CN
China
Prior art keywords
branch
node
radius
current
voltage
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.)
Pending
Application number
CN2010105010622A
Other languages
Chinese (zh)
Inventor
张建兴
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Jiangsu Fangcheng Electric Science and Technology Co Ltd
Original Assignee
Jiangsu Fangcheng Electric Science and Technology Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Jiangsu Fangcheng Electric Science and Technology Co Ltd filed Critical Jiangsu Fangcheng Electric Science and Technology Co Ltd
Priority to CN2010105010622A priority Critical patent/CN102447254A/en
Publication of CN102447254A publication Critical patent/CN102447254A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02EREDUCTION OF GREENHOUSE GAS [GHG] EMISSIONS, RELATED TO ENERGY GENERATION, TRANSMISSION OR DISTRIBUTION
    • Y02E60/00Enabling technologies; Technologies with a potential or indirect contribution to GHG emissions mitigation

Abstract

The invention relates to a tidal current method of an annular distribution network based on compensating current. According to the method, the tree branch and the link branch of an annular distribution network are firstly analyzed, then the problem of tidal current is solved by two-layer iteration, purely radial network tidal current comprising the tree branch is calculated by using a forward/backward iterative method in inner-layer iteration, and the injection current of nodes at both ends of the link branch is continuously corrected in outer-layer iteration so as to achieve global convergence. The tidal current method of the annular distribution network based on the compensating current, which is disclosed by the invention, has the advantages of simple algorithm and little iteration times.

Description

Based on offset current cyclic ligand electric network swim method
Technical field
The present invention relates to a kind ofly, belong to the power system analysis computing field based on offset current cyclic ligand electric network swim method.
Background technology
In the power distribution network advanced applied software; Trend is calculated and is provided the most important software to dispatcher and staff planners; Be used to analyze distribution network electric state and the inspection scope etc. of crossing the border; Simultaneously, it also is the basic software that distribution network is analyzed, and is used for voltage/idle work optimization, operation simulation and tie lines mutation analysis etc.
Distribution network has the distinguishing feature that is different from electric power transmission network: 1) power distribution network is the radiation structure basically, or near radial network configuration (weak ring structure); 2) branch road parameter r and x are more or less the same, sometimes in addition r can appear the situation of x; 3) three-phase branch road parameter unbalance and three-phase load asymmetry problem are more outstanding.These characteristics of distribution network cause and concerning traditional power flow algorithm, in fact belong to ill-condition; For example: because power distribution network branch road parameter r/x ratio is bigger; Make effective algorithm in grid originally, as separating lotus root method etc., no longer valid in power distribution network fast; Secondly; Because asymmetric element in the power distribution network; Like the existence of the transmission line of untransposition, three-phase three core limb transformers, electric locomotive load and other three-phase asymmetric load, the three-phase voltage, electric current that makes power distribution network be symmetry no longer, thereby can not be as symmetrical system; Only calculate single-phase situation, calculate and must carry out the three-phase trend.Therefore, distribution power system load flow calculation must adopt be different from power transmission network and suitable power distribution network characteristics, effectively, tidal current computing method that robustness is good.
Present radial network configuration under the power distribution network normal condition, but under some special operational mode, (handle and network reconfiguration), the looped network operation of short time may occur,, thereby present " weak ring " phenomenon because the quantity of ring is few like fault.Three-phase trend commonly used is at present calculated and can be divided into impedance loop method, preceding pushing back for method.The impedance loop method that S.K Goswami and S.K Basu proposed in 1991 is variable with the loop current; Form a loop from the feeder line root node to each load point; According to Kirchhoff's second law; The row loop current equation, it is stronger that this method is handled the mesh ability, but node and branch number dealing with complicated.Before push back for method at first from the hand computation algorithm development; When being used for carrying out Power flow calculation for radial distribution networks; The efficient of this algorithm is the highest in all algorithms, committed memory also seldom, the preceding Dai Fa of pushing back since self advantage updated and be applied to and produced in the reality abroad; Its shortcoming is when being applied to loop network, then need carry out particular processing.
Summary of the invention
The objective of the invention is to overcome above-mentioned deficiency, provide that a kind of algorithm is simple, iterations is few based on offset current cyclic ligand electric network swim method.
The objective of the invention is to realize like this: a kind of based on offset current cyclic ligand electric network swim method, said method step is:
Step (1): said distribution power system load flow calculation machine obtains the network parameter of power distribution network from the power distribution network management system, comprising: the no-load voltage ratio and the impedance of each branch road of feeder line number, first node serial number, end-node numbering, series resistance, series reactance, shunt conductance, shunt susceptance and transformer.
Step (2): form the power distribution network branch and connect branch.
Step (2.1): travel through said each switch, feeder line, transformer, capacitor and each node of load ports, the node that links together switch or the disconnecting link through closure in the electrical network calls to calculate use node, has the branch road of transformer, feeder line formation to be called the limit.
Step (2.2): initialization storehouse heap, put integer radius for enough big number, root node is pressed among the heap, the radius of putting root node is 0, initialization branch set spanningTreeEdges.
Step (2.3): heap be empty or heap in the radius of radius minimum node less than radius, withdraw from step (2), otherwise change next step.
Step (2.4): in heap, eject the minimum node of radius, be made as node, the limit that traversal links to each other with node; If this limit is edge, establishing another node that links to each other with edge is node2, if node2 did not also handle; The radius of putting node2 adds 1 for the node radius; Edge is joined among the branch set spanningTreeEdges, node2 is pressed among the storehouse heap, if node2 had handled and the node2 radius adds 1 greater than the node radius; The radius of then putting node2 adds 1 for the node radius, and edge is joined among the branch set spanningTreeEdges.
Step (2.5): forward step (2.3) to.
Step (2.6): all branch roads outside the spanningTreeEdges are put into even branch set.
Step (3): travel through all and connect branch, a virtual constant current load is set having to connect on the node that branch links to each other, current value is changed to 0.
Step (4): putting each node voltage initial voltage is rated voltage.
Step (5): calculate each node voltage and branch current to pushing back for method before the radial network use of forming by branch.
Step (6): put maximum deviation delta for infinitely great.
Step (7): travel through all and connect branch, establish the current branch that connects and be branch, branch two end nodes are n1 and n2; The last virtual constant current load load1 of n1, the last virtual constant current load of n2 is load2, takes out the voltage v1 and the v2 at branch two ends in the result of calculation that step 5 obtains; If the branch impedance matrix is z, utilize formula z*I=v1-v2, calculate branch current I; If the load1 current value is Iload1, the load2 current value is Iload2, if delta is < max (abs (Iload1-I); Abs (Iload2+I)), put delta=max (abs (Iload1-I), abs (Iload2+I)).
Step (8): if delta ε, and wherein ε is an enough little constant that pre-sets, output node voltage and branch current calculate and finish.
Step (9): travel through all even branches, establish the current branch that connects and be branch, branch two end nodes are n1 and n2, and the current value that renewal n1 goes up virtual constant current load is I, and the current value of the last virtual constant current load of n2 is-I.
Step (10): use step (5) to calculate each node voltage of gained and be initial value.
Step (11): forward step (5) to.
The invention has the beneficial effects as follows:
In order to calculate the trend of ring-type power distribution network, the present invention proposes a kind of based on offset current cyclic ligand electric network swim method.This method at first analyzes the branch of cyclic ligand electric network and connects branch; Then solve the trend problem through two-layer iteration; The internal layer iteration is calculated the pure radial network trend of being made up of branch with former generation offspring method; The external iteration constantly injection current of the company's of correction branch two end nodes reaches global convergence, has the advantage that algorithm is simple, iterations is few.
Description of drawings
Fig. 1 is the flow chart that the present invention is based on offset current cyclic ligand electric network swim method.
Fig. 2 is the structural representation of ring-type test power distribution network of the present invention.
Fig. 3 is the branch part-structure sketch map of ring-type test power distribution network of the present invention.
Fig. 4 is the partial structurtes sketch map of radial distribution networks.
Embodiment
Referring to Fig. 1, the present invention relates to a kind ofly based on offset current cyclic ligand electric network swim method, said method step is:
Step (1): said distribution power system load flow calculation machine obtains the network parameter of power distribution network from the power distribution network management system, comprising: the no-load voltage ratio and the impedance of each branch road of feeder line number, first node serial number, end-node numbering, series resistance, series reactance, shunt conductance, shunt susceptance and transformer.
Step (2): form the power distribution network branch and connect branch.
Step (2.1): travel through said each switch, feeder line, transformer, capacitor and each node of load ports, the node that links together switch or the disconnecting link through closure in the electrical network calls to calculate use node, has the branch road of transformer, feeder line formation to be called the limit.
Step (2.2): initialization storehouse heap, put integer radius for enough big number, root node is pressed among the heap, the radius of putting root node is 0, initialization branch set spanningTreeEdges.
Step (2.3): heap be empty or heap in the radius of radius minimum node less than radius, withdraw from step (2), otherwise change next step.
Step (2.4): in heap, eject the minimum node of radius, be made as node, the limit that traversal links to each other with node; If this limit is edge, establishing another node that links to each other with edge is node2, if node2 did not also handle; The radius of putting node2 adds 1 for the node radius; Edge is joined among the branch set spanningTreeEdges, node2 is pressed among the storehouse heap, if node2 had handled and the node2 radius adds 1 greater than the node radius; The radius of then putting node2 adds 1 for the node radius, and edge is joined among the branch set spanningTreeEdges.
Step (2.5): forward step (2.3) to.
Step (2.6): all branch roads outside the spanningTreeEdges are put into even branch set.
Step (3): travel through all and connect branch, a virtual constant current load is set having to connect on the node that branch links to each other, current value is changed to 0.
Step (4): putting each node voltage initial voltage is rated voltage.
Step (5): calculate each node voltage and branch current to pushing back for method before the radial network use of forming by branch.
Step (6): put maximum deviation delta for infinitely great.
Step (7): travel through all and connect branch, establish the current branch that connects and be branch, branch two end nodes are n1 and n2; The last virtual constant current load load1 of n1, the last virtual constant current load of n2 is load2, takes out the voltage v1 and the v2 at branch two ends in the result of calculation that step 5 obtains; If the branch impedance matrix is z, utilize formula z*I=v1-v2, calculate branch current I; If the load1 current value is Iload1, the load2 current value is Iload2, if delta is < max (abs (Iload1-I); Abs (Iload2+I)), put delta=max (abs (Iload1-I), abs (Iload2+I)).
Step (8): if delta ε, and wherein ε is an enough little constant that pre-sets, output node voltage and branch current calculate and finish.
Step (9): travel through all even branches, establish the current branch that connects and be branch, branch two end nodes are n1 and n2, and the current value that renewal n1 goes up virtual constant current load is I, and the current value of the last virtual constant current load of n2 is-I.
Step (10): use step (5) to calculate each node voltage of gained and be initial value.
Step (11): forward step (5) to.
Ring-type test power distribution network with shown in Figure 2 is an example, and concrete steps are explained as follows:
Step 1: initialization;
Said distribution power system load flow calculation machine obtains the network parameter of power distribution network from the power distribution network management system, comprising: the no-load voltage ratio and the impedance of each branch road of feeder line number, first node serial number, end-node numbering, series resistance, series reactance, shunt conductance, shunt susceptance and transformer.
Step 2: form branch and connect branch;
According in claims shown in the step 2, test macro node processing order is as shown in table 1 with the order of branch formation, and is as shown in Figure 2 by the radial network that branch is formed.
According to the node processing order, node is renumberd, the new and old numbering table of comparisons is seen table 2.In the following steps as do not have and to indicate especially and all use new node number.
Figure 219823DEST_PATH_IMAGE001
Step 3: initializing variable;
Put maximum deviation delta for infinitely great, establish ε 1=1e-5, ε 2=1e-5 establishes the node voltage vector:
?
Figure 194482DEST_PATH_IMAGE003
?
Put the rated voltage of v for each node.
At node 9,5, add virtual constant current load on 4,7,8,12,10,14, putting virtual constant current load current value is 0.
Step 4: internal layer iteration;
Step (4.1): delta whether<ε 1If then forward step 6 to.
Step (4.2): put maximum deviation σ for infinitely great.
Step (4.3): σ whether<ε 2If then forward step 5 to.
Step (4.4): the injection current according to v calculates each node is made as:
? ?
Step (4.5): the positive direction of rated current is to flow to the big node of node serial number from the less node of node serial number.For the node that is numbered k, suppose to have p+1 node to be attached thereto, p node serial number wherein arranged less than k, node serial number is respectively o1, o2 ..., op, node serial number are that j is the father node of node k, see Fig. 4.The electric current that flows to k from node j is:
?
Figure 990717DEST_PATH_IMAGE005
?
According to node serial number big preceding, node serial number little after order, travel through each node, calculate the electric current on every branch road according to following formula.
Step (4.5): known from node j flow to node k electric current is
Figure 650237DEST_PATH_IMAGE006
, according to the voltage of computes node k:
?
Figure 763687DEST_PATH_IMAGE007
?
Wherein z is the impedance matrix of branch road j-k.If upgrading front nodal point k voltage calculated value is vk0; If the absolute value of the difference of calculating gained vk and vk0 is then put
Figure 688917DEST_PATH_IMAGE008
greater than σ in this step.
According to node serial number little preceding, node serial number big after order, travel through each node, upgrade knot vector v.Forward step 4.3 to.
Step 5: upgrade the current value that connects virtual constant current load on branch two end nodes.
For connecting branch j-k, it is vj and vk that step 4 has been calculated two end nodes, according to following formula
?
Figure 850908DEST_PATH_IMAGE007
?
Current i jk on the branch j-k of the company of calculating, more the current value of the upward virtual constant current load of new node j is ijk, the current value that node k goes up virtual constant current load is-ijk.If connecting a j-k calculated value before upgrading is ijk0; If the absolute value of the difference of calculating gained ijk and ijk0 is then put
Figure DEST_PATH_IMAGE009
greater than delta in this step.
Travel through all and connect branch, more new node 9,5, and the current value of virtual constant current load forwards step 4 on 4,7,8,12,10,14;
Step 6: output result;
With calculating gained node voltage and branch current output in the step 4, calculate and finish.

Claims (1)

1. one kind based on offset current cyclic ligand electric network swim method, and it is characterized in that: said method step is:
Step (1): said distribution power system load flow calculation machine obtains the network parameter of power distribution network from the power distribution network management system, comprising: the no-load voltage ratio and the impedance of each branch road of feeder line number, first node serial number, end-node numbering, series resistance, series reactance, shunt conductance, shunt susceptance and transformer;
Step (2): form the power distribution network branch and connect branch;
Step (2.1): travel through said each switch, feeder line, transformer, capacitor and each node of load ports, the node that links together switch or the disconnecting link through closure in the electrical network calls to calculate use node, has the branch road of transformer, feeder line formation to be called the limit;
Step (2.2): initialization storehouse heap, put integer radius for enough big number, root node is pressed among the heap, the radius of putting root node is 0, initialization branch set spanningTreeEdges;
Step (2.3): heap be empty or heap in the radius of radius minimum node less than radius, withdraw from step (2), otherwise change next step;
Step (2.4): in heap, eject the minimum node of radius, be made as node, the limit that traversal links to each other with node; If this limit is edge, establishing another node that links to each other with edge is node2, if node2 did not also handle; The radius of putting node2 adds 1 for the node radius; Edge is joined among the branch set spanningTreeEdges, node2 is pressed among the storehouse heap, if node2 had handled and the node2 radius adds 1 greater than the node radius; The radius of then putting node2 adds 1 for the node radius, and edge is joined among the branch set spanningTreeEdges;
Step (2.5): forward step (2.3) to;
Step (2.6): all branch roads outside the spanningTreeEdges are put into even branch set;
Step (3): travel through all and connect branch, a virtual constant current load is set having to connect on the node that branch links to each other, current value is changed to 0;
Step (4): putting each node voltage initial voltage is rated voltage;
Step (5): calculate each node voltage and branch current to pushing back for method before the radial network use of forming by branch;
Step (6): put maximum deviation delta for infinitely great,
Step (7): travel through all and connect branch, establish the current branch that connects and be branch, branch two end nodes are n1 and n2; The last virtual constant current load load1 of n1, the last virtual constant current load of n2 is load2, takes out the voltage v1 and the v2 at branch two ends in the result of calculation that step 5 obtains; If the branch impedance matrix is z, utilize formula z*I=v1-v2, calculate branch current I; If the load1 current value is Iload1, the load2 current value is Iload2, if delta is < max (abs (Iload1-I); Abs (Iload2+I)), put delta=max (abs (Iload1-I), abs (Iload2+I));
Step (8): if delta ε, and wherein ε is an enough little constant that pre-sets, output node voltage and branch current calculate and finish;
Step (9): travel through all even branches, establish the current branch that connects and be branch, branch two end nodes are n1 and n2, and the current value that renewal n1 goes up virtual constant current load is I, and the current value of the last virtual constant current load of n2 is-I;
Step (10): use step (5) to calculate each node voltage of gained and be initial value;
Step (11): forward step (5) to.
CN2010105010622A 2010-10-09 2010-10-09 Tidal current method of annular distribution network based on compensating current Pending CN102447254A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN2010105010622A CN102447254A (en) 2010-10-09 2010-10-09 Tidal current method of annular distribution network based on compensating current

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN2010105010622A CN102447254A (en) 2010-10-09 2010-10-09 Tidal current method of annular distribution network based on compensating current

Publications (1)

Publication Number Publication Date
CN102447254A true CN102447254A (en) 2012-05-09

Family

ID=46009481

Family Applications (1)

Application Number Title Priority Date Filing Date
CN2010105010622A Pending CN102447254A (en) 2010-10-09 2010-10-09 Tidal current method of annular distribution network based on compensating current

Country Status (1)

Country Link
CN (1) CN102447254A (en)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107769214A (en) * 2017-11-14 2018-03-06 国网江苏省电力公司江阴市供电公司 Low-voltage administers switching power flow algorithm
CN109361219A (en) * 2018-11-08 2019-02-19 国网新疆电力有限公司经济技术研究院 A kind of distributed power distribution network tidal current computing method and device
US10250581B2 (en) 2013-04-09 2019-04-02 Zte Corporation Client, server, radius capability negotiation method and system between client and server
CN112202177A (en) * 2020-09-29 2021-01-08 国网河南省电力公司洛阳供电公司 Method for calculating power flow of branch system of power distribution network

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10250581B2 (en) 2013-04-09 2019-04-02 Zte Corporation Client, server, radius capability negotiation method and system between client and server
CN107769214A (en) * 2017-11-14 2018-03-06 国网江苏省电力公司江阴市供电公司 Low-voltage administers switching power flow algorithm
CN109361219A (en) * 2018-11-08 2019-02-19 国网新疆电力有限公司经济技术研究院 A kind of distributed power distribution network tidal current computing method and device
CN112202177A (en) * 2020-09-29 2021-01-08 国网河南省电力公司洛阳供电公司 Method for calculating power flow of branch system of power distribution network

Similar Documents

Publication Publication Date Title
WO2015196743A1 (en) Active distribution network reconfiguration method and apparatus
CN105977934B (en) A kind of power distribution network intelligence Sofe Switch service restoration method for considering load importance
CN108233383B (en) A kind of economic load dispatching method of AC-DC interconnecting power network
CN104795800B (en) The adaptive short circuit calculation method of mining high-voltage electric-network based on interconnection switch state
CN104377696B (en) Mine high voltage power network quick-break setting simulation inspection method based on incidence matrixes
CN109256970B (en) MMC-MTDC transmission system monopolar grounding fault current calculation method
CN107272645B (en) The photovoltaic electric station grid connection fault model and analysis method of Neutral Grounding through Resistance in Electrical
CN109768546B (en) Power supply recovery method for active power distribution network based on multi-intelligent soft switch coordination
CN103605829A (en) Equivalent model method for performing electromagnetic transient simulation on alternating current/direct current hybrid power grid
CN102447254A (en) Tidal current method of annular distribution network based on compensating current
Moreira et al. Large-scale network layout optimization for radial distribution networks by parallel computing
CN103795057A (en) Power distribution network topology serial number generating method based on searching in power distribution network load flow calculation
CN108879695A (en) A kind of foundation and calculation method of DC flow model
CN107919678A (en) The service restoration method and system of alternating current-direct current mixing power distribution network
CN105023069A (en) Distribution network reconstruction method
CN104836240A (en) Power grid inherent structural characteristic-based power distribution network optimal reactive compensation method
CN102593825B (en) Method for acquiring power flow of annular power distribution network based on virtual constant current load
CN106295094B (en) A kind of electrical network weak link identification emulation mode considering relay protection hidden failure
Kong et al. Optimization of current breaker and fault current limiter in DC micro-grid based on faulty transient analysis
CN107546734A (en) A kind of voltage-type DC power flow controller no-load voltage ratio optimized calculation method
CN104393594B (en) Analytical calculation method for medium voltage network flow of urban rail transit
CN105610156B (en) A kind of concurrent cyclization method of multi-line
CN115049254A (en) Analytic hierarchy process based loop closing back load operation risk assessment method and system
CN104410071A (en) 35KV high voltage distribution network loop-closing and loop-opening current estimation method
CN109802418A (en) Partial electric grid electrical-magnetic model equivalence method suitable for extra-high voltage direct-current access

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C02 Deemed withdrawal of patent application after publication (patent law 2001)
WD01 Invention patent application deemed withdrawn after publication

Application publication date: 20120509