CA2400580A1 - Systems of advanced super decoupled load-flow computation for electrical power system - Google Patents
Systems of advanced super decoupled load-flow computation for electrical power system Download PDFInfo
- Publication number
- CA2400580A1 CA2400580A1 CA 2400580 CA2400580A CA2400580A1 CA 2400580 A1 CA2400580 A1 CA 2400580A1 CA 2400580 CA2400580 CA 2400580 CA 2400580 A CA2400580 A CA 2400580A CA 2400580 A1 CA2400580 A1 CA 2400580A1
- Authority
- CA
- Canada
- Prior art keywords
- flow
- nodes
- load
- power system
- power
- 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.)
- Abandoned
Links
Classifications
-
- 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/04—Circuit arrangements for ac mains or ac distribution networks for connecting networks of the same frequency but supplied from different sources
- H02J3/06—Controlling transfer of power between connected networks; Controlling sharing of load between connected networks
-
- 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]
-
- Y—GENERAL 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
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02E—REDUCTION OF GREENHOUSE GAS [GHG] EMISSIONS, RELATED TO ENERGY GENERATION, TRANSMISSION OR DISTRIBUTION
- Y02E60/00—Enabling technologies; Technologies with a potential or indirect contribution to GHG emissions mitigation
-
- Y—GENERAL 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
- Y04—INFORMATION OR COMMUNICATION TECHNOLOGIES HAVING AN IMPACT ON OTHER TECHNOLOGY AREAS
- Y04S—SYSTEMS INTEGRATING TECHNOLOGIES RELATED TO POWER NETWORK OPERATION, COMMUNICATION OR INFORMATION TECHNOLOGIES FOR IMPROVING THE ELECTRICAL POWER GENERATION, TRANSMISSION, DISTRIBUTION, MANAGEMENT OR USAGE, i.e. SMART GRIDS
- Y04S40/00—Systems for electrical power generation, transmission, distribution or end-user application management characterised by the use of communication or information technologies, or communication or information technology specific aspects supporting them
- Y04S40/20—Information technology specific aspects, e.g. CAD, simulation, modelling, system security
Abstract
Three Load-Flow computation methods of the present invention are the best versions of many simple variants with almost similar performance. All of the three methods are characterized in the use of simultaneous (1V, 1.theta.) iteration scheme thereby reducing the mismatch computation once compared to two mismatch computations in the prior art methods employing successive (1.theta., 1V) iteration scheme. The invented methods are also characterized in the different definition of gain matrices as detailed in the steps of algorithm-2 of carrying out of the invention. (steps-cc, -ee and -ff in flow-chart of fig.2) leading to some speed-up of the invented methods.
Description
r -'_ ..Y .,. u~., ~vcmcu ineZnOQS.
BACKGROUND ART
V--/
Control of an electrical power system (Power-flow control, voltage control etc.) is performed according to the process flow diagram of fig.4. The various numbered steps in fig.4 are explained in the following.
Step-10: On-line readings of various real-time power flows, voltages etc. are obtained Step-20: A change in control amount (power injections, voltages etc.) is initially established and proposed Step-30: Various power flows, voltage magnitudes and angles in the power system are determined by performing load-flow computation, which incorporates established/proposed/set control adjustments Step-40: The results of Load-Flow computation of step 30 are evaluated for any limit violations (i.e. over loaded transmission lines and over/under voltages at different nodes in the power system) Step-50: If the system state is good (no limit violation), the process branches to step 70, otherwise to 60 Step-60: Changes the control amount initially set in step-20 or later set in the previous process cycle step-60 and returns to step-30 Step-70: Actually implements the control amount correction to obtain optimum operation of power system without limit violations It is obvious that Load-Flow computation is performed many times in real-time control environment and, therefore, high-speed Load-Flow computation is necessary to provide control in the changing power system conditions including an outage or failure.
SYMBOLS
The prior art and inventions will now be described using the following symbols:
Y~ = G~ + jB,~ : (p-c~ th element of nodal admittance matrix without shunts y = gP + jbp : total shunt admittance at any node-p Inventor: Sureshchandra Patel Vanderbrent Crescent, Etobicoke, Ontario, M9R 3W9 E-mail: trutthQa hotmail.com Vp = ep + jfP= VpL9p : complex voltage of any node-p 09p, QVp : voltage angle, magnitude corrections Dep, ~fp : real, imaginary components of voltage corrections Pp + jQp : net nodal injected power calculated Opp + jpQp : nodal power residue (mismatch) RPp + jRQp : modified nodal power residue Bhp : rotation angle m : number of PQ-nodes k : number of PV-nodes n=m+k+1 : total number of nodes q~p : q is the node adjacent to node-p excluding the case of q~
[ ] : indicates enclosed variable symbol to be a vector or a matrix LRA : Limiting Rotation Angle PQ-node : load-node (Real-Power-P and Reactive-Power-Q are specified) PV-node : generator-node (Real-Power-P and Voltage-Magnitude-V are specified) DECOUPLED LOAD-FLOW
A class of decoupled Load-Flow methods involves a system of equations for the separate calculation of voltage angle and voltage magnitude corrections. Each decoupled method comprises a system of equations (1) and (2) differing in the definition of elements of [RP], (RQ], (Y9] and [YV].
(~] _ [Yg] [0g] ( 1 ) LRQ] _ [~] [~V]
SUCCESSIVE (1B,1V) ITERATION SCHEME
In this scheme (1) and (2) are solved alternately with intermediate updating.
Each iteration involves one calculation of [RP] and [09] to update [A] and then one calculation of [RQ] and [~V] to update [V]. The sequence of relations (3) to (6) depicts the scheme.
(ee] _ (Y9] '1 [RP] (3) [8] _ [A] + [08] (4) [0V] ° (~] ' [RQ]
fu] _ fVl + foul (6) The prior art methods involve solution of system of equations ( 1 ) and (2) in an iterative manner depicted in sequence of relations (3) to (6). This scheme requires mismatch calculation for each half iteration, because [RP] and [RQ] are calculated always using the most recent voltage values. Prior art methods are embodied in algorithm-1, and in flow-chart of fig.l.
BACKGROUND ART
V--/
Control of an electrical power system (Power-flow control, voltage control etc.) is performed according to the process flow diagram of fig.4. The various numbered steps in fig.4 are explained in the following.
Step-10: On-line readings of various real-time power flows, voltages etc. are obtained Step-20: A change in control amount (power injections, voltages etc.) is initially established and proposed Step-30: Various power flows, voltage magnitudes and angles in the power system are determined by performing load-flow computation, which incorporates established/proposed/set control adjustments Step-40: The results of Load-Flow computation of step 30 are evaluated for any limit violations (i.e. over loaded transmission lines and over/under voltages at different nodes in the power system) Step-50: If the system state is good (no limit violation), the process branches to step 70, otherwise to 60 Step-60: Changes the control amount initially set in step-20 or later set in the previous process cycle step-60 and returns to step-30 Step-70: Actually implements the control amount correction to obtain optimum operation of power system without limit violations It is obvious that Load-Flow computation is performed many times in real-time control environment and, therefore, high-speed Load-Flow computation is necessary to provide control in the changing power system conditions including an outage or failure.
SYMBOLS
The prior art and inventions will now be described using the following symbols:
Y~ = G~ + jB,~ : (p-c~ th element of nodal admittance matrix without shunts y = gP + jbp : total shunt admittance at any node-p Inventor: Sureshchandra Patel Vanderbrent Crescent, Etobicoke, Ontario, M9R 3W9 E-mail: trutthQa hotmail.com Vp = ep + jfP= VpL9p : complex voltage of any node-p 09p, QVp : voltage angle, magnitude corrections Dep, ~fp : real, imaginary components of voltage corrections Pp + jQp : net nodal injected power calculated Opp + jpQp : nodal power residue (mismatch) RPp + jRQp : modified nodal power residue Bhp : rotation angle m : number of PQ-nodes k : number of PV-nodes n=m+k+1 : total number of nodes q~p : q is the node adjacent to node-p excluding the case of q~
[ ] : indicates enclosed variable symbol to be a vector or a matrix LRA : Limiting Rotation Angle PQ-node : load-node (Real-Power-P and Reactive-Power-Q are specified) PV-node : generator-node (Real-Power-P and Voltage-Magnitude-V are specified) DECOUPLED LOAD-FLOW
A class of decoupled Load-Flow methods involves a system of equations for the separate calculation of voltage angle and voltage magnitude corrections. Each decoupled method comprises a system of equations (1) and (2) differing in the definition of elements of [RP], (RQ], (Y9] and [YV].
(~] _ [Yg] [0g] ( 1 ) LRQ] _ [~] [~V]
SUCCESSIVE (1B,1V) ITERATION SCHEME
In this scheme (1) and (2) are solved alternately with intermediate updating.
Each iteration involves one calculation of [RP] and [09] to update [A] and then one calculation of [RQ] and [~V] to update [V]. The sequence of relations (3) to (6) depicts the scheme.
(ee] _ (Y9] '1 [RP] (3) [8] _ [A] + [08] (4) [0V] ° (~] ' [RQ]
fu] _ fVl + foul (6) The prior art methods involve solution of system of equations ( 1 ) and (2) in an iterative manner depicted in sequence of relations (3) to (6). This scheme requires mismatch calculation for each half iteration, because [RP] and [RQ] are calculated always using the most recent voltage values. Prior art methods are embodied in algorithm-1, and in flow-chart of fig.l.
Inventor: Sureshchandra Patel Vanderbrent Crescent, Etobicoke, Ontario, M9R 3W9 E-mail: trutth aahotmail.com PRIOR ART: FAST SUPER DECOUPLED LOAD-FLOW METHODS
(References-2, 5, 6) Fast Super Decoupled Load-Flow (FSDL) Method RPp = (OPpCOS~p + OQpSIn~P)/Vp -for PQ-nodes (7) RQp = (-~PpSm~p + pQpCos~p)/Vp -for PQ-nodes (8) Cos~p = _B~ / v(G»Z + B~,2) Sin~p = _G~ / ~(GvP2 + B~2) (10) RPp = OPp l (KpVp) -for PV-nodes (11) Y9pq = -Y~ -for branch r/x ratio 5 2.0 -(B~ + 0.9(Y~,-B~)) -for branch r/x ratio > 2.0 -B~ -for branches connected between two PV-nodes or a PV-node and the slack-node (12) YV~ = Y~ -for branch r/x ratio S 2.0 -(Bpq + O.9(Ypq-Bpq)) -for branch r/x ratio > 2.0 (13) YBpp = ~YB~, and yV~ -_ _2bp~ + ~yV~ (14) by = bpCOS~p Or by = by (15) Kp = Absolute (BPp/Y6~) (16) Branch admittance magnitude in (12) and (13) is of the same algebraic sign as its susceptance. Elements of the two gain matrices differ in that diagonal elements of [YV]
additionally contain the b' values given by relation (15) and in respect of elements corresponding to branches connected between two PV-nodes or a PV-node and the slack-node. The method consists of relations (3) to (16). In two simple variations of the FSDL
method, one is to make YVpq YB~ and the other is to make Y9pq YV~.
Fast Super Decoupled Load-Flow Method: XB-VERSION (FSDLXB) The FSDLXB is similar to the FSDL method. They differ only in the way gain matrices are defined. The method consists of relations (3) to (11), (17), (18), (14), (15) and (16).
Inventor: Sureshchandra Patel Vanderbrent Crescent, Etobicoke, Ontario, M9R 3W9 E-mail: trutth@hotmail.com Y6pq = ~B~ -for branches cbnnected between two PV-nodes or a PV-node and the slack-node -1 /X~' -for all other branches ( 17) YVpq = -B~' -for all the branches (18) Fast Super Decoupled Load-Flow Method: BX-VERSION (FSDLBI~
The FSDLBX is similar to the FSDL method. They differ only in the way gain matrices are defined. The method consists of relations (3) to (11), (19), (20), (14), (15), and (16).
Y9~ _ -B~, -for branches connected between two PV-nodes or a PV-node and the slack-node -B~' -for all other branches (19) YVpq = -1/X~,' -for all the branches (20) Where Xpq' is the transformed branch reactance defined in appendix by equation (51) and B~' is the corresponding transformed element of the susceptance matrix.
From general considerations, Kp is restricted to the minimum value of 0.75 for FSDL, FSDLXB and FSDLBX methods and it is system independent. However it can be tuned for the best possible convergence for any given system.
The prior art methods involve solution of system of equations (1) and (2) in an iterative manner depicted in sequence of relations (3) to (6). Prior art methods are embodied in algorithm-1, and in flow-chart of fig.l.
Computation steps of FSDL, FSDLXB & FSDLBX methods (Algorithm-1):
a. Read system data and assign an initial approximate solution. If better solution estimate is not available, set all the nodes voltage magnitudes and angles equal to those of the slack-node. This is referred to as the slack-start.
b. Form nodal admittance matrix, and Initialize iteration count ITRP = ITRQ= r = 0.
bc. Compute sine and cosine of nodal rotation angles using relations (9) and (10), store them. If they, respectively, are less than the sine and cosine of angle -degrees, equate them, respectively, to those of (-36 degrees).
c. Form (m+k) x (m+k) size matrices [Y6] and [YVJ of (1) and (2) respectively each in a compact storage exploiting sparsity 1) In case of FSDL-method, the matrices are formed using relations (12), (13), (14), and (15) 2) In case of FSDLXB-method, the matrices are formed using relations (1?), (18), (14), and (15) Inventor: Sureshchandra Patel Vanderbrent Crescent, Etobicoke, Ontario, M9R 3W9 E-mail: trutth@hotmail.com 3) Iii case of FSDLBX-method, the matrices are formed using relations (19), (20), (14), and (15) In [YV] matrix, replace diagonal elements corresponding to PV-nodes by very large value (say, 10.0** 10). In case [YV] is of dimension (m x m), this is not required to be performed. Factorize [Y8] and [YV] using the same ordering of nodes regardless of node-types and store them using the same indexing and addressing information. In case [YV] is of dimension (m x m), it is factorized using different ordering than that of [YB].
d. Compute residues OP (PQ- and PV-nodes) and 0Q (at only PQ-nodes). If all are less than the tolerance (E), proceed to step (m). Otherwise follow the next step.
e. Compute the vector of modified residues [RP] using (7) for PQ-nodes, and using (11) and (16) for PV-nodes.
f. Solve (3) for [D0] and update voltage angles using, [8] _ [B] + [09).
g. Set voltage magnitudes of PV-nodes equal to the specified values, and Increment the iteration count ITRP=ITRP+1 and r=(ITRP+ITRQ)/2.
h. Compute residues [OP] (PQ- and PV-nodes) and [0Q] (at PQ-nodes only). If all are less than the tolerance (E), proceed to step (m). Otherwise follow the next step.
i. Compute the vector of modified residues [RQ] using (8) for only PQ-nodes.
j. Solve (S) for [~V] and update PQ-node magnitudes using [V] _ [V] + [0V].
While solving equation (5), skip all the rows and columns corresponding to PV-nodes.
k. Increment the iteration count ITRQ=ITRQ+1 and r--(ITRP+ITRQ)/2, and Proceed to step (d) m. Calculate line flows and output the desired results The FSDL, FSDLXB and FSDLBX algorithms differ only in step-c defining gain matrices. Fig.l is the flow-chart of algorithm-1.
INVENTED ADVANCED SUPER DECOUPLED LOAD-FLOW METHODS
SIMULTANEOUS (1V,1B) ITERATION SCHEME
An ideal to be approached for the decoupled load-flow methods is the constant matrix load-flow of reference-5 referred in this document as BGGB-method. In an attempt to imitate it, a decoupled class of methods with simultaneous (1V, 1B) iteration scheme depicted by sequence of relations (21) to (25) is invented. This scheme involves only one mismatch calculation in an iteration. The correction vector is calculated in two separate parts without intermediate updating. Each iteration involves one calculation of [RQ], [0V], and [RP], [D8] to update [V] and [B].
[0V] _ [YV] 1 [RQ] (21) [RP] _ [OP/V] - [G] [~V] (22) Inventor: Sureshchandra Patel Vanderbrent Crescent, Etobicoke, Ontario, M9R 3W9 E-mail: trutth@hotmail.com [oe] _ [Ye] -' [RP] (23) [e] _ [e] + [oe] (24) [v] _ [v] + [vv] (2s) In this invented class, each method differs only in the definition of elements of [RQ] and [YV]. The accuracy of methods depends only on the accuracy of calculation of [~V]. The greater the angular spread of branches terminating at PQ-nodes, the greater the inaccuracy in the calculation of [0V].
Advanced Super Decoupled Load-Flow: BX-version (ASDLBX) When both sides of relations (1) and (2) are divided by Cosine of nodal rotation angles (Cos~p), with [RP] and [RQ] defined respectively by (7) & (8) and [YA] & [~V]
defined respectively by (12) and (13) with the factor 0.9 taken 1.0, leads to simple variants involving application of super decoupling to both the sub-problems, only to P-B sub-problem and only to Q-V sub-problem. Numerically the most successful version is that of Super Decoupling applied only to the Q-V sub-problem. Therefore, BX-type Fast Super Decoupled Load-Flow method consists of sequence of relations (3) to (6), which is Successive (1B, 1V) Iteration Scheme. This is referred to as BX-FSDL in this document, where the definition of elements of [RP], [RQ], [YB] and [YV] are given by (26) to (29).
RPp = OPp / Vp (26) RQp = [OQp - (G~ i B~) OPp] / Vp -for PQ-nodes (27) YBpq = -B~ and YV~ _ _1/X~ (28) Y6pp = ~Y9pq and YVpp = -2bp + ~YV~ (29) It should be noted that Amerongen's General-purpose Fast Decoupled Load-Flow method of reference-3 has turned out to be an approximation of this method. The approximation involved is only in relation (27). However, numerical performance is found to be only slightly better but more reliable than that of the Amerongen's method. This method is embodied in Algorithm-1 and in the flow-chart of Fig.l.
Advanced Super Decoupled Load-Flow: BGX'-version (ASDLBGX') Numerical performance could further be improved by organizing the solution in a simultaneous ( 1 V, 1 B) iteration scheme represented by sequence of relations (21 ) to (25).
The elements of [RP], [RQ], [YB] and [YV] are defined by (30) to (36).
Inventor: Sureshchandra Patel Vanderbrent Crescent, Etobicoke, Ontario, M9R 3W9 E-mail: trutth@hotmail.com RQp = [~Qp' - (Gpp' / Bpp') OPp'] / Vp -for PQ-nodes (30) m RPp = (OPp / Vp) - ~ Gpq OVq (31) q=1 YBpq = -Bpq and YVpq = -1/Xpq' (32) YBpp = ~ Y9pq and YVpp = -2bp + ~ YVpq (33) 9'P 4>P
by = bpCos~p or by = by (34) Where, OPp' = OPpCOS~p + OQpSin~p -for PQ-nodes (35) OQp' _ -~PpSin~p + OQpCOS~p -for PQ-nodes (36) The ASDLBGX' method comprises relations (21) to (25), and (30) to (36). It is embodied in algorithm-2 and in the flow-chart of Fig.2.
Advanced Super Decoupled Load-Flow: BGX'-version (ASDLBGY) If unrestricted rotation is applied and transformed susceptance is taken as admittance values and transformed conductance is assumed zero (reference-5), the ASDLBGX' method reduces to ASDLBGY as defined by relations (37) to (41).
RQp = OQp'/Vp = (OPpCOS~p + ~QpSln~p)/Vp -for PQ-nodes (37) m RPp = (OPp / Vp) - qE Gpq ~Vq Yepq = -BPq and YVpq = -ypq (39) Yepp = ~ Y9pq and YVpp = -2bp' + ~ YVpq (40) 9>P 9>P
by = bpCos~p or by = by (41 ) The ASDLBGY method comprises relations (21) to (25), and (37) to (41). It is embodied in algorithm-2 and in the flow-chart of Fig.2.
Inventor: Sureshchandra Patel Vanderbrent Crescent, Etobicoke, Ontario, M9R 3W9 E-mail: trutth@hotmail.com Advanced Super Decoupled Load-Flow: BGX-version (ASDLBGX) If no (zero) rotation is applied, the ASDLBGX' method reduces to ASDLBGX as defined by relations (42) to (46).
RQp = [OQp - (G~ i B~) OPp] / Vp -for PQ-nodes (42) m RPp = (~Pp / Vp) - ~iG~ OVq (43) Y9~y = -B~ and YV~ _ -1/Xpq (44) Y6pp = ~Y6pq and yV~ _ _2bp + ~yV,,~ (45) bp' = bpCos~p or by = by (46) The ASDLBGX method comprises relations (21) to (25), and (42) to (46). It is embodied in algorithm-2 and in the flow-chart of Fig.2.
In all the prior art and invented models [YB] and [YV] are real, sparse, symmetrical and built only from network elements. Since they are constant, they need to be factorized once only at the start of the solution. Equations (1) and (2) are to be solved repeatedly by forward and backward substitutions.
[Y8] and [YV] are of the same dimentions (m+k) x (m+k) when only a row/column of the slack-node is excluded and both are triangularized using the same ordering regardless of the node-types. For a row/column corresponding to a PV-node excluded in [YV], use a large diagonal to mask out the effects of the off diagonal terms. When the node is switched to the PQ-type the row/column is reactivated by removing the large diagonal.
This technique is especially useful in the treatment of PV-nodes in the matrix [YV].
It is invented to make this technique efficient while solving (5) for [~V] by skipping all PV-nodes and factor elements with indices corresponding to PV-nodes. In other words efficiency can be realized by skipping operations on rows/columns corresponding to PV-nodes in the forward-backward solution of (5). This has been implemented and time saving of about 4% of the total solution time (including input/output) could be realized in 14-14 iterations required to solve 118-node system with the uniform R-scale factor of 4 applied. However, this saving is not possible in case of Novel Fast Super Decoupled method because PV-nodes are also active. The time saving has been assessed on PC-XT.
It should be noted that the same indexing and addressing information can be used for the storage of both the matrices as they are of the same dimension and sparsity structure.
Inventor: Sureshchandra Patel Vanderbrent Crescent, Etobicoke, Ontario, M9R 3W9 E-mail: trutth@hotmail.com Computation steps of ASDLBGX', ASDLBGY and ASDLBGX methods (Algorithm-2):
a. Read system data and assign an initial approximate solution. If better solution estimate is not available, set all the nodes voltage magnitudes and angles equal to those of the slack-node. This is referred to as the slack-start.
b. Form nodal admittance matrix, and Initialize iteration count ITRP = ITRQ= r = 0.
bc. Compute sine and cosine of nodal rotation angles using relations (9) and (10), store them. If they, respectively, are less than the sine and cosine of any angle set (say -36 degrees), equate them, respectively, to those of (say -36 degrees).
cc. Form (m+k) x (m+k) size matrices [Y9] and [YV] of (1) and (2) respectively each in a compact storage exploiting sparsity 4) In case of ASDLBGX'-method, the matrices are formed using relations (32), (33), and (34) 5) In case of ASDLBGY-method, the matrices are formed using relations (39), (40), and (41 ) 6) In case of ASDLBGX-method, the matrices are formed using relations (44), (45), and (46) In [YV] matrix, replace diagonal elements corresponding to PV-nodes by very large value (say, 10.0** 10). In case [YV] is of dimension (m x m), this is not required to be performed. Factorize [YB] and [YV] using the same ordering of nodes regardless of node-types and store them using the same indexing and addressing information. In case [YV] is of dimension (m x m), it is factorized using different ordering than that of [Y8].
d. Compute residues 0P (PQ- and PV-nodes) and ~Q (at only PQ-nodes). If all are less than the tolerance (E), proceed to step (m). Otherwise follow the next step.
ee. Compute the vector of modified residues [RQ] using (30), (35), and (36) for only PQ-nodes. Solve (21) for [0V]. While solving equation (21), skip all the rows and columns corresponding to PV-nodes. Compute the vector of modified residues [RP] using (31) or (38) or (43). Solve (23) for [D8].
ff. Update voltage angles using, [8] _ [8] + [OA]. and update PQ-node voltage magnitudes using [V] _ [V] + [0V].
g. Set voltage magnitudes of PV-nodes equal to the specified values, and Increment the iteration count ITRP=ITRP+1 and r=(ITRP+ITRQ)/2.
m. Calculate line flows and output the desired results It can be seen that steps-i and j of algorithm-1 are combined with steps-ee and ff in algorithm-2, and steps-h and k are eliminated in algorithm-2. The ASDLBGX', ASDLBGY and ASDLBGX algorithms differ only in step-cc defining gain matrices.
Fig.2 is the flow-chart embodiment of algorithm-2.
Inventor: Sureshchandra Patel Vanderbrent Crescent, Etobicoke, Ontario, M9R 3w9 E-mail: trutthQbotmail.com APPENDIX
Transformation of Branch Admittance The branch admittance transformation for symmetrical gain matrices of the FSDLXB,FSDLBX, NFSDLXB and NFSDLBX methods is given by the following steps:
1. Compute: ~P = arctan (GPp/B~) and aiCtan (G99~B94) (f7) 2. Compute the average of rotations at the terminal nodes (p and q) of a branch:
~ay = (~P + ~q)~2 (48) 3. Compare ~a~ with the Limiting Rotation Angle (LRA) and let ~", to be the smaller of the two:
Via" = minimum (fi"., LRA) (49) 4. Compute transformed pq-th element of the admittance matrix:
G~' + jB~,' _ (Cos ~$" + jSin Via") (G~ + jB~) (50) 5. Note that the transformed branch reactance is:
X~~ - 8~~~(G~,2 + B~~z) (5I) and similarly XPP~ __ BPP~~(G~~2 + BPPe2) (52) REFERENCES
Foreign Patent Document US Patent Number: 4868410 dated September 19, 1989.
Canadian Patent Document 2. Canadian Patent Application Number: 2107388, and Titled Super Decoupled Load-Flow methods. Applicant and Inventor name: Sureshchandra Patel Other Publications 3. Robert A.M. Van Amerongen, "A general-purpose version of the Fast Decoupled Load-Flow", IEEE Trans., VoI.PWRS-4, pp.760-770, May 1989.
4. P.H.Haley and M.Ayres, "Super Decoupled Load-Flow with distributed slach bus", IEEE Trans., VoI.PAS-104, pp.104-113, January 1985.
5. S.B.Patel, "Fast Super Decoupled Loadflow", IEE proceedings Part-C, Vo1.139, No.l, January 1992.
6. S.B.Patel, " Transformation based Fast Decoupled Loadflow", Proceedings of 1991 - IEEE region-10 international conference (IEEE TENCON'91, New Delhi), VoI.I, pp.183-187, August 1991.
BRIEF DESCRIPTION OF DRAWINGS
Fig. 1 is a flow-chart of prior art load-flow computation systems Fig. 2 is a flow-chart embodiment of the invented load-flow computation systems Fig. 3 is a flow-chart of the overall controlling method for an electrical power system using one of the load-flow computation systems of Figs. 1 or 2.
~ .~ ~r ~- ~i c ~ .D S U ~ x-12 ~ c co a p L~ D ~ o ~ ~ ~ L o ~
c.~ u~ ~ ~Q ~ ca ~ ~ ~ ~,e-e~ 6 -Q~.~ m,~ dQ ~ .~ n~,v vi c~ e~
S .~ ~ ~ ~ .e.~,uc~,.~1 cd1 S ~~ ~t'~ 2 ~ e.P Zit r~.,~ 2 c~n.C.c 1.~~,'°'~1 °b V~~:lt-~g ~ crmg,~ ~ cn~.~d ~ ~~'an i ~~ ~ ~-'v~ ec-~; °~S - ~-.err-(,, 9 e~co~n.~r ~ ~ r1 o d ~-.~ c~-n ~~.i s ~ ~~~~ ~b '~.''~~ °'~'~ cc~
c~ 1 D V P/tt ''a'~~ t 'a'1 ~ 2 ~~'tq'~1 ~ ~ t °'~ ~ e-..~ ~Y1~1 ~!~.~
P~ ~ ~ ~~ r ~y ~~ ~ ~ v-' '~e ~ .
C p ~] _ ~- ct~
_ .- CZ>
C ~ C~ v~
_~~~, i ~_.~ /~
~ic~, ~v~
~u ~ S a .~.~V ~ tN ~'I
tin t S S ~ ~ ~. C
i t- PJI cn.~'1 ~ ~'~ 'V ~9.~V~ ~
i m r~1'~'~1 ~d~.m"'~-2 '~pd ~..ti n ~ ~ ~c.G~
G,~ pa ~ ~d ~r-~ ~.~~ ~ v ~ ~~-, C v ~ . rig i s s ~-tn ~'» 2 c r,.~ c v~ o..h ~ ~
~1 eat vu ~ ~ 'gin ~ ~rn ~1 -2 L ~2 P ~ G~nP~ C ~ ~~ ~ a a ~ c v~-~-~'- ~o-~ o''!~ ~"~ U'"2'3 ~ 2cc,~ v~
.~, ~ ~, e~ ,~ ~ ~c ~-~t ~ ~~ .~ -a V'~'~ ~ . '~"~ ~ s ~ ~. vru- ~
,~ a l r.~-h'~~~ C3 ~ , Clc ~ , ~'~ o~.~ C 6' c~ ~' p ~ c ~'I
c~ ,,~ ~.~ r~.~'~
~ sc,Li ~ ~' ~ _ ~ _ ~ _.
r b~~ v ~Y~~ ~
o~~ _ _ ~ --C
Q ~ _, ~ ~---C,~Y~ ~~~~ __ ,~~ _ ~~~ ~- ~~ v~
C
° eo'v~ 1 ~ I m i r ~I c~'1~ s ~ ~
~ P~ Pos e~
y'~m a .~ ~~
d a o~.Q 1-~ 6 ~ w(' p~tn ~c.~ ~ ~ ~ a d a c o ~ ~( ~
c~ '~ ~ '~ o ~ ~ Q ~ as 't-~, ~ c ~ ~-u~.,~' rt ~~ i x 6 U; (f ~ '~ o ~ a .~ ~. r ~ - ~ ~ ~ t- o~rW h 1'n ~ '~ Yn i (' ~
C
at a ~ ~ ~ 2~ C.~ ~ °'6 "~''~ 0 d P .~ In9 ~'1'1~ ~ i 'm v~l-~1 ~
d i p ~~~ I' ~ b ~ s ~.a >n ~"W ~ '1r' irk tv~ I r9, Cq~ C~), C 1~ ~ CI2-' i s P.~,D Ped C~~~ ~ , ~ 7n , ~ ~-n r~.r"c-fig ce-~ ~ c,~'~~ °'~ 'v' ~ ~ ~~ C ~ c''a °''( e.~ ' fi ~ o~~h °'~1, , ~ v7 ~ r~ a-~ ~11 (~~ W
~ S ~ vW ~-- ~ °'sL t-S : ~'~ t- C
a _ C~Yj C ~~~ -C~avJ c~ L.~v~
C~ ~ ~ = C°~ ~ c ~ __-.-_ c ~~ _--_. _ _r C
C ~~ _ C m~ ~~p~ --a~ + ~~~ -- -bra V _ w~ ~. ~,bw~
~ -r.-~.o ~ a ~ d ~' ~Y o~t,~ cm d e~; ~,; ti ~u1 .~ ~t ~-~1 ~
o~, d~ ~''~-'y °~'n1 r~ a ~ c ~ ~ a c y ~ ccwW ~~J °~ '>'no~ ~~ ~ ~o..f ~1 'the- G"r'~'~~l S P
C a~~ cv..~ c~'' °~s'1 ~ C ~ ''~~ 1" W h ~ '~ ~ _ ,~,, o d ~ , r ~ ~-9~r ~ off- ~I t-1 b~lw~,ch ~ fi ~ t'~ ~-h'~~~ ~t ~ ~'1M c~.C'~ ~'a'~ 1~L, 2 o ~ , L2~ Cyy _ ~d~~
p~, e~ ~-~ ~ a ~.r.~~t-~ ~ ~. 7 , .~ ~r 3~
/~ d3 ~P 'V'~ ~Pl$-a.od ~' -p _ b P ~ ~P r P ~ ~ .-- s,~
_'~o~~, - C
_,~P s~~,~n~- a~n~~s~p~l'~P ~P~
P' ~Y_a~~~ ~' D Pp ~tcp P~ ) ~ --is y9 ~ C.PY_~,od o~s A~bS~.l~-- ~. ~P ~ w C:O 1 ~ p - ' APP ~_j ~''-- ~ --~~~PP t APP
, C
SI'a'~ ~~ , _,_, ~-pp ~,z ~ ~ Z- ._ ,--Pp f~~' ' YP~ ~ ~ ~ o I~LW1 b.~a~r~~n Q-~' ~ ~ t q - ~3 p c~ ~'i b.~ a'~.~, ~ c ~r, ~r~, t cl-~J b Q..~w ~-~ 1-In,ro P v --~~ et f ca~Y,~ w, a S.~c~.c.~- ~,..od e, rid c, w_ ~,,~(~
y vp _ "' yP ~ ~ ~..c~ b ~ U,~,~ ~
q ~ ~'~,q ~ yYPP ~ - 2 b~ ~- ~ -'YY9 _ ---- ~2r~
a-~Q ~-~P
t'~'! G~a~G. ~ ~'>~ i r i-tc~n r a '~"n G~r~r~ i 't''hd (~.. 1~~ C t ~ s ~ ~ o~~ ~ ~-.~ n ~..i c_ s t 9-,-~ ov, ,-'t-s ,~.,,~ s ~ ~ ~ ~ c. ~ , ~-.t ~~-~I~tn ~ rw d g U.i ~ ~n r.~.M ~~ c ~ d ~' ~ t"~ t~,~..t~ d ~~a ~-r,~"d,,~ ~.rt ~ ~b'' ~yv~ ~d d~ h'~,o.,~.l~ c~.ko~..~-~ t-wl"c e_ t-~ c 6~ y~ol~h ~ ~ ~"'~~
e-tsy.r~ to''tladp~di~t~- ~--O
b y ~ea~~,~ °'r~t C 2 L~ ~' ~'~ ~I ~3 ~ ~t ~-f' ~~ b~.um cln ~.1 car, ~~c~t-~
t~ ~e.kw e..Q.~ t-w D 'P~'.~-'~ a d ~ ~'l ~ Qv~ ~n,e et t4 c~.D t-v. ~e..._ S.l ~~ ~ ne d e~ ~"~1 a~, ~. cG.r, '~ ~. ~~ ~ o ~ v~' ~ wo~.~ s ~.h'~
~D h y ~u.~'a~~. ~ c ~ ai ~ ~no~'~t"c ~Q
1 "x'1 .~"h G ,t G~ i U ~a'bt In~ f 2~ , ~'1 2 r l 1''~ 'm ~ a ~ t-~ e~ ~ rd "~~ ~. y ~Pq = Yupq , Gc a-rt ~ o~ ~ t-i~ L- ~ c,,~-v~ I< p ~ ~ ~ e~ t'~ i c 1- o..~ t-" v. 'n'!
t~ ~~ ~ r ~ ~'~st 6,e.. tZ~~n e.~1 ~ ~, ~ b ~ ~- Pa ~-t ; b ~ ~
G~ly ~rtG~ 'r''~ ~.~ ~~Y~1 ~ s ~ ~
~-~t '~"~1 e.r~ ~~1,~~2~d 1'1 ~-~. ro c~
oa ~ ~-~
~ ~'~ d t.el b ~ c ~3 ~ '~ a ~ ~u, d t-..Q ~ fl t'~.~h~ ~
.~ ~c~.. q P-v s ~ ~, Q ~ ~ v~a~"~c~.~,,~-!r ~'r vv ~ vi ~, ~ ~ n ~" ~ ~' ~
s v~ o,~ n ~ co~..:~" and ~ b n T'LI t-'~ a sue, ,~.~ 1~ .~ v~r~ tv P~- A S'''~6 P.~ta'h ~ Q-n., ~. ~ o~t.N 1-0 ~Q-- v s ~ P~ h .~ ~ .
Lvrn o~ i c e~~ 'Nn a ~ t- ~ ~ cc ~ ~( 'Y ~," ~°~ 'r-k r.~fi ~~S'v~,P
Pil ~rrl t-t~ a ~ _ v/ s ~ ~Jt;~ b ~~ . ~ ~ oft ~
m~ o~ ~ f3 x s f'~ v ~ S~ ~ D a ~ ~ ~ a~-o c.~ ~.~ ~-n ~ ~
earn s s f ~ °~ s ~&~~ ~b eat vm.h" o~-~ ~ i ~ ~ C 2' w h ~ ~ ~ '~'l ~ c~cJl~ a ~ ~ ~ ~R P~ ~ nC'.~~~ C ~' ~.~ r~''''~ ~I ~~ ~''~ ~e y-'' v~ Q'Y1 r -, y 'V' f ~ n ~ ~'\j.~t ~a 'R~ = P ~ P
(gP "' C ~P P ~ n ~ ~p (~
PP
P
- ~ ~eP~, --y ~~~t ~. z. J, ~ ~ ~_ ~ VPq _ ~ ~xY~ ~~P P - P
VP q r P ~~ P~~'e-fi k v~~ (~'~ ~1 cry g P-ai l Cc ~
S~ ~~~ H~ fi~ ~ d~ ~
Lo o~-A 6-~.v~
F'~ f ~ ,, Q~ . .crh ~ ~ ~~.x f m ~~°'~l iwv ~~ro~
P n w ~1 'm ~ ~ i ci,.l Pw~ ~ c ~ ~ s 1 S ~~ ~~I C'~~-~?
I~ ~~ ~.~ b ~.r~-~1 °v'''cD ' tro ~-e- °~'~ S d ~ g ~'S , -1 a ~ a~ ~ ~- fi~ u'~' 9'~ Gb ~ ~'~ rh ~ t~ a ~'~ f~~w v~
~i ~m o~~ c ~ ~~~'~ ~ c. ~ ~ ~ P~ , -c'~1 ~~t ~ ~u~t e~
,Sv~ ~ 9 ~ ccrv~ .lt '~ f Cory ~ 0 ~ ~ ~ ~ ~ ~ ~ P~ f/'~- ~ri ~L~ P ~ ~'~---nrn P.~w'~' .~~-v~e-~ ~ ~ ~,~,~,g Q,r,~t M 1- ~-Q-c~ '~ ~ _ S ~ P~ p ~c w~.D .~ ~D ~ ~D
c,~m ~-e- s ~,i o~ 1-~ 6-~~- c Gc ~ - L.e h.r~ r .~o~
a w ,~,~ d ~ i'~ a ~ ~ a ~~k~ ~ ~ a, c~
s ~ Yn v~.~.~1 ~ ~'U ~ 1 ~ ~ i t- P~ ~ ~1 S cat 4~i ~ ''! ~'~
t~)~ ~~~ ~~~ ~4>~ ~~~~ ~ ~2~ .
t~ ~ s ~ ~ c.~ ~, ~, r ~ v~-~, o.~ ~ ~ P ~ , C1~6~~ r ~y m~ ov,..a( ~'~ v~' Ova. e-~a ~~ . C~~, C~> ~ ~~~ .
h~P ~ b~P --. C~'~~ j a ~P ~'~' p~ p ' ' ' '~' _ ~ C
= ,a P ~~r ~-~'P9 x av _ P P P
9=I
r y ~ ~ ~- C~c.
f3 P y ~P P _ ~ P9 - -~ ~' _ _ 2 b ~ ~ ~ -y y~q '' x ~ y P~ P q -.gyp Pq ~ ; ~ ~ ~ ~ ~ c~J [~ ~n ~,~'s~ 'r» rn~, e.~-~t ~ c r~.~ g-ui ~
~ ~-~ i c ~! c ov~-~ b Q B b ~ ~ ~ b ~ fi~ ~ ~- a ~ ~ 1 Q ~ ~ ~ °~P~
Q''~i '~
aN ~ uy ~ °b ~,o ~~ °d'~ °~"~ ~' a 1-~; n~~.~ ~r,.~ d ~
o~ ~ b~,u~a-t~, tin-a b~c.~ o~'rn~ hh~ ~
r _ C ~P P
,o ~~ n ~ s ~ ~ ~_ ~-- C
~,urndi~'~r~ ~ s ~~~.c c~ W
~P ~ ~ ~ ~.d, m ~ tt~
l S G~~ ~~/Ir~ '~ ~ j 'h~ C~" 2 t~ .~ ~-3 r~ n ..~ ~d'v~c. ~ ~ c ~7 h o~
,~ p~ P
~~ S f x, ~P t Y _ .- ~-- ~-r a o ~--- (~r>
- ~ ,.---( P 9 ~ '' ~Pq ~ PV - P q~.P
ze~,o ~ ~,o t-~..h' ~ . s wPd~-t~'~, t-~,~ ~ d .- .a.-~,.~lac~
~, ~P _' ~vP
_ ~ .._.. - GcP~ ~- ~CS vp ~ ~ .-P
r ~ ~P ~t - ~ P~1 s y ~' ~, J ~2-10 p -~- ~,~ '-x ~q ~
~~ Q~, C~~~ ,~ ~> > C~-~ ~/ C33y ~'~y ~r> ~ ~~'' C~~ , C3 ~
(~ e~ C~ ~ ~L,~ ~ C 3'3~~ ~3-~~ J y ~~~ ( ~>i C'~~r r S C G G--P C4~~ ~ °~ m ~' L° ~ 4~i'1 Q~I,GuP
~-~, ~"'S-~ - 2-~ fib ~ i c ~ C~~y,~ ~ ~( e~
c~~.
coy can CZ~ ~ ~t~~, c~-), c~~, Cad>, C~~~ P ~3 c~-), C~ ,~~~~ .
Wt't~ Pin e~l o~n.t~- ~ ~t'~-~-~ o~.~l w, e. c.~~"~m e0 '~ e~.oBp a~ ~ ~ s P~ a '''~ ~ ,~ ~~.e( P~..,I- t- ~'~7 .~ ~e c~9~n ~~, ~'~v o-~ h~~.p~h~~ Y- b''~ ~'' ~ c~9 ~ '.Q~f ~
-n,, e. i- e~ ~~~t ~r ~- ~ ~-i ~~ ~ cwe ~'P ~
°'~'1 , ~ ryy, ~~cr,,,~ ~ Q- f-v P~'n.~ ,~ 'i'r' ~ t°1-'~'~' w2 P~.,v ~-~r ~~ ~ c~-e~ eel fi~ '~b ~i.~ a c~ ~
.. ~d.~~~1 ' o l r ~~~C~
n 1=~ fi S'~' ~ b Q.Co'~:~ ~ L:~ ~.d ~-.iQ.o-~? ~~
~ ~ ~~.- ~.,~,~ C ~ ed ~ ~~ pa~~,t"-_ ~ ~ ,~ . ) 3 ~', r~ a ~ 1 ~ ~~ rn~ ~q 9'2, ~ . ,3 , Qv~ C~, ' ~ S ~ ~ p a c du,~ ~ ~ La ~ ~-~-u v~ ~ ~~ a covnc~ i c~ p aLg~~ .~n"c wh~v,r~ ~ o . : z.
~ b ~' o9-n"1. ~'rn enu~,~~ " ~- ~, Q,,n ~,,~,~.,~~ p~d~-~..
~f ~- p~2CDV~,(I.~ ~
w ~ '~'~
I~~t, ~C,,l~r~ ~r S ~,~Y, ~C~e~.,~1 ~-,cr~ c~..c.~,,..~..~..t, Q~~-'t S~~r~-~, f.
~l S ~ r~.~t-~-,~'' ~ , Lt, fs 6 ~ ~. ~ ~
~ ~~ .~e-P y k~ C ~ ° '~~ ~.~
P~~ s ~~ ,gin ~~; s ~~ s ~ ~~fih ~ ~
C'~t~t-~.. ~c!~ b~ ~I. , ~!~rn,~ r2.~.o (~ ~ . s~.eC'~~I
P~ ~g--~..~.~. ~-- ~ vrr e~ ~ fig, e~ '~ ~ ~
~~r-o c ~ e.d ~ ~ !~ °~ ~-yw S t x t~ ~ ~nr''1'"Q p'c~''~e,~ S '~ ~'~
°'~'1.~PJI, G~ ~ 'L ~.T ~ ~Gc ~ D '(Z- f ~ ~''Yn '~'~ 7~.~ ~
~t ~"~- .T~ ~.~ ( 9 9 sr o, o ~ ~~ d o~-,~ c ~ ~ ~ ~ '~ ~ ~ ~ , L3 v~ ~.~n v~ s'h~G~ I~~'~' ~'' I~u~'unn d'~.~.~ ~r ~ 'b~
L t --1~~
,.:fit-~1 ~t~~ t~ a u. ~r . ~' I
t~ ~~~ : ~'~ ~ 1 ~--~ o t-'~~ l tz-.-t-~-"T
= ~6
(References-2, 5, 6) Fast Super Decoupled Load-Flow (FSDL) Method RPp = (OPpCOS~p + OQpSIn~P)/Vp -for PQ-nodes (7) RQp = (-~PpSm~p + pQpCos~p)/Vp -for PQ-nodes (8) Cos~p = _B~ / v(G»Z + B~,2) Sin~p = _G~ / ~(GvP2 + B~2) (10) RPp = OPp l (KpVp) -for PV-nodes (11) Y9pq = -Y~ -for branch r/x ratio 5 2.0 -(B~ + 0.9(Y~,-B~)) -for branch r/x ratio > 2.0 -B~ -for branches connected between two PV-nodes or a PV-node and the slack-node (12) YV~ = Y~ -for branch r/x ratio S 2.0 -(Bpq + O.9(Ypq-Bpq)) -for branch r/x ratio > 2.0 (13) YBpp = ~YB~, and yV~ -_ _2bp~ + ~yV~ (14) by = bpCOS~p Or by = by (15) Kp = Absolute (BPp/Y6~) (16) Branch admittance magnitude in (12) and (13) is of the same algebraic sign as its susceptance. Elements of the two gain matrices differ in that diagonal elements of [YV]
additionally contain the b' values given by relation (15) and in respect of elements corresponding to branches connected between two PV-nodes or a PV-node and the slack-node. The method consists of relations (3) to (16). In two simple variations of the FSDL
method, one is to make YVpq YB~ and the other is to make Y9pq YV~.
Fast Super Decoupled Load-Flow Method: XB-VERSION (FSDLXB) The FSDLXB is similar to the FSDL method. They differ only in the way gain matrices are defined. The method consists of relations (3) to (11), (17), (18), (14), (15) and (16).
Inventor: Sureshchandra Patel Vanderbrent Crescent, Etobicoke, Ontario, M9R 3W9 E-mail: trutth@hotmail.com Y6pq = ~B~ -for branches cbnnected between two PV-nodes or a PV-node and the slack-node -1 /X~' -for all other branches ( 17) YVpq = -B~' -for all the branches (18) Fast Super Decoupled Load-Flow Method: BX-VERSION (FSDLBI~
The FSDLBX is similar to the FSDL method. They differ only in the way gain matrices are defined. The method consists of relations (3) to (11), (19), (20), (14), (15), and (16).
Y9~ _ -B~, -for branches connected between two PV-nodes or a PV-node and the slack-node -B~' -for all other branches (19) YVpq = -1/X~,' -for all the branches (20) Where Xpq' is the transformed branch reactance defined in appendix by equation (51) and B~' is the corresponding transformed element of the susceptance matrix.
From general considerations, Kp is restricted to the minimum value of 0.75 for FSDL, FSDLXB and FSDLBX methods and it is system independent. However it can be tuned for the best possible convergence for any given system.
The prior art methods involve solution of system of equations (1) and (2) in an iterative manner depicted in sequence of relations (3) to (6). Prior art methods are embodied in algorithm-1, and in flow-chart of fig.l.
Computation steps of FSDL, FSDLXB & FSDLBX methods (Algorithm-1):
a. Read system data and assign an initial approximate solution. If better solution estimate is not available, set all the nodes voltage magnitudes and angles equal to those of the slack-node. This is referred to as the slack-start.
b. Form nodal admittance matrix, and Initialize iteration count ITRP = ITRQ= r = 0.
bc. Compute sine and cosine of nodal rotation angles using relations (9) and (10), store them. If they, respectively, are less than the sine and cosine of angle -degrees, equate them, respectively, to those of (-36 degrees).
c. Form (m+k) x (m+k) size matrices [Y6] and [YVJ of (1) and (2) respectively each in a compact storage exploiting sparsity 1) In case of FSDL-method, the matrices are formed using relations (12), (13), (14), and (15) 2) In case of FSDLXB-method, the matrices are formed using relations (1?), (18), (14), and (15) Inventor: Sureshchandra Patel Vanderbrent Crescent, Etobicoke, Ontario, M9R 3W9 E-mail: trutth@hotmail.com 3) Iii case of FSDLBX-method, the matrices are formed using relations (19), (20), (14), and (15) In [YV] matrix, replace diagonal elements corresponding to PV-nodes by very large value (say, 10.0** 10). In case [YV] is of dimension (m x m), this is not required to be performed. Factorize [Y8] and [YV] using the same ordering of nodes regardless of node-types and store them using the same indexing and addressing information. In case [YV] is of dimension (m x m), it is factorized using different ordering than that of [YB].
d. Compute residues OP (PQ- and PV-nodes) and 0Q (at only PQ-nodes). If all are less than the tolerance (E), proceed to step (m). Otherwise follow the next step.
e. Compute the vector of modified residues [RP] using (7) for PQ-nodes, and using (11) and (16) for PV-nodes.
f. Solve (3) for [D0] and update voltage angles using, [8] _ [B] + [09).
g. Set voltage magnitudes of PV-nodes equal to the specified values, and Increment the iteration count ITRP=ITRP+1 and r=(ITRP+ITRQ)/2.
h. Compute residues [OP] (PQ- and PV-nodes) and [0Q] (at PQ-nodes only). If all are less than the tolerance (E), proceed to step (m). Otherwise follow the next step.
i. Compute the vector of modified residues [RQ] using (8) for only PQ-nodes.
j. Solve (S) for [~V] and update PQ-node magnitudes using [V] _ [V] + [0V].
While solving equation (5), skip all the rows and columns corresponding to PV-nodes.
k. Increment the iteration count ITRQ=ITRQ+1 and r--(ITRP+ITRQ)/2, and Proceed to step (d) m. Calculate line flows and output the desired results The FSDL, FSDLXB and FSDLBX algorithms differ only in step-c defining gain matrices. Fig.l is the flow-chart of algorithm-1.
INVENTED ADVANCED SUPER DECOUPLED LOAD-FLOW METHODS
SIMULTANEOUS (1V,1B) ITERATION SCHEME
An ideal to be approached for the decoupled load-flow methods is the constant matrix load-flow of reference-5 referred in this document as BGGB-method. In an attempt to imitate it, a decoupled class of methods with simultaneous (1V, 1B) iteration scheme depicted by sequence of relations (21) to (25) is invented. This scheme involves only one mismatch calculation in an iteration. The correction vector is calculated in two separate parts without intermediate updating. Each iteration involves one calculation of [RQ], [0V], and [RP], [D8] to update [V] and [B].
[0V] _ [YV] 1 [RQ] (21) [RP] _ [OP/V] - [G] [~V] (22) Inventor: Sureshchandra Patel Vanderbrent Crescent, Etobicoke, Ontario, M9R 3W9 E-mail: trutth@hotmail.com [oe] _ [Ye] -' [RP] (23) [e] _ [e] + [oe] (24) [v] _ [v] + [vv] (2s) In this invented class, each method differs only in the definition of elements of [RQ] and [YV]. The accuracy of methods depends only on the accuracy of calculation of [~V]. The greater the angular spread of branches terminating at PQ-nodes, the greater the inaccuracy in the calculation of [0V].
Advanced Super Decoupled Load-Flow: BX-version (ASDLBX) When both sides of relations (1) and (2) are divided by Cosine of nodal rotation angles (Cos~p), with [RP] and [RQ] defined respectively by (7) & (8) and [YA] & [~V]
defined respectively by (12) and (13) with the factor 0.9 taken 1.0, leads to simple variants involving application of super decoupling to both the sub-problems, only to P-B sub-problem and only to Q-V sub-problem. Numerically the most successful version is that of Super Decoupling applied only to the Q-V sub-problem. Therefore, BX-type Fast Super Decoupled Load-Flow method consists of sequence of relations (3) to (6), which is Successive (1B, 1V) Iteration Scheme. This is referred to as BX-FSDL in this document, where the definition of elements of [RP], [RQ], [YB] and [YV] are given by (26) to (29).
RPp = OPp / Vp (26) RQp = [OQp - (G~ i B~) OPp] / Vp -for PQ-nodes (27) YBpq = -B~ and YV~ _ _1/X~ (28) Y6pp = ~Y9pq and YVpp = -2bp + ~YV~ (29) It should be noted that Amerongen's General-purpose Fast Decoupled Load-Flow method of reference-3 has turned out to be an approximation of this method. The approximation involved is only in relation (27). However, numerical performance is found to be only slightly better but more reliable than that of the Amerongen's method. This method is embodied in Algorithm-1 and in the flow-chart of Fig.l.
Advanced Super Decoupled Load-Flow: BGX'-version (ASDLBGX') Numerical performance could further be improved by organizing the solution in a simultaneous ( 1 V, 1 B) iteration scheme represented by sequence of relations (21 ) to (25).
The elements of [RP], [RQ], [YB] and [YV] are defined by (30) to (36).
Inventor: Sureshchandra Patel Vanderbrent Crescent, Etobicoke, Ontario, M9R 3W9 E-mail: trutth@hotmail.com RQp = [~Qp' - (Gpp' / Bpp') OPp'] / Vp -for PQ-nodes (30) m RPp = (OPp / Vp) - ~ Gpq OVq (31) q=1 YBpq = -Bpq and YVpq = -1/Xpq' (32) YBpp = ~ Y9pq and YVpp = -2bp + ~ YVpq (33) 9'P 4>P
by = bpCos~p or by = by (34) Where, OPp' = OPpCOS~p + OQpSin~p -for PQ-nodes (35) OQp' _ -~PpSin~p + OQpCOS~p -for PQ-nodes (36) The ASDLBGX' method comprises relations (21) to (25), and (30) to (36). It is embodied in algorithm-2 and in the flow-chart of Fig.2.
Advanced Super Decoupled Load-Flow: BGX'-version (ASDLBGY) If unrestricted rotation is applied and transformed susceptance is taken as admittance values and transformed conductance is assumed zero (reference-5), the ASDLBGX' method reduces to ASDLBGY as defined by relations (37) to (41).
RQp = OQp'/Vp = (OPpCOS~p + ~QpSln~p)/Vp -for PQ-nodes (37) m RPp = (OPp / Vp) - qE Gpq ~Vq Yepq = -BPq and YVpq = -ypq (39) Yepp = ~ Y9pq and YVpp = -2bp' + ~ YVpq (40) 9>P 9>P
by = bpCos~p or by = by (41 ) The ASDLBGY method comprises relations (21) to (25), and (37) to (41). It is embodied in algorithm-2 and in the flow-chart of Fig.2.
Inventor: Sureshchandra Patel Vanderbrent Crescent, Etobicoke, Ontario, M9R 3W9 E-mail: trutth@hotmail.com Advanced Super Decoupled Load-Flow: BGX-version (ASDLBGX) If no (zero) rotation is applied, the ASDLBGX' method reduces to ASDLBGX as defined by relations (42) to (46).
RQp = [OQp - (G~ i B~) OPp] / Vp -for PQ-nodes (42) m RPp = (~Pp / Vp) - ~iG~ OVq (43) Y9~y = -B~ and YV~ _ -1/Xpq (44) Y6pp = ~Y6pq and yV~ _ _2bp + ~yV,,~ (45) bp' = bpCos~p or by = by (46) The ASDLBGX method comprises relations (21) to (25), and (42) to (46). It is embodied in algorithm-2 and in the flow-chart of Fig.2.
In all the prior art and invented models [YB] and [YV] are real, sparse, symmetrical and built only from network elements. Since they are constant, they need to be factorized once only at the start of the solution. Equations (1) and (2) are to be solved repeatedly by forward and backward substitutions.
[Y8] and [YV] are of the same dimentions (m+k) x (m+k) when only a row/column of the slack-node is excluded and both are triangularized using the same ordering regardless of the node-types. For a row/column corresponding to a PV-node excluded in [YV], use a large diagonal to mask out the effects of the off diagonal terms. When the node is switched to the PQ-type the row/column is reactivated by removing the large diagonal.
This technique is especially useful in the treatment of PV-nodes in the matrix [YV].
It is invented to make this technique efficient while solving (5) for [~V] by skipping all PV-nodes and factor elements with indices corresponding to PV-nodes. In other words efficiency can be realized by skipping operations on rows/columns corresponding to PV-nodes in the forward-backward solution of (5). This has been implemented and time saving of about 4% of the total solution time (including input/output) could be realized in 14-14 iterations required to solve 118-node system with the uniform R-scale factor of 4 applied. However, this saving is not possible in case of Novel Fast Super Decoupled method because PV-nodes are also active. The time saving has been assessed on PC-XT.
It should be noted that the same indexing and addressing information can be used for the storage of both the matrices as they are of the same dimension and sparsity structure.
Inventor: Sureshchandra Patel Vanderbrent Crescent, Etobicoke, Ontario, M9R 3W9 E-mail: trutth@hotmail.com Computation steps of ASDLBGX', ASDLBGY and ASDLBGX methods (Algorithm-2):
a. Read system data and assign an initial approximate solution. If better solution estimate is not available, set all the nodes voltage magnitudes and angles equal to those of the slack-node. This is referred to as the slack-start.
b. Form nodal admittance matrix, and Initialize iteration count ITRP = ITRQ= r = 0.
bc. Compute sine and cosine of nodal rotation angles using relations (9) and (10), store them. If they, respectively, are less than the sine and cosine of any angle set (say -36 degrees), equate them, respectively, to those of (say -36 degrees).
cc. Form (m+k) x (m+k) size matrices [Y9] and [YV] of (1) and (2) respectively each in a compact storage exploiting sparsity 4) In case of ASDLBGX'-method, the matrices are formed using relations (32), (33), and (34) 5) In case of ASDLBGY-method, the matrices are formed using relations (39), (40), and (41 ) 6) In case of ASDLBGX-method, the matrices are formed using relations (44), (45), and (46) In [YV] matrix, replace diagonal elements corresponding to PV-nodes by very large value (say, 10.0** 10). In case [YV] is of dimension (m x m), this is not required to be performed. Factorize [YB] and [YV] using the same ordering of nodes regardless of node-types and store them using the same indexing and addressing information. In case [YV] is of dimension (m x m), it is factorized using different ordering than that of [Y8].
d. Compute residues 0P (PQ- and PV-nodes) and ~Q (at only PQ-nodes). If all are less than the tolerance (E), proceed to step (m). Otherwise follow the next step.
ee. Compute the vector of modified residues [RQ] using (30), (35), and (36) for only PQ-nodes. Solve (21) for [0V]. While solving equation (21), skip all the rows and columns corresponding to PV-nodes. Compute the vector of modified residues [RP] using (31) or (38) or (43). Solve (23) for [D8].
ff. Update voltage angles using, [8] _ [8] + [OA]. and update PQ-node voltage magnitudes using [V] _ [V] + [0V].
g. Set voltage magnitudes of PV-nodes equal to the specified values, and Increment the iteration count ITRP=ITRP+1 and r=(ITRP+ITRQ)/2.
m. Calculate line flows and output the desired results It can be seen that steps-i and j of algorithm-1 are combined with steps-ee and ff in algorithm-2, and steps-h and k are eliminated in algorithm-2. The ASDLBGX', ASDLBGY and ASDLBGX algorithms differ only in step-cc defining gain matrices.
Fig.2 is the flow-chart embodiment of algorithm-2.
Inventor: Sureshchandra Patel Vanderbrent Crescent, Etobicoke, Ontario, M9R 3w9 E-mail: trutthQbotmail.com APPENDIX
Transformation of Branch Admittance The branch admittance transformation for symmetrical gain matrices of the FSDLXB,FSDLBX, NFSDLXB and NFSDLBX methods is given by the following steps:
1. Compute: ~P = arctan (GPp/B~) and aiCtan (G99~B94) (f7) 2. Compute the average of rotations at the terminal nodes (p and q) of a branch:
~ay = (~P + ~q)~2 (48) 3. Compare ~a~ with the Limiting Rotation Angle (LRA) and let ~", to be the smaller of the two:
Via" = minimum (fi"., LRA) (49) 4. Compute transformed pq-th element of the admittance matrix:
G~' + jB~,' _ (Cos ~$" + jSin Via") (G~ + jB~) (50) 5. Note that the transformed branch reactance is:
X~~ - 8~~~(G~,2 + B~~z) (5I) and similarly XPP~ __ BPP~~(G~~2 + BPPe2) (52) REFERENCES
Foreign Patent Document US Patent Number: 4868410 dated September 19, 1989.
Canadian Patent Document 2. Canadian Patent Application Number: 2107388, and Titled Super Decoupled Load-Flow methods. Applicant and Inventor name: Sureshchandra Patel Other Publications 3. Robert A.M. Van Amerongen, "A general-purpose version of the Fast Decoupled Load-Flow", IEEE Trans., VoI.PWRS-4, pp.760-770, May 1989.
4. P.H.Haley and M.Ayres, "Super Decoupled Load-Flow with distributed slach bus", IEEE Trans., VoI.PAS-104, pp.104-113, January 1985.
5. S.B.Patel, "Fast Super Decoupled Loadflow", IEE proceedings Part-C, Vo1.139, No.l, January 1992.
6. S.B.Patel, " Transformation based Fast Decoupled Loadflow", Proceedings of 1991 - IEEE region-10 international conference (IEEE TENCON'91, New Delhi), VoI.I, pp.183-187, August 1991.
BRIEF DESCRIPTION OF DRAWINGS
Fig. 1 is a flow-chart of prior art load-flow computation systems Fig. 2 is a flow-chart embodiment of the invented load-flow computation systems Fig. 3 is a flow-chart of the overall controlling method for an electrical power system using one of the load-flow computation systems of Figs. 1 or 2.
~ .~ ~r ~- ~i c ~ .D S U ~ x-12 ~ c co a p L~ D ~ o ~ ~ ~ L o ~
c.~ u~ ~ ~Q ~ ca ~ ~ ~ ~,e-e~ 6 -Q~.~ m,~ dQ ~ .~ n~,v vi c~ e~
S .~ ~ ~ ~ .e.~,uc~,.~1 cd1 S ~~ ~t'~ 2 ~ e.P Zit r~.,~ 2 c~n.C.c 1.~~,'°'~1 °b V~~:lt-~g ~ crmg,~ ~ cn~.~d ~ ~~'an i ~~ ~ ~-'v~ ec-~; °~S - ~-.err-(,, 9 e~co~n.~r ~ ~ r1 o d ~-.~ c~-n ~~.i s ~ ~~~~ ~b '~.''~~ °'~'~ cc~
c~ 1 D V P/tt ''a'~~ t 'a'1 ~ 2 ~~'tq'~1 ~ ~ t °'~ ~ e-..~ ~Y1~1 ~!~.~
P~ ~ ~ ~~ r ~y ~~ ~ ~ v-' '~e ~ .
C p ~] _ ~- ct~
_ .- CZ>
C ~ C~ v~
_~~~, i ~_.~ /~
~ic~, ~v~
~u ~ S a .~.~V ~ tN ~'I
tin t S S ~ ~ ~. C
i t- PJI cn.~'1 ~ ~'~ 'V ~9.~V~ ~
i m r~1'~'~1 ~d~.m"'~-2 '~pd ~..ti n ~ ~ ~c.G~
G,~ pa ~ ~d ~r-~ ~.~~ ~ v ~ ~~-, C v ~ . rig i s s ~-tn ~'» 2 c r,.~ c v~ o..h ~ ~
~1 eat vu ~ ~ 'gin ~ ~rn ~1 -2 L ~2 P ~ G~nP~ C ~ ~~ ~ a a ~ c v~-~-~'- ~o-~ o''!~ ~"~ U'"2'3 ~ 2cc,~ v~
.~, ~ ~, e~ ,~ ~ ~c ~-~t ~ ~~ .~ -a V'~'~ ~ . '~"~ ~ s ~ ~. vru- ~
,~ a l r.~-h'~~~ C3 ~ , Clc ~ , ~'~ o~.~ C 6' c~ ~' p ~ c ~'I
c~ ,,~ ~.~ r~.~'~
~ sc,Li ~ ~' ~ _ ~ _ ~ _.
r b~~ v ~Y~~ ~
o~~ _ _ ~ --C
Q ~ _, ~ ~---C,~Y~ ~~~~ __ ,~~ _ ~~~ ~- ~~ v~
C
° eo'v~ 1 ~ I m i r ~I c~'1~ s ~ ~
~ P~ Pos e~
y'~m a .~ ~~
d a o~.Q 1-~ 6 ~ w(' p~tn ~c.~ ~ ~ ~ a d a c o ~ ~( ~
c~ '~ ~ '~ o ~ ~ Q ~ as 't-~, ~ c ~ ~-u~.,~' rt ~~ i x 6 U; (f ~ '~ o ~ a .~ ~. r ~ - ~ ~ ~ t- o~rW h 1'n ~ '~ Yn i (' ~
C
at a ~ ~ ~ 2~ C.~ ~ °'6 "~''~ 0 d P .~ In9 ~'1'1~ ~ i 'm v~l-~1 ~
d i p ~~~ I' ~ b ~ s ~.a >n ~"W ~ '1r' irk tv~ I r9, Cq~ C~), C 1~ ~ CI2-' i s P.~,D Ped C~~~ ~ , ~ 7n , ~ ~-n r~.r"c-fig ce-~ ~ c,~'~~ °'~ 'v' ~ ~ ~~ C ~ c''a °''( e.~ ' fi ~ o~~h °'~1, , ~ v7 ~ r~ a-~ ~11 (~~ W
~ S ~ vW ~-- ~ °'sL t-S : ~'~ t- C
a _ C~Yj C ~~~ -C~avJ c~ L.~v~
C~ ~ ~ = C°~ ~ c ~ __-.-_ c ~~ _--_. _ _r C
C ~~ _ C m~ ~~p~ --a~ + ~~~ -- -bra V _ w~ ~. ~,bw~
~ -r.-~.o ~ a ~ d ~' ~Y o~t,~ cm d e~; ~,; ti ~u1 .~ ~t ~-~1 ~
o~, d~ ~''~-'y °~'n1 r~ a ~ c ~ ~ a c y ~ ccwW ~~J °~ '>'no~ ~~ ~ ~o..f ~1 'the- G"r'~'~~l S P
C a~~ cv..~ c~'' °~s'1 ~ C ~ ''~~ 1" W h ~ '~ ~ _ ,~,, o d ~ , r ~ ~-9~r ~ off- ~I t-1 b~lw~,ch ~ fi ~ t'~ ~-h'~~~ ~t ~ ~'1M c~.C'~ ~'a'~ 1~L, 2 o ~ , L2~ Cyy _ ~d~~
p~, e~ ~-~ ~ a ~.r.~~t-~ ~ ~. 7 , .~ ~r 3~
/~ d3 ~P 'V'~ ~Pl$-a.od ~' -p _ b P ~ ~P r P ~ ~ .-- s,~
_'~o~~, - C
_,~P s~~,~n~- a~n~~s~p~l'~P ~P~
P' ~Y_a~~~ ~' D Pp ~tcp P~ ) ~ --is y9 ~ C.PY_~,od o~s A~bS~.l~-- ~. ~P ~ w C:O 1 ~ p - ' APP ~_j ~''-- ~ --~~~PP t APP
, C
SI'a'~ ~~ , _,_, ~-pp ~,z ~ ~ Z- ._ ,--Pp f~~' ' YP~ ~ ~ ~ o I~LW1 b.~a~r~~n Q-~' ~ ~ t q - ~3 p c~ ~'i b.~ a'~.~, ~ c ~r, ~r~, t cl-~J b Q..~w ~-~ 1-In,ro P v --~~ et f ca~Y,~ w, a S.~c~.c.~- ~,..od e, rid c, w_ ~,,~(~
y vp _ "' yP ~ ~ ~..c~ b ~ U,~,~ ~
q ~ ~'~,q ~ yYPP ~ - 2 b~ ~- ~ -'YY9 _ ---- ~2r~
a-~Q ~-~P
t'~'! G~a~G. ~ ~'>~ i r i-tc~n r a '~"n G~r~r~ i 't''hd (~.. 1~~ C t ~ s ~ ~ o~~ ~ ~-.~ n ~..i c_ s t 9-,-~ ov, ,-'t-s ,~.,,~ s ~ ~ ~ ~ c. ~ , ~-.t ~~-~I~tn ~ rw d g U.i ~ ~n r.~.M ~~ c ~ d ~' ~ t"~ t~,~..t~ d ~~a ~-r,~"d,,~ ~.rt ~ ~b'' ~yv~ ~d d~ h'~,o.,~.l~ c~.ko~..~-~ t-wl"c e_ t-~ c 6~ y~ol~h ~ ~ ~"'~~
e-tsy.r~ to''tladp~di~t~- ~--O
b y ~ea~~,~ °'r~t C 2 L~ ~' ~'~ ~I ~3 ~ ~t ~-f' ~~ b~.um cln ~.1 car, ~~c~t-~
t~ ~e.kw e..Q.~ t-w D 'P~'.~-'~ a d ~ ~'l ~ Qv~ ~n,e et t4 c~.D t-v. ~e..._ S.l ~~ ~ ne d e~ ~"~1 a~, ~. cG.r, '~ ~. ~~ ~ o ~ v~' ~ wo~.~ s ~.h'~
~D h y ~u.~'a~~. ~ c ~ ai ~ ~no~'~t"c ~Q
1 "x'1 .~"h G ,t G~ i U ~a'bt In~ f 2~ , ~'1 2 r l 1''~ 'm ~ a ~ t-~ e~ ~ rd "~~ ~. y ~Pq = Yupq , Gc a-rt ~ o~ ~ t-i~ L- ~ c,,~-v~ I< p ~ ~ ~ e~ t'~ i c 1- o..~ t-" v. 'n'!
t~ ~~ ~ r ~ ~'~st 6,e.. tZ~~n e.~1 ~ ~, ~ b ~ ~- Pa ~-t ; b ~ ~
G~ly ~rtG~ 'r''~ ~.~ ~~Y~1 ~ s ~ ~
~-~t '~"~1 e.r~ ~~1,~~2~d 1'1 ~-~. ro c~
oa ~ ~-~
~ ~'~ d t.el b ~ c ~3 ~ '~ a ~ ~u, d t-..Q ~ fl t'~.~h~ ~
.~ ~c~.. q P-v s ~ ~, Q ~ ~ v~a~"~c~.~,,~-!r ~'r vv ~ vi ~, ~ ~ n ~" ~ ~' ~
s v~ o,~ n ~ co~..:~" and ~ b n T'LI t-'~ a sue, ,~.~ 1~ .~ v~r~ tv P~- A S'''~6 P.~ta'h ~ Q-n., ~. ~ o~t.N 1-0 ~Q-- v s ~ P~ h .~ ~ .
Lvrn o~ i c e~~ 'Nn a ~ t- ~ ~ cc ~ ~( 'Y ~," ~°~ 'r-k r.~fi ~~S'v~,P
Pil ~rrl t-t~ a ~ _ v/ s ~ ~Jt;~ b ~~ . ~ ~ oft ~
m~ o~ ~ f3 x s f'~ v ~ S~ ~ D a ~ ~ ~ a~-o c.~ ~.~ ~-n ~ ~
earn s s f ~ °~ s ~&~~ ~b eat vm.h" o~-~ ~ i ~ ~ C 2' w h ~ ~ ~ '~'l ~ c~cJl~ a ~ ~ ~ ~R P~ ~ nC'.~~~ C ~' ~.~ r~''''~ ~I ~~ ~''~ ~e y-'' v~ Q'Y1 r -, y 'V' f ~ n ~ ~'\j.~t ~a 'R~ = P ~ P
(gP "' C ~P P ~ n ~ ~p (~
PP
P
- ~ ~eP~, --y ~~~t ~. z. J, ~ ~ ~_ ~ VPq _ ~ ~xY~ ~~P P - P
VP q r P ~~ P~~'e-fi k v~~ (~'~ ~1 cry g P-ai l Cc ~
S~ ~~~ H~ fi~ ~ d~ ~
Lo o~-A 6-~.v~
F'~ f ~ ,, Q~ . .crh ~ ~ ~~.x f m ~~°'~l iwv ~~ro~
P n w ~1 'm ~ ~ i ci,.l Pw~ ~ c ~ ~ s 1 S ~~ ~~I C'~~-~?
I~ ~~ ~.~ b ~.r~-~1 °v'''cD ' tro ~-e- °~'~ S d ~ g ~'S , -1 a ~ a~ ~ ~- fi~ u'~' 9'~ Gb ~ ~'~ rh ~ t~ a ~'~ f~~w v~
~i ~m o~~ c ~ ~~~'~ ~ c. ~ ~ ~ P~ , -c'~1 ~~t ~ ~u~t e~
,Sv~ ~ 9 ~ ccrv~ .lt '~ f Cory ~ 0 ~ ~ ~ ~ ~ ~ ~ P~ f/'~- ~ri ~L~ P ~ ~'~---nrn P.~w'~' .~~-v~e-~ ~ ~ ~,~,~,g Q,r,~t M 1- ~-Q-c~ '~ ~ _ S ~ P~ p ~c w~.D .~ ~D ~ ~D
c,~m ~-e- s ~,i o~ 1-~ 6-~~- c Gc ~ - L.e h.r~ r .~o~
a w ,~,~ d ~ i'~ a ~ ~ a ~~k~ ~ ~ a, c~
s ~ Yn v~.~.~1 ~ ~'U ~ 1 ~ ~ i t- P~ ~ ~1 S cat 4~i ~ ''! ~'~
t~)~ ~~~ ~~~ ~4>~ ~~~~ ~ ~2~ .
t~ ~ s ~ ~ c.~ ~, ~, r ~ v~-~, o.~ ~ ~ P ~ , C1~6~~ r ~y m~ ov,..a( ~'~ v~' Ova. e-~a ~~ . C~~, C~> ~ ~~~ .
h~P ~ b~P --. C~'~~ j a ~P ~'~' p~ p ' ' ' '~' _ ~ C
= ,a P ~~r ~-~'P9 x av _ P P P
9=I
r y ~ ~ ~- C~c.
f3 P y ~P P _ ~ P9 - -~ ~' _ _ 2 b ~ ~ ~ -y y~q '' x ~ y P~ P q -.gyp Pq ~ ; ~ ~ ~ ~ ~ c~J [~ ~n ~,~'s~ 'r» rn~, e.~-~t ~ c r~.~ g-ui ~
~ ~-~ i c ~! c ov~-~ b Q B b ~ ~ ~ b ~ fi~ ~ ~- a ~ ~ 1 Q ~ ~ ~ °~P~
Q''~i '~
aN ~ uy ~ °b ~,o ~~ °d'~ °~"~ ~' a 1-~; n~~.~ ~r,.~ d ~
o~ ~ b~,u~a-t~, tin-a b~c.~ o~'rn~ hh~ ~
r _ C ~P P
,o ~~ n ~ s ~ ~ ~_ ~-- C
~,urndi~'~r~ ~ s ~~~.c c~ W
~P ~ ~ ~ ~.d, m ~ tt~
l S G~~ ~~/Ir~ '~ ~ j 'h~ C~" 2 t~ .~ ~-3 r~ n ..~ ~d'v~c. ~ ~ c ~7 h o~
,~ p~ P
~~ S f x, ~P t Y _ .- ~-- ~-r a o ~--- (~r>
- ~ ,.---( P 9 ~ '' ~Pq ~ PV - P q~.P
ze~,o ~ ~,o t-~..h' ~ . s wPd~-t~'~, t-~,~ ~ d .- .a.-~,.~lac~
~, ~P _' ~vP
_ ~ .._.. - GcP~ ~- ~CS vp ~ ~ .-P
r ~ ~P ~t - ~ P~1 s y ~' ~, J ~2-10 p -~- ~,~ '-x ~q ~
~~ Q~, C~~~ ,~ ~> > C~-~ ~/ C33y ~'~y ~r> ~ ~~'' C~~ , C3 ~
(~ e~ C~ ~ ~L,~ ~ C 3'3~~ ~3-~~ J y ~~~ ( ~>i C'~~r r S C G G--P C4~~ ~ °~ m ~' L° ~ 4~i'1 Q~I,GuP
~-~, ~"'S-~ - 2-~ fib ~ i c ~ C~~y,~ ~ ~( e~
c~~.
coy can CZ~ ~ ~t~~, c~-), c~~, Cad>, C~~~ P ~3 c~-), C~ ,~~~~ .
Wt't~ Pin e~l o~n.t~- ~ ~t'~-~-~ o~.~l w, e. c.~~"~m e0 '~ e~.oBp a~ ~ ~ s P~ a '''~ ~ ,~ ~~.e( P~..,I- t- ~'~7 .~ ~e c~9~n ~~, ~'~v o-~ h~~.p~h~~ Y- b''~ ~'' ~ c~9 ~ '.Q~f ~
-n,, e. i- e~ ~~~t ~r ~- ~ ~-i ~~ ~ cwe ~'P ~
°'~'1 , ~ ryy, ~~cr,,,~ ~ Q- f-v P~'n.~ ,~ 'i'r' ~ t°1-'~'~' w2 P~.,v ~-~r ~~ ~ c~-e~ eel fi~ '~b ~i.~ a c~ ~
.. ~d.~~~1 ' o l r ~~~C~
n 1=~ fi S'~' ~ b Q.Co'~:~ ~ L:~ ~.d ~-.iQ.o-~? ~~
~ ~ ~~.- ~.,~,~ C ~ ed ~ ~~ pa~~,t"-_ ~ ~ ,~ . ) 3 ~', r~ a ~ 1 ~ ~~ rn~ ~q 9'2, ~ . ,3 , Qv~ C~, ' ~ S ~ ~ p a c du,~ ~ ~ La ~ ~-~-u v~ ~ ~~ a covnc~ i c~ p aLg~~ .~n"c wh~v,r~ ~ o . : z.
~ b ~' o9-n"1. ~'rn enu~,~~ " ~- ~, Q,,n ~,,~,~.,~~ p~d~-~..
~f ~- p~2CDV~,(I.~ ~
w ~ '~'~
I~~t, ~C,,l~r~ ~r S ~,~Y, ~C~e~.,~1 ~-,cr~ c~..c.~,,..~..~..t, Q~~-'t S~~r~-~, f.
~l S ~ r~.~t-~-,~'' ~ , Lt, fs 6 ~ ~. ~ ~
~ ~~ .~e-P y k~ C ~ ° '~~ ~.~
P~~ s ~~ ,gin ~~; s ~~ s ~ ~~fih ~ ~
C'~t~t-~.. ~c!~ b~ ~I. , ~!~rn,~ r2.~.o (~ ~ . s~.eC'~~I
P~ ~g--~..~.~. ~-- ~ vrr e~ ~ fig, e~ '~ ~ ~
~~r-o c ~ e.d ~ ~ !~ °~ ~-yw S t x t~ ~ ~nr''1'"Q p'c~''~e,~ S '~ ~'~
°'~'1.~PJI, G~ ~ 'L ~.T ~ ~Gc ~ D '(Z- f ~ ~''Yn '~'~ 7~.~ ~
~t ~"~- .T~ ~.~ ( 9 9 sr o, o ~ ~~ d o~-,~ c ~ ~ ~ ~ '~ ~ ~ ~ , L3 v~ ~.~n v~ s'h~G~ I~~'~' ~'' I~u~'unn d'~.~.~ ~r ~ 'b~
L t --1~~
,.:fit-~1 ~t~~ t~ a u. ~r . ~' I
t~ ~~~ : ~'~ ~ 1 ~--~ o t-'~~ l tz-.-t-~-"T
= ~6
Claims
1. A method of controlling a power system, comprising the following steps:
a) Obtain on-line data of voltages and phases at main nodes, and/or main line flows and nodal injections in a power system b) Establish an initial specification amount of real power and voltage magnitudes and reactive power at other nodes at generator nodes. Real power specification at generator nodes is obtained from the consideration of economics in the operation of power systems.
c) Perform load-flow computation for a power system by any of the Advanced Super Decoupled Load-flow methods invented employing simultaneous (1V, 1.theta.) iteration scheme using the different definition of gain matrices as detailed in the description and in the steps of algorithm-2 of carrying out of the invention. (steps-cc, -ee and -ff in flow-chart of fig.2).
d) Evaluate the load-flow computation for limit violations.
e) Establish correction that corrects the control adjustment amount and repeat the load-flow computation and limit violation evaluation steps until no limit violations are evaluated.
f) Effect actual control to set obtained control amount of real/reactive power injections and voltage magnitudes at different points in the system after the evaluating step finds a good power system without violations.
a) Obtain on-line data of voltages and phases at main nodes, and/or main line flows and nodal injections in a power system b) Establish an initial specification amount of real power and voltage magnitudes and reactive power at other nodes at generator nodes. Real power specification at generator nodes is obtained from the consideration of economics in the operation of power systems.
c) Perform load-flow computation for a power system by any of the Advanced Super Decoupled Load-flow methods invented employing simultaneous (1V, 1.theta.) iteration scheme using the different definition of gain matrices as detailed in the description and in the steps of algorithm-2 of carrying out of the invention. (steps-cc, -ee and -ff in flow-chart of fig.2).
d) Evaluate the load-flow computation for limit violations.
e) Establish correction that corrects the control adjustment amount and repeat the load-flow computation and limit violation evaluation steps until no limit violations are evaluated.
f) Effect actual control to set obtained control amount of real/reactive power injections and voltage magnitudes at different points in the system after the evaluating step finds a good power system without violations.
Priority Applications (6)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CA 2400580 CA2400580A1 (en) | 2002-09-03 | 2002-09-03 | Systems of advanced super decoupled load-flow computation for electrical power system |
| PCT/CA2003/001312 WO2004023622A2 (en) | 2002-09-03 | 2003-08-29 | System of super super decoupled loadflow computation for electrical power system |
| CA 2548096 CA2548096C (en) | 2002-09-03 | 2003-08-29 | Method of super super decoupled loadflow computation for electrical power system |
| EP03793529A EP1661224A2 (en) | 2002-09-03 | 2003-08-29 | System of super super decoupled loadflow computation for electrical power system |
| AU2003260221A AU2003260221B2 (en) | 2002-09-03 | 2003-08-29 | System of super super decoupled loadflow computation for electrical power system |
| US10/570,023 US7769497B2 (en) | 2002-09-03 | 2003-08-29 | Method of super super decoupled loadflow computation for electrical power system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CA 2400580 CA2400580A1 (en) | 2002-09-03 | 2002-09-03 | Systems of advanced super decoupled load-flow computation for electrical power system |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CA2400580A1 true CA2400580A1 (en) | 2004-03-03 |
Family
ID=31954501
Family Applications (2)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CA 2400580 Abandoned CA2400580A1 (en) | 2002-09-03 | 2002-09-03 | Systems of advanced super decoupled load-flow computation for electrical power system |
| CA 2548096 Expired - Lifetime CA2548096C (en) | 2002-09-03 | 2003-08-29 | Method of super super decoupled loadflow computation for electrical power system |
Family Applications After (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CA 2548096 Expired - Lifetime CA2548096C (en) | 2002-09-03 | 2003-08-29 | Method of super super decoupled loadflow computation for electrical power system |
Country Status (5)
| Country | Link |
|---|---|
| US (1) | US7769497B2 (en) |
| EP (1) | EP1661224A2 (en) |
| AU (1) | AU2003260221B2 (en) |
| CA (2) | CA2400580A1 (en) |
| WO (1) | WO2004023622A2 (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113809749A (en) * | 2021-08-31 | 2021-12-17 | 西安理工大学 | Virtual impedance-based particle swarm optimization method for MG (generator) containing droop control DG (distributed generator) |
Families Citing this family (24)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CA2400580A1 (en) * | 2002-09-03 | 2004-03-03 | Sureshchandra B. Patel | Systems of advanced super decoupled load-flow computation for electrical power system |
| US8849614B2 (en) | 2002-11-06 | 2014-09-30 | Gridquant, Inc. | System and method for monitoring and managing three-phase power flows in electrical transmission and distribution networks |
| US20040153303A1 (en) * | 2002-12-30 | 2004-08-05 | Le Tang | Efficient process for time dependent network model in an energy market simulation system |
| CA2479603A1 (en) * | 2004-10-01 | 2006-04-01 | Sureshchandra B. Patel | Sequential and parallel loadflow computation for electrical power system |
| CN100370389C (en) * | 2004-11-04 | 2008-02-20 | 哈尔滨工业大学 | Power supply network voltage reactive-load remote control real-time optimization control method |
| KR101043572B1 (en) * | 2009-08-10 | 2011-06-22 | 한국전력공사 | Distribution Automation System and its voltage control method for reactive power compensation |
| US8756047B2 (en) * | 2010-09-27 | 2014-06-17 | Sureshchandra B Patel | Method of artificial nueral network loadflow computation for electrical power system |
| CN102255322B (en) * | 2011-07-15 | 2013-01-30 | 广东电网公司电力科学研究院 | Method for interactively iterative control of voltage reactive power of regional power grid |
| CN102722594B (en) * | 2011-11-29 | 2014-09-17 | 中国南方电网有限责任公司 | Method for integrating offline mode data and state estimation data |
| US9640994B2 (en) * | 2012-02-24 | 2017-05-02 | Mitsubishi Electric Research Laboratories, Inc. | Decoupled three-phase power flow analysis method for unbalanced power distribution systems |
| US9563722B2 (en) * | 2012-11-13 | 2017-02-07 | Gridquant, Inc. | Sigma algebraic approximants as a diagnostic tool in power networks |
| US9450409B2 (en) * | 2013-06-20 | 2016-09-20 | Abb Research Ltd. | Converter station power set point analysis system and method |
| CN103441495B (en) * | 2013-08-28 | 2015-07-29 | 三川电力设备股份有限公司 | The discrimination method of power system component parameter and corrected coefficient of power and system |
| US9548607B2 (en) * | 2014-07-31 | 2017-01-17 | Oren Meiri | System and method for monitoring and controlling electrical network |
| US11853384B2 (en) | 2014-09-22 | 2023-12-26 | Sureshchandra B. Patel | Methods of patel loadflow computation for electrical power system |
| US20180048151A1 (en) * | 2014-09-22 | 2018-02-15 | Sureshchandra B. Patel | Methods of Patel Loadflow Computation for Electrical Power System |
| US10197606B2 (en) | 2015-07-02 | 2019-02-05 | Aplicaciones En Informática Avanzada, S.A | System and method for obtaining the powerflow in DC grids with constant power loads and devices with algebraic nonlinearities |
| WO2018009837A1 (en) * | 2016-07-07 | 2018-01-11 | University Of Hawai'i | Dynamic reactive compensation |
| CN109217295B (en) * | 2018-09-20 | 2020-05-29 | 吉林大学 | Load flow sensitivity calculation method for preventing system overload and computer device |
| CN109858061B (en) * | 2018-11-13 | 2023-06-30 | 天津大学 | Power distribution network equivalence and simplification method for voltage power sensitivity estimation |
| CN110518591B (en) * | 2019-08-22 | 2021-06-15 | 中国农业大学 | Load flow calculation method for uncertain power system |
| CN111523800B (en) * | 2020-04-22 | 2023-03-31 | 中车株洲电力机车研究所有限公司 | Rapid calculation method for node conductance matrix in subway load flow calculation |
| CN114243690A (en) * | 2021-12-15 | 2022-03-25 | 国网河北省电力有限公司 | Power grid active safety correction method and device, electronic equipment and storage medium |
| CN114204560A (en) * | 2021-12-15 | 2022-03-18 | 国网上海市电力公司 | Medium voltage distribution network line parameter identification method |
Family Cites Families (17)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US4868410A (en) * | 1986-09-10 | 1989-09-19 | Mitsubishi Denki Kabushiki Kaisha | System of load flow calculation for electric power system |
| JPH0785623B2 (en) * | 1989-02-01 | 1995-09-13 | 三菱電機株式会社 | Power system voltage stability determination system |
| US5081591A (en) * | 1990-02-28 | 1992-01-14 | Westinghouse Electric Corp. | Optimizing reactive power distribution in an industrial power network |
| JPH04112619A (en) * | 1990-09-03 | 1992-04-14 | Hitachi Ltd | Distribution line interrupting method, interrupter and using method thereof |
| US5566085A (en) * | 1992-09-24 | 1996-10-15 | Hydro-Quebec | Stability transfer limit calculation in a power transmission network |
| CA2107388C (en) * | 1993-11-09 | 2011-07-05 | Sureshchandra B. Patel | Method of fast super decoupled loadflow computation for electrical power system |
| CA2188674A1 (en) * | 1994-04-29 | 1995-11-09 | Robert Anthony Schlueter | Method for improving voltage stability security in a power transmission system |
| US6313752B1 (en) * | 1998-05-21 | 2001-11-06 | Steven P. Corrigan | System for displaying dynamic on-line operating conditions of an interconnected power transmission network |
| CA2259055A1 (en) * | 1999-01-14 | 2000-07-14 | Franco Poletti | Load power reduction control and supply system |
| ES2320310T3 (en) * | 2000-03-10 | 2009-05-21 | Abb Schweiz Ag | METHOD AND DEVICE FOR EVALUATING THE STABILITY OF AN ELECTRICAL TRANSMISSION NETWORK. |
| DE10013037A1 (en) * | 2000-03-17 | 2001-10-18 | Siemens Ag | Method for projecting an electrical system and projecting device |
| US6917124B2 (en) * | 2000-10-27 | 2005-07-12 | Liebert Corporation | Uninterruptible power supply |
| DE60012193D1 (en) * | 2000-12-01 | 2004-08-19 | Abb Schweiz Ag | Method and device for evaluating the stability of an energy transmission system |
| ES2364451T3 (en) * | 2001-05-21 | 2011-09-02 | Abb Research Ltd. | STABILITY FORECAST FOR AN ELECTRICAL POWER NETWORK. |
| CA2400580A1 (en) * | 2002-09-03 | 2004-03-03 | Sureshchandra B. Patel | Systems of advanced super decoupled load-flow computation for electrical power system |
| US7519506B2 (en) * | 2002-11-06 | 2009-04-14 | Antonio Trias | System and method for monitoring and managing electrical power transmission and distribution networks |
| CA2479603A1 (en) * | 2004-10-01 | 2006-04-01 | Sureshchandra B. Patel | Sequential and parallel loadflow computation for electrical power system |
-
2002
- 2002-09-03 CA CA 2400580 patent/CA2400580A1/en not_active Abandoned
-
2003
- 2003-08-29 WO PCT/CA2003/001312 patent/WO2004023622A2/en active Search and Examination
- 2003-08-29 EP EP03793529A patent/EP1661224A2/en not_active Withdrawn
- 2003-08-29 CA CA 2548096 patent/CA2548096C/en not_active Expired - Lifetime
- 2003-08-29 AU AU2003260221A patent/AU2003260221B2/en not_active Ceased
- 2003-08-29 US US10/570,023 patent/US7769497B2/en not_active Expired - Fee Related
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113809749A (en) * | 2021-08-31 | 2021-12-17 | 西安理工大学 | Virtual impedance-based particle swarm optimization method for MG (generator) containing droop control DG (distributed generator) |
| CN113809749B (en) * | 2021-08-31 | 2024-01-23 | 西安理工大学 | Method for optimizing particle swarm of MG based on virtual impedance and comprising droop control DG |
Also Published As
| Publication number | Publication date |
|---|---|
| AU2003260221A8 (en) | 2004-03-29 |
| CA2548096A1 (en) | 2004-03-18 |
| WO2004023622B1 (en) | 2005-01-06 |
| EP1661224A2 (en) | 2006-05-31 |
| WO2004023622A3 (en) | 2004-05-21 |
| US20080281474A1 (en) | 2008-11-13 |
| AU2003260221A1 (en) | 2004-03-29 |
| CA2548096C (en) | 2011-07-05 |
| US7769497B2 (en) | 2010-08-03 |
| WO2004023622A2 (en) | 2004-03-18 |
| AU2003260221B2 (en) | 2010-06-17 |
| WO2004023622A8 (en) | 2004-12-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CA2400580A1 (en) | Systems of advanced super decoupled load-flow computation for electrical power system | |
| Irisarri et al. | Maximum loadability of power systems using interior point nonlinear optimization method | |
| WO2006037231A1 (en) | System and method of parallel loadflow computation for electrical power system | |
| Migoni et al. | Efficient simulation of hybrid renewable energy systems | |
| Shi et al. | An improved bus aggregation technique for generating network equivalents | |
| CN106159955A (en) | Based on the power system distributed optimal power flow method punishing Duality Decomposition continuously | |
| CN106294022B (en) | A kind of Jacobian matrix redundancy storage method for static security analysis | |
| Tong et al. | A novel method of power flow analysis with UPFC considering limit violations of variable | |
| Ara et al. | Optimal location of hybrid flow controller considering modified steady-state model | |
| Castro et al. | Real-power economic dispatch of AC/DC power transmission systems comprising multiple VSC-HVDC equipment | |
| CA2712873A1 (en) | Method of artificial neural network loadflow computation for electrical power system | |
| CN109560552A (en) | Pricing method, device, computer equipment and the storage medium of power grid distribution | |
| CA2661753C (en) | Method of loadflow computation for electrical power system | |
| Gallego et al. | A specialized genetic algorithm to solve the short term transmission network expansion planning | |
| Korres et al. | A constrained ordering for solving the equality constrained state estimation | |
| Gupta et al. | Determination of Available Transfer Capability and its enhancement in Competitive electrical market | |
| Memaripour | Power flow in distribution system with consideration of distributed generation | |
| CA2564625C (en) | Method and apparatus for parallel loadflow computation for electrical power system | |
| Kumar et al. | A load flow algorithm for radial systems having renewable energy generation sources | |
| Castro et al. | Reduced-Order Modeling of a Lithium-Ion Lithium Iron Phosphate Battery | |
| CA2107388C (en) | Method of fast super decoupled loadflow computation for electrical power system | |
| Makarov et al. | Determining static stability boundaries using a non-iterative method | |
| Hsu et al. | Distributed Newton method for computing real decoupled power flow in lossy electric energy networks | |
| CN110365021B (en) | Ring-containing distribution network load flow calculation method | |
| Yang et al. | An Accelerated ADMM for Distributed DC Optimal Power Flow |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| FZDE | Discontinued |