Академический Документы
Профессиональный Документы
Культура Документы
state estimation correctness of the measurement data Load flow studies optimization minimization of production costs minimization of transmission losses optimization of the voltage level control transient calculation electromagnetic phenomena reliability calculation assessment of the system reliability
J.Partanen www.ee.lut.fi/fi/lab/sahkomarkkina/
Tasks
network reinforcements reactive power compensation analysis planning of an operation interruption symmetric fault analysis calculation of dynamic stability
J.Partanen www.ee.lut.fi/fi/lab/sahkomarkkina/
3.
4.
5.
J.Partanen www.ee.lut.fi/fi/lab/sahkomarkkina/
U, P,Q
Q, P,U
G
P,U Q,
P,Q U,
P,Q U,
5
J.Partanen www.ee.lut.fi/fi/lab/sahkomarkkina/
Power plants
Supplied active power Pg Terminal voltage U, to be maintained at the plant Reactive power generation and consumption capacity (Qmax, Qmin)
Lines
Impedances of the equivalent circuit (R, jX, G, jB)
Transformers
Short-circuit impedance (Rk, jXk)
Loads
Active and reactive power (P, jQ)
J.Partanen www.ee.lut.fi/fi/lab/sahkomarkkina/
Control principles for DC links (Finland-Sweden, FinlandRussia) Control parameters in calculation: method, convergency criterion, number of iterations, blockings (tap changers, compensators)
7
J.Partanen www.ee.lut.fi/fi/lab/sahkomarkkina/
Effect of the on-load tap changer of the transformer on the equivalent circuit
When operating by the rated transformation ratio, the transformer is presented as a series impedance when the transformation ratio deviates from the nominal value, two parallel impedances are added to the transformer circuit
Yt t
1 t Yt 2 t
t 1 Yt t
t = transformation ratio
We obtain the effect of the tap changer position on the admittance matrix elements Yii, Yij and Yjj
J.Partanen www.ee.lut.fi/fi/lab/sahkomarkkina/
Calculation result
Reference bus
559 167 559/-167 Active & reactive power of AJV4, 408/ the line and the direction 52.9
of active power
319/2
100 50
Load node
name
KLA4, 400/ 206/ 95 46.6
500 150
load
HYV, 398/
Generator node
LIE4,396/ INK4, 405/ 40.8 107/55 400 200 500 82 393/27 500 100 47.7
45.0
660 110
296/27
generation
J.Partanen www.ee.lut.fi/fi/lab/sahkomarkkina/
I ij =
U i U j Z ij
S i = U i I ij
Sh = I
2 ij
S j = U j I ij
Z ij
10
J.Partanen www.ee.lut.fi/fi/lab/sahkomarkkina/
Ui Yi0
I i = Y i 0 U i + Y ij (U i U j )
j
I i = Y i 0 + Y ij U i Y ij U j j j
J.Partanen www.ee.lut.fi/fi/lab/sahkomarkkina/
11
y
j
ij
J.Partanen www.ee.lut.fi/fi/lab/sahkomarkkina/
12
[J ] = [J1...J n ]T
1 4 1 2 2 5
5 1 0 1 8 2 [Y ] = 0 2 5 4 5 3
4 5 3 12
For large networks, the Y matrix is sparse; in other words, it includes plenty of zeros.
J.Partanen www.ee.lut.fi/fi/lab/sahkomarkkina/
13
S = P + jQ = UI*
Powers are expressed with currents
S i = Y i 0 + Y ij U i2 Y ij U j U i j j
Voltages are solved by iteration
Gauss-Seidel method Newton-Raphson method
J.Partanen www.ee.lut.fi/fi/lab/sahkomarkkina/
14
Pi jQi + Y ij U j Ui j Ui = Y i 0 + Y ij
j
we continue with the new values for voltage the process is repeated until the difference in voltages between the consecutive iterations is small enough converges slowly
J.Partanen www.ee.lut.fi/fi/lab/sahkomarkkina/
15
U p +1 = U p + (U p +1 U p ) = U p + U p
the selection of the multiplier depends on the network to be analyzed; 1.6 being a common value
J.Partanen www.ee.lut.fi/fi/lab/sahkomarkkina/
16
x1 =
f ( x0 ) f (x0 )
continued...
J.Partanen www.ee.lut.fi/fi/lab/sahkomarkkina/
17
[ f ( xi 0 )] = [J ][x]
[x] = [J ]1[ f ( xi 0 )]
J.Partanen www.ee.lut.fi/fi/lab/sahkomarkkina/
18
19
Si =U i Ii
Si =U i Ii
S i = Y i 0 + Y ij U i2 Y ij U j U i j
I i = Y i 0 + Y ij U i Y ij U j j j
Pi = Gi 0 + Gij U i2 U iU j (Gij cos ij + Bij sin ij ) j j Qi = Bi 0 + Bij U i2 U iU j (Gij sin ij Bij cos ij ) ij = i j j j
U i = U i i
j
Alternative representation
U j = U j i Pi jQi = U i yij U j ( ij + j i )
j
J.Partanen www.ee.lut.fi/fi/lab/sahkomarkkina/
20
Newton-Raphson method for load flow studies In the NR method for load flow studies, correction in voltages will be done by the mismatch P 1. Linearization of node equations
P P .. .. P1 U k 1 1 ... ... ... ... Pn1 ... ... n1 Q = ... ... U 1 1 ... ... ... ... Q Q .. .. Q U n1 n 1 U k 1
n = number of nodes
Pi = Pli Pi
Qi = Qli Qi Pli, Qli loads
J.Partanen www.ee.lut.fi/fi/lab/sahkomarkkina/
21
3. We find the inverse for the Jacobian matrix and solve the corrections for angles and voltages 4. We substitute new values to voltages and angles and calculate the new partial derivative matrix 5. We calculate the new power mismatches If the mismatches > given tolerance, we return to item 3 Finish
J.Partanen www.ee.lut.fi/fi/lab/sahkomarkkina/
22
23
Newton-Raphson method for load flow studies For each node, there are Pi, Qi, Ui and i
Si = U i I i Si = U i I i
I i = yijU j
j
Si = Pi jQi
Pi jQi = U i yijU j
j
Pi jQi = U i yij U j ( ij + j i )
Pi = yij U i U j cos( ij + j i ) Qi = yij U i U j sin ( ij + j i )
j j
J.Partanen www.ee.lut.fi/fi/lab/sahkomarkkina/
Problem
U1 U2
P2 2 Q = J U 2 2 and consider what would be a right initial guess for U2. Hints: S 2 = U 2 I S = U I 2 = P2 jQ2 2 2 2
I 2 = y 21U 1 + y 22 U 2
P2 jQ2 = U 2 y 21U 1 + U 2 y 22 U 2
P2 U1U 2 sin ( 2 1 ) X
J.Partanen www.ee.lut.fi/fi/lab/sahkomarkkina/
25
[P ] [J A ][J B ] [ ] [Q ] = [J ][J ] [U ] C D
JA dependence of active power on angle JB dependence of active power on voltage JC dependence of reactive power on angle JD dependence of reactive power on voltage
In a power transmission network, JB and JC can be assumed zero Construction of the Jacobian and finding its inverse become easier 2. Fast decoupled load flow (FDLF)
Assumptions: R << X lines Ui Uj contiguous nodes i j contiguous nodes
the Jacobian matrix replaced by real constant matrix has to be constructed and inverted only once
These accelerated (approximate) methods nevertheless give accurate results, because the calculated powers are always compared with the real ones.
J.Partanen www.ee.lut.fi/fi/lab/sahkomarkkina/
26
on the line i there is the element of the main diagonal + (i other nodes) the number of elements other than zero equalling the number of connections usually a node is connected only to a few (24) nearest nodes when the number of nodes increases, the dimension of the matrix increases quadratically, whereas the number of elements other than zero increases linearly
1 j5 3 j8 5 j15 6 j12 4 j10 2
0 0 0 15 10 5 10 10 0 0 0 0 5 0 25 12 8 0 [Y ] = 0 12 12 0 0 0 0 8 0 0 23 15 0 0 0 15 15 0
27
J.Partanen www.ee.lut.fi/fi/lab/sahkomarkkina/
for a matrix,
for the example network Z = 20, n = 6 S = 0.556 (55.6%) the sparsity depends only on network topology (connections) is constant for one network, changes in connections have an effect on the sparsity the matrix can be recorded by storing only the elements other than zero and their location data the saving in space becomes evident when the number of nodes increases, e.g. a Y-matrix of a 200 node network includes 40 000 elements, of which 1000 deviate from zero (assuming that there are 400 branches in the network)
J.Partanen www.ee.lut.fi/fi/lab/sahkomarkkina/
jatkuu...
28
1. the storage space requirement for a whole matrix is 40 000 storage locations 2. sequential tabulation requires:
element 1000 line 1000 column 200 total of 2200 locations
29