Beruflich Dokumente
Kultur Dokumente
School of Technology
_________________________________________________________________________
Assignment No 2
Assessment No.: 2 of 2
Assessment Weighting:
Estimate of Assessment Duration: At Least 25 hours
Please note there are changes in the undergraduate regulations, more information can be
found in the module handbook.
Issue No 1 (01/11)
Introduction:
Load flow studies are used to determine the voltage, current and power, (both the active and
reactive components and their associate power factors), at all the node points in a specific power
system.
Load flow studies should indicate the likely behaviour of the system in terms of:
The flow of MW and MVAR in the various branches of the network
The precise bus-bar voltages
Effects of any partial rearrangement of the system inter-connections, or the consequences of
adding further networks
The outcome of any loss of overhead line or underground cable
The results of changes in transformer tap position
The optimum performance of the system with minimum losses
Justification for any recommended system improvements.
The complexity of obtaining a formal solution for load flow in a power system arises because of the
differences in the type of data specified for the various nodes, (bus bars), of the system.
At the SLACK BUS, (see lecture notes for definition), the voltage magnitude and angle will be
designated. At the remaining generator, (supply), nodes the usual information available is the active
power supplied and the voltage magnitude. Note, in this assignment there are no other generator
nodes except at the slack bus bar. This considerably simplifies the actual assignment work. Nodes
with output loading are usually conditioned by their active and reactive power demand. Although
the formulation of sufficient equations is not difficult, the closed form of solution is not practical.
Consequently, a digital solution of load flow problem is required. This will need to follow an iterative
process, initially requiring estimated values be assigned to the unknown bus voltages.
2
The voltage at one of the bus bars is then recalculated from the estimated values at the other
nodes.A corrected value is obtained and this is then used in performing similar calculations to obtain
a corrected voltage at the next bus. Each bus voltage is corrected in turn around the system, the
process then being repeated until sufficient convergence is obtained.
3. Work to be undertaken:
(1) Carry out a series of computer simulations for power flow for the 5-Buse/Node - seven-line
network - Power Network shown in figure 1-A and report it. Further information and
necessary technical parameters are available on table 1 and support material available in
the assignment and UDo.
(2) Analyse the results of each simulations and provide the necessary graphical analysis of the
results
(3) Explain your own thoughts, observation for each simulations and comment on it
3
Figure 1-A: 5-Buse/Node - seven-line network - Power Network
Table 1:
From
To Busbar R (p.u.) X (p.u.) B (p.u.)
Busbar
1 2 0.05 0.11 0.02
1 3 0.05 0.11 0.02
1 5 0.03 0.08 0.02
2 4 0.04 0.09 0.02
2 5 0.04 0.09 0.02
3 4 0.06 0.13 0.03
4 5 0.04 0.09 0.02
4. In completing this assignment the student will have developed skills in:
b) Developing algorithms to describe the methodology for solving the electrical power load flow
problem in power network.
4
5. Assignment resources:
The University of Derby, Faculty of Arts Design and Technology, Electrical Power
Laboratory.
Assignment Support Material
Lecture notes available on the university black board
Reference text books available in the library
5
Assessments
In order to pass the module THIS ASSESSED WORK MUST BE ATTEMPTED AND THE WORK
SUBMITTED VIA THE STUDENT OFFICE. Assessment is based upon the achievement or non-
achievement of learning outcomes and the grade achieved. In evaluating the student’s performance
the assessor compares the product with the set of grade descriptors shown in the Assessment
Grade table in the Assessment Regulations handbook or Rights, Responsibilities and Regulations
handbook. The alpha grade, achievement or non-achievement of learning outcome(s) are reported
on the Student Assessment Record and Receipt Form
Learning outcomes for the assessed work are specified within the module in the Programme
Learning Outcomes, Module Learning Outcomes, Indicative Content, Teaching and Learning
Strategies, Resource and Assessment Methods handbook.
Assessment Criteria:
A+ to B+: Outstanding, of exceptionally high standard to a very good standard. Completion of all
parts of the work with correctly calculated results and extensive analysis as required. Your
conclusions must be comprehensive, correct and thoroughly justified. The work presented must be
of the highest standard, with appropriate diagrams and extensive numerical analysis. During the
actual laboratory period you have demonstrated a leadership in organising and interpreting
instructions, assembling the test circuits and proceeding with the test programme using safe and
efficient practices.
6
Suggested Contents
You may follow the following steps to write your assignment.
1. Executive Summary
I expect that each student is to conduct his own survey about the assignment topics and report his
own findings. The survey is to cover the assignment technology, applications, and needs. You need
also to make yourself familiar with the latest Industrial and Academic publications available related
to you assignment applications. This is to be followed by the structure of your report and main topics
that have been covered. Then explain the findings of your assignments and skills that you have
learned from the work carried out from Analysis, design, development and practical point of view.
2. Assignment Aims and Objectives
You need to specify clearly your assignment main aims and objectives.
3. Algorithm 1 & 2 and 3
Explain the basic principles of each algorithm
4. Flowchart of each Algorithm
You need to provide a flowchart for each Algorithm and CD contains your reporting and
programmes.
5. Computer Programmes and Simulations
Provide your programme using MATLAB and Simulation using Simulink and or Power Flow Tools
6. Results, graphs and Discussions
You need to explain the numerical and the graphical results of your programming. Then write your
own comments.
7. Conclusions
8. References
9. Appendices
10. Risk Assessment
a) You need to read and understand the risk Assessment for Electrical Power Laboratory MS123.
b) You need to read and understand the safety and operation of the machines test rigs available of
the Laboratory
c) You need to include a risk assessment for your assignment. A copy of the form can be obtained
from room MS123.
7
Supporting Materials
At the slack busbar the voltage is made reference at 1 p.u. The remaining busbars all have connected
loads for which the values of P and Q are specified.
Table 1 gives the series impedance of the interconnecting lines. Each line is associated with
capacitive shunt admittance. This is to be BOTH ignored and included at the various stages of the
analysis. Hence, the effect of the shunt capacitance in relation to the resulting node voltage
distribution of the network will be determined.
The network base quantities are MVA base = 100 MVA and V base = 132 kV.
Table 1:
From Busbar To Busbar R (p.u.) X (p.u.) B (p.u.)
1 2 0.05 0.11 0.02
1 3 0.05 0.11 0.02
1 5 0.03 0.08 0.02
2 3 0.04 0.09 0.02
2 5 0.04 0.09 0.02
8
3 4 0.06 0.13 0.03
4 5 0.04 0.09 0.02
The method of formulation of the network admittance matrix is covered in the ‘Introductory Lecture
Notes to Load Flow Studies’. On this basis the line admittances can be calculated, see Table 2.
Table 2:
The complete system admittance matrix can now be determined. In Table 3a: the effects of shunt line
admittance have not been included.
Table 3a:
Admittance
Matrix
- shunt
capacitance
10.958905 - 3.424658 - 3.424658 - 4.109589
0
- j 26.027398 + j 7.534247 + j 7.534247 + j 10.958904
- 3.424658 11.672080 - 4.123711 - 4.123711
0
+ j 7.534247 - j 26.090949 + j 9.278351 + j 9.278351
- 3.424658 - 4.123711 10.475198 - 2.926829
0
+ j 7.534247 + j 9.278351 - j 23.154061 + j 6.341463
- 2.926829 7.050541 - 4.123711
0 0
+ j 6.341463 - j 15.619814 +j 9.278351
- 4.109589 - 4.123711 - 4.123711 12.357012
0
+ j 10.958904 + j 9.278351 +j 9.278351 - j 29.515606
The effects of the shunt admittance in each line must now be included. The shunt admittance of each
line which connects to a particular node must now be added to the diagonal element of that node.
Since the shunt elements are capacitive, the result of incorporating them into the admittance matrix
will reduce the magnitude of the complex element in the diagonal terms.
9
Table 3b:
Admittance
Matrix
+ shunt
capacitance
10.958905 - 3.424658 - 3.424658 - 4.109589
0
- j 25.997397 + j 7.534247 + j 7.534247 + j 10.958904
- 3.424658 11.672080 - 4.123711 - 4.123711
0
+ j 7.534247 - j 26.060948 + j 9.278351 + j 9.278351
- 3.424658 - 4.123711 10.475198 - 2.926829
0
+ j 7.534247 + j 9.278351 - j 23.119061 + j 6.341463
- 2.926829 7.050541 - 4.123711
0 0
+ j 6.341463 - j 15.594814 +j 9.278351
- 4.109589 - 4.123711 - 4.123711 12.357012
0
+ j 10.958904 + j 9.278351 +j 9.278351 - j 29.485605
10
Method No1 - Jacobi Method:
The Jacobi method is the simplest of the iterative load-flow techniques to program. It is a straightforward
process whereby successive sets of busbar voltages are calculated using the previously obtained values. The
complete range of busbar voltages are calculated before they are then used in the next iteration.
From the introductory load-flow notes it was shown that the basis of the iterative solution is based on the
matrix form of the network’s nodal equation:
n
I k = ∑Ykj Vj ; Where k = 2, 3… n
j =1
S*k
Ik = ; k = 2, 3, …. N (1)
Vk*
Substituting for I k
S*k n S*k n
= Yk kVk + ∑ Yk jVj
Vk*
= ∑
j =1
Yk j Vj or Vk*
j= 1
j≠ k
where k = 2, 3, …. N
1
n
S*k
Vk( i +1) =
Ykk Vk* (i )
− ∑
j =1
Yk j Vj(i )
j ≠k
Calculation:
11
The solution strategy is based on all system admittances and busbar conditions being available and an initial
voltage assigned to each busbar. A flow diagram of the iterative process is indicated below.
The number of nodes n = 5
And since the voltage at node (1) is specified
The actual range of k = 2, 3, 4, 5.
The step by step process is now demonstrated by numerically solving the first set of iterations for the
network illustrated in Fig1.
12
The MATLAB program code for the JACOBI SOLUTION of the network load-flow problem can
now be written.
13
Matlab Program.
% Module 6EJ022
% Assignment No2
% YEAR 2010/11
% STUDENT ...........
% Input (1)
% Insert the Network Admittance Matrix
% (see page 2 of supplied assignment paperwork ignoring shunt capacitive
admittance)
format short
Y(1,1) = 10.958905 - 26.027398i;
Y(1,2) = -3.424658 + 7.534247i;
Y(1,3) = -3.424658 + 7.534247i;
Y(1,4) = 0.00;
Y(1,5) = -4.109589 + 10.958904;
Y(4,1) = 0.00;
Y(4,2) = 0.00;
Y(4,3) = -2.926829 + 6.341463i;
Y(4,4) = 7.050541 - 15.619814i;
Y(4,5) = -4.123711 + 9.278351i;
% Input (2)
% Input the given node loadings .....see diagram on page 1 ....
% .... of the supplied assignment paperwork
% A positive (+ sign) is for generated power,
% The negative (- sign) indicates load taken from the network.
% Per unit loading is used with a base loading taken at 100MVA
14
P3 = - 0.25; % p.u. active power loading
P4 = - 0.4; % p.u. active power loading
P5 = - 0.5; % p.u. active power loading
% JACOBI SOLUTION
% The number of iteration will need to be set
% Set the value of 'l' the chosen number of iterations
% Typically l=40 should be sufficient for this problem.
row = ones(size(vector));
Vnode1 = row; % each node voltage has the required storage spaces
Vnode2 = row;
Vnode3 = row;
Vnode4 = row;
Vnode5 = row;
for n = 1:m
end
for n = 1:l
15
I2(n) = S2star/V2star(n);
I3(n) = S3star/V3star(n);
I4(n) = S4star/V4star(n);
I5(n) = S5star/V5star(n);
u = 1 + n;
Vnode2(u) = V2(n);
Vnode3(u) = V3(n);
Vnode4(u) = V4(n);
Vnode5(u) = V5(n);
end
disp (':')
disp (':')
disp (':')
disp (':')
disp (' Vnode2 Vnode3 Vnode4 Vnode5
')
disp(':')
d = 0;
for c = 1:l
fprintf(' %1.4f %1.4fi\t, %1.4f %1.4fi\t, %1.4f %1.4fi\t, %1.4f
%1.4fi\n',...
real(Vnode2(1+d)), imag(Vnode2(1+d)), real(Vnode3(1+d)),...
imag(Vnode3(1+d)), real(Vnode4(1+d)), imag(Vnode4(1+d)),
real(Vnode5(1+d)), imag(Vnode5(1+d)));
d=d+1;
end
The Matlab output program code for the JACOBI SOLUTION of the network load-flow problem.
Whereas the Jacobi method calculates new values for all the bus bar voltages before replacing the old values
of voltage with those newly calculated, the Gauss-Seidal method updates the individual bus bar voltage
immediately after it is calculated. This leads to a faster convergence to the final solution.
17
n
I k = ∑Ykj V j where k = 2, 3, …. n
j =1
S*k
Ik = k = 2, 3, …. n
Vk*
1 S*k n
Vk = * (i ) − ∑ Yk j Vj
Ykk Vk j= 1
j≠ k
Since the Gauss-Seidal approach updates each node voltage immediately an improved value is
calculated, the actual solution strategy will need to follow steps indicated below.
S*2
(1) For node (2) I2 = *
V2
n
2
* and ∑Y
j =1
3j Vj but
j ≠3
with the updated value of V2 obtained from Step (3) then the node(3) voltage can be updated.
(5) Subsequently, repeat the process, using the most recently calculated values of node voltages
to update the node(4) voltage.
(6) And again, repeat the process, using the most recently calculated values of node voltages to
update the node(5) voltage.
(7) Compare the latest set of voltages with the previous set. If the two sets agree within defined
limits, then the process is complete, otherwise return to Step 1.
18
This step by step process can now demonstrated by numerically solving the first set of iterations for
the network illustrated in Fig1.
19
The Matlab program code for the GAUSS SEIDAL SOLUTION of the network load-flow problem
can now be written.
Note the many copy and paste opportunities that exist between the existing Jacobi codes when
subsequently producing the Gauss Seidal code.
Matlab Program.
20
% BSc(Hons) Electrical Electronic Engineering
% Module 6EJ998
% Assignment No2
% YEAR 2010/11
% STUDENT ...........
% Input (1)
% Insert the Network Admittance Matrix
% (see page 2 of supplied assignment paperwork ignoring shunt capacitive
admittance)
format short
Y(1,1) = 10.958905 - 26.027398i;
Y(1,2) = -3.424658 + 7.534247i;
Y(1,3) = -3.424658 + 7.534247i;
Y(1,4) = 0.00;
Y(1,5) = -4.109589 + 10.958904;
Y(4,1) = 0.00;
Y(4,2) = 0.00;
Y(4,3) = -2.926829 + 6.341463i;
Y(4,4) = 7.050541 - 15.619814i;
Y(4,5) = -4.123711 + 9.278351i;
% Input (2)
% Input the given node loadings .....see diagram on page 1 ....
% .... of the supplied assignment paperwork
% A positive (+ sign) is for generated power,
% The negative (- sign) indicates load taken from the network.
% Per unit loading is used with a base loading taken at 100MVA
21
P4 = - 0.4; % p.u. active power loading
P5 = - 0.5; % p.u. active power loading
row = ones(size(vector));
Vnode1 = row; % each node voltage has the required storage spaces
Vnode2 = row;
Vnode3 = row;
Vnode4 = row;
Vnode5 = row;
for n = 1:m
end
for n = 1:l
22
I2(n) = S2star/V2star(n);
% (Step 4)
% Now determine the new value of Vnode3
% This calculation uses the new updated value of Vnode2
I3(n) = S3star/V3star(n);
Sum3(n) = (Y(3,1) * Vnode1(n)) + (Y(3,2) * Vnode2(n)) + (Y(3,4) *
Vnode4(n));
V3(n) = ( I3(n) - Sum3(n) ) / Y(3,3);
Vnode3(n) = V3(n); % Immediately updates the current value of Vnode3
% (Step 5)
% Now determine the new value of Vnode4
% This calculation uses the new updated value3 of Vnode2 and Vnode3
I4(n) = S4star/V4star(n);
Sum4(n) = (Y(4,3) * Vnode3(n)) + (Y(4,5) * Vnode5(n));
V4(n) = ( I4(n) - Sum4(n) ) / Y(4,4);
Vnode4(n) = V4(n); % Immediately updates the current value of
Vnode4
% (Step 5)
% Now determine the new value of Vnode5
% This calculation uses the new updated value3 of Vnode2 Vnode3 & Vnode4
I5(n) = S5star/V5star(n);
Sum5(n) = (Y(5,1) * Vnode1(n)) + (Y(5,2) * Vnode2(n)) + (Y(5,4) *
Vnode4(n));
V5(n) = ( I5(n) - Sum5(n) ) / Y(5,5);
Vnode5(n) = V5(n); % Immediately updates the current value of Vnode4
u = 1 + n;
Vnode2(u) = V2(n);
Vnode3(u) = V3(n);
Vnode4(u) = V4(n);
Vnode5(u) = V5(n);
end
disp (':')
disp (' Electrical Power Utilisation 6EJ022 ')
disp (':')
disp (' Gauss Seidal Solution of Load Flow Assignment(2) 2010/11 ')
disp (':')
disp (' Successive Iteration Values ')
disp (':')
disp (' Vnode2 Vnode3 Vnode4 Vnode5
')
disp(':')
d = 0;
for c = 1:m
23
fprintf(' %1.4f %1.4fi\t, %1.4f %1.4fi\t, %1.4f %1.4fi\t, %1.4f
%1.4fi\n',...
real(Vnode2(1+d)), imag(Vnode2(1+d)), real(Vnode3(1+d)),...
imag(Vnode3(1+d)), real(Vnode4(1+d)), imag(Vnode4(1+d)),
real(Vnode5(1+d)), imag(Vnode5(1+d)));
d=d+1;
end
The Matlab output program code for the GAUSS SEIDAL SOLUTION of the network load-flow
problem.
To reduce the number of iterations required to reach a final solution, attempts have been made to speed up the
convergence process. A simple yet effective approach is to project forward each calculated voltage in the
direction of the way the iteration values are moving. If the trend indicate indicates the successive values are
reducing a factor is applied to accelerate this progression. Conversely, if there is a rising trend, then the
accelerating factor needs to project the voltage further upwards.
The acceleration factor α needs to modify the voltages according to the following considerations:
The Matlab program code for the GAUSS SEIDAL SOLUTION of the network load-flow problem
can now be modified to include a suitable ACCELERATION FACTOR.
Matlab Program.
% Module 6EJ998
% Assignment No2
25
% YEAR 2010/11
% STUDENT ...........
% Input (1)
% Insert the Network Admittance Matrix
% (see page 2 of supplied assignment paperwork ignoring shunt capacitive
admittance)
format short
Y(1,1) = 10.958905 - 26.027398i;
Y(1,2) = -3.424658 + 7.534247i;
Y(1,3) = -3.424658 + 7.534247i;
Y(1,4) = 0.00;
Y(1,5) = -4.109589 + 10.958904;
Y(4,1) = 0.00;
Y(4,2) = 0.00;
Y(4,3) = -2.926829 + 6.341463i;
Y(4,4) = 7.050541 - 15.619814i;
Y(4,5) = -4.123711 + 9.278351i;
% Input (2)
% Input the given node loadings .....see diagram on page 1 ....
% .... of the supplied assignment paperwork
% A positive (+ sign) is for generated power,
% The negative (- sign) indicates load taken from the network.
% Per unit loading is used with a base loading taken at 100MVA
26
% GAUSS SEIDAL PLUS ACCELERATION FACTOR SOLUTION
% The number of iteration will need to be set
% Set the value of 'l' the chosen number of iterations
% l=40 will be used since this is the number in the JACOBI solution.
row = ones(size(vector));
Vnode1 = row; % each node voltage has the required storage spaces
Vnode2 = row;
Vnode3 = row;
Vnode4 = row;
Vnode5 = row;
for n = 1:m
end
for n = 1:l
I2(n) = S2star/V2star(n);
27
Vnode2(n+1) = V2(n); % Immediately updates the current value of Vnode2
% (Step 4)
% Now determine the new value of Vnode3
% This calculation uses the new updated value of Vnode2
I3(n) = S3star/V3star(n);
Sum3(n) = (Y(3,1) * Vnode1(n)) + (Y(3,2) * Vnode2(n+1)) + (Y(3,4) *
Vnode4(n));
V3(n) = ( I3(n) - Sum3(n) ) / Y(3,3);
Vnode3(n+1) = V3(n); % Immediately updates the current value of Vnode3
% (Step 5)
% Now determine the new value of Vnode4
% This calculation uses the new updated value3 of Vnode2 and Vnode3
I4(n) = S4star/V4star(n);
Sum4(n) = (Y(4,3) * Vnode3(n+1)) + (Y(4,5) * Vnode5(n));
V4(n) = ( I4(n) - Sum4(n) ) / Y(4,4);
% (Step 5)
% Now determine the new value of Vnode5
% This calculation uses the new updated value3 of Vnode2 Vnode3 & Vnode4
I5(n) = S5star/V5star(n);
Sum5(n) = (Y(5,1) * Vnode1(n)) + (Y(5,2) * Vnode2(n+1)) + (Y(5,4) *
Vnode4(n+1));
V5(n) = ( I5(n) - Sum5(n) ) / Y(5,5);
alpha = 1.25;
Vacc2(1) = 1;
Vacc2(n+1) = Vnode2(n) + alpha * (Vnode2(n+1) - Vnode2(n));
Vacc3(n+1) = Vnode3(n) + alpha * (Vnode3(n+1) - Vnode3(n));
Vacc4(n+1) = Vnode4(n) + alpha * (Vnode4(n+1) - Vnode4(n));
Vacc5(n+1) = Vnode5(n) + alpha * (Vnode5(n+1) - Vnode5(n));
Vnode2(n+1) = Vacc2(n+1);
Vnode3(n+1) = Vacc3(n+1);
Vnode4(n+1) = Vacc4(n+1);
Vnode5(n+1) = Vacc5(n+1);
end
disp (':')
disp (' Electrical Power Utilisation 6EJ022 ')
disp (':')
disp (' Gauss Seidal Plus Acceleration Factor Solution of Load Flow
Assignment(2) 2010/11')
disp (':')
disp (' Successive Iteration Values ')
disp (':')
disp (' Vnode2 Vnode3 Vnode4 Vnode5
')
disp(':')
d = 0;
for c = 1:m
28
fprintf(' %1.4f %1.4fi\t, %1.4f %1.4fi\t, %1.4f %1.4fi\t, %1.4f
%1.4fi\n',...
real(Vnode2(1+d)), imag(Vnode2(1+d)), real(Vnode3(1+d)),...
imag(Vnode3(1+d)), real(Vnode4(1+d)), imag(Vnode4(1+d)),
real(Vnode5(1+d)), imag(Vnode5(1+d)));
d=d+1;
end
The Matlab program output code for the GAUSS SEIDAL with ACCELERATION FACTOR
solution of the network load-flow problem.
Gauss Seidal Plus Accelerating Factor Note even faster convergence after Twelve Iterations
The Y-matrix methods used with the Jacobi and the Gauss Seidal techniques generally have a poor
convergence and in some cases the success iteration values may actually diverge. Much work has been
undertaken in an attempt to overcome the problem, but generally with inconclusive results.
Another approach to the solution of this problem is to use the Z-matrix method.
In the Y-matrix methods the network relationships are expressed in the form of an admittance matrix.
I = Y⋅ V
By inverting the Y-matrix equation we can derive an equation of the form
−1
V = Z⋅ I ….. where Z = Y
The Y-matrix is generally a sparse matrix, i.e. contains a significant number of zeros. On the other hand the
Z-matrix is always full and therefore provides an improved mathematical linkage between V and I.
It would appear that the system node voltages could be calculated in a more direct manner from the set of Z-
matrix equations. Unfortunately, no direct solution is possible. Once more an iterative strategy must be
adopted which will again produce a convergence to the required set of system voltages.
29
Since busbar 1 is taken as the slack busbar, for which the voltage conditions are fully specified, the remaining
nodal admittance equations will have the form:
In this form the Y-matrix is not square and therefore cannot be inverted. Rearranging:
′ ′ ′
Which can be written as I = Y ⋅ V where Y ' is square and non-singular and can be
inverted.
After inversion the following equation is obtained:
′ ′ ′ ′
V = Z ⋅ I where for the k th busbar I k = Ik − Yk1 V1
n n
Vk = ∑Z kj I j
j=2
− ∑Z
j=2
kj Yj1 V1
and
S*j
Ij =
V j*
The required computational strategy is one that uses these last two equations iteratively until a converged
′
voltage solution is obtained. Any Matlab code must be careful to designate the correct suffixes to the Z
′
which results from the inversion of Y matrix. The form of the computer program is illustrated below.
This program uses a block substitution technique similar to procedure followed in the Jacobi solution.
30
The step by step process of the Z-matrix method with block substation illustrated above can now
demonstrated by numerically solving the first set of iterations for the network shown in Fig1 on page 5.
Admittance Matrix but with the first row and column removed.
31
32
The Matlab program code for the Z-MATRIX WITH BLOCK SUBSTITUTION method of solution
for the given network load-flow problem can now be written.
Matlab Program.
% Module 6EJ998
% Assignment No2
% YEAR 2010/11
% STUDENT ...........
% Input (1)
% Insert the Network Admittance Matrix
% (see page 2 of supplied assignment paperwork ignoring shunt capacitive
admittance)
33
format short
Y(1,1) = 10.958905 - 26.027398i;
Y(1,2) = -3.424658 + 7.534247i;
Y(1,3) = -3.424658 + 7.534247i;
Y(1,4) = 0.00;
Y(1,5) = -4.109589 + 10.958904;
Y(4,1) = 0.00;
Y(4,2) = 0.00;
Y(4,3) = -2.926829 + 6.341463i;
Y(4,4) = 7.050541 - 15.619814i;
Y(4,5) = -4.123711 + 9.278351i;
% Input (2)
% Input the given node loadings .....see diagram on page 1 ....
% .... of the supplied assignment paperwork
% A positive (+ sign) is for generated power,
% The negative (- sign) indicates load taken from the network.
% Per unit loading is used with a base loading taken at 100MVA
% Z-MATRX SOLUTION
% The sub-matrix of the actual 5x5 network admittances (Y) ....
% but with the first row and column removed now needs to be obtained
% This sub-matrix is called Ysub and is easily derived from ....
% the network admittance matrix by using the following command
Ysub = Y(2:5,2:5);
34
Z = inv(Ysub);
A = [0;0;0;0];
Z = [A Z];
B = [0;0;0;0;0];
Zt = [B Z'];
Z = Zt';
row = ones(size(vector));
Vnode1 = row; % each node voltage has the required storage spaces
Vnode2 = row;
Vnode3 = row;
Vnode4 = row;
Vnode5 = row;
for n = 1:m
end
% STEP 1.
% Obtain the values of the constant terms ....
% from the summation of Z(kj)Y(j1)V(1)
for n = 1 : m
Const2 = Z(2,2) * Y(2,1) * Vnode1(n) + Z(2,3) * Y(3,1) * Vnode1(n) + Z(2,4) *
Y(4,1) * Vnode1(n) + Z(2,5) * Y(5,1) * Vnode1(n);
35
Const3 = Z(3,2) * Y(2,1) * Vnode1(n) + Z(3,3) * Y(3,1) * Vnode1(n) + Z(3,4) *
Y(4,1) * Vnode1(n) + Z(3,5) * Y(5,1) * Vnode1(n);
Const4 = Z(4,2) * Y(2,1) * Vnode1(n) + Z(4,3) * Y(3,1) * Vnode1(n) + Z(4,4) *
Y(4,1) * Vnode1(n) + Z(4,5) * Y(5,1) * Vnode1(n);
Const5 = Z(5,2) * Y(2,1) * Vnode1(n) + Z(5,3) * Y(3,1) * Vnode1(n) + Z(5,4) *
Y(4,1) * Vnode1(n) + Z(5,5) * Y(5,1) * Vnode1(n);
% STEP 2.
% Obtain the values of the node current input terms ....
% from Skstar/Vkstar
V2star(n) = conj(Vnode2(n));
V3star(n) = conj(Vnode3(n));
V4star(n) = conj(Vnode4(n));
V5star(n) = conj(Vnode5(n));
% STEP 3
% Calculate the new (update) value of node Voltage
u = 1 + n;
Vnode2(u) = V2(n);
Vnode3(u) = V3(n);
Vnode4(u) = V4(n);
Vnode5(u) = V5(n);
end
disp (':')
disp (' Electrical Power Utilisation 6EJ022 ')
disp (':')
disp (' Z-MATRIX Solution of Load Flow Assignment(2) 2010/11')
disp (':')
disp (' Successive Iteration Values ')
disp (':')
disp (' Vnode2 Vnode3 Vnode4 Vnode5
')
disp(':')
d = 0;
for c = 1:m
fprintf(' %1.4f %1.4fi\t, %1.4f %1.4fi\t, %1.4f %1.4fi\t, %1.4f
%1.4fi\n',...
real(Vnode2(1+d)), imag(Vnode2(1+d)), real(Vnode3(1+d)),...
imag(Vnode3(1+d)), real(Vnode4(1+d)), imag(Vnode4(1+d)),
real(Vnode5(1+d)), imag(Vnode5(1+d)));
d=d+1;
end
36
The Matlab program output code for the Z-MATRIX WITH BLOCK SUBSTITUTION method of solution
for the network load-flow problem.
:
Electrical Power Utilisation 6EJ022
:
Z-MATRIX Solution of Load Flow Assignment (2) 2010/11
:
Successive Iteration Values
:
Vnode2 Vnode3 Vnode4 Vnode5
:
1.0000 0.0000i , 1.0000 0.0000i , 1.0000 0.0000i , 1.0000 0.0000i
0.9554 -0.0382i , 0.9549 -0.0368i , 0.9340 -0.0569i , 0.9538 -0.0429i
0.9513 -0.0380i , 0.9507 -0.0366i , 0.9271 -0.0565i , 0.9492 -0.0428i
0.9511 -0.0382i , 0.9504 -0.0368i , 0.9267 -0.0569i , 0.9489 -0.0430i
0.9510 -0.0382i , 0.9504 -0.0368i , 0.9266 -0.0569i , 0.9489 -0.0430i
0.9510 -0.0382i , 0.9504 -0.0368i , 0.9266 -0.0569i , 0.9489 -0.0430i
Z-MATRIX with BLOCK SUBSTITUTION Note even faster convergence after Four Iterations
The block substitution procedure used in Method 4 is similar to some extent with the method used in the
Jacobi solution.
Possibly, by using a forward substation technique similar to that adopted in the Gauss Seidal method the
number of iterations in the Z-Matrix method can be reduced still further.
Using this approach, each value of node voltage must be immediately revised after each new calculated
update.
The Matlab program code for the Z-MATRIX SOLUTION WITH FORWARD SUBSTITUTION can easily
be produce by simple modification of the block substitution method, see program code below:
Matlab Program.
% Module 6EJ998
% Assignment No2
% YEAR 2010/11
% STUDENT ...........
37
% NETWORK (see Fig 1)
% Input (1)
% Insert the Network Admittance Matrix
% (see page 2 of supplied assignment paperwork ignoring shunt capacitive
admittance)
format short
Y(1,1) = 10.958905 - 26.027398i;
Y(1,2) = -3.424658 + 7.534247i;
Y(1,3) = -3.424658 + 7.534247i;
Y(1,4) = 0.00;
Y(1,5) = -4.109589 + 10.958904;
Y(4,1) = 0.00;
Y(4,2) = 0.00;
Y(4,3) = -2.926829 + 6.341463i;
Y(4,4) = 7.050541 - 15.619814i;
Y(4,5) = -4.123711 + 9.278351i;
% Input (2)
% Input the given node loadings .....see diagram on page 1 ....
% .... of the supplied assignment paperwork
% A positive (+ sign) is for generated power,
% The negative (- sign) indicates load taken from the network.
% Per unit loading is used with a base loading taken at 100MVA
% Z-MATRX SOLUTION
% The sub-matrix of the actual 5x5 network admittances (Y) ....
38
% but with the first row and column removed now needs to be obtained
% This sub-matrix is called Ysub and is easily derived from ....
% the network admittance matrix by using the following command
Ysub = Y(2:5,2:5);
Z = inv(Ysub);
A = [0;0;0;0];
Z = [A Z];
B = [0;0;0;0;0];
Zt = [B Z'];
Z = Zt';
row = ones(size(vector));
Vnode1 = row; % each node voltage has the required storage spaces
Vnode2 = row;
Vnode3 = row;
Vnode4 = row;
Vnode5 = row;
for n = 1:m
end
% STEP 1.
39
% Obtain the values of the constant terms ....
% from the summation of Z(kj)Y(j1)V(1)
for n = 1 : m
Const2 = Z(2,2) * Y(2,1) * Vnode1(n) + Z(2,3) * Y(3,1) * Vnode1(n) + Z(2,4) *
Y(4,1) * Vnode1(n) + Z(2,5) * Y(5,1) * Vnode1(n);
V2star(n) = conj(Vnode2(n));
I2(n) = S2star / V2star(n);
V2(n) = Z(2,2) * I2(n) + Z(2,3) * I3(n) + Z(2,4) * I4(n) + Z(2,5) * I5(n) -
Const2;
V2star(n) = conj(V2(n));
I2(n) = S2star / V2star(n);
V2(n) = Z(2,2) * I2(n) + Z(2,3) * I3(n) + Z(2,4) * I4(n) + Z(2,5) * I5(n) -
Const2;
V3star(n) = conj(V3(n));
I3(n) = S3star / V3star(n);
V3(n) = Z(3,2) * I2(n) + Z(3,3) * I3(n) + Z(3,4) * I4(n) + Z(3,5) * I5(n) -
Const3;
V4star(n) = conj(V4(n));
I4(n) = S4star / V4star(n);
V4(n) = Z(4,2) * I2(n) + Z(4,3) * I3(n) + Z(4,4) * I4(n) + Z(4,5) * I5(n) -
Const4;
V5star(n) = conj(V5(n));
I5(n) = S5star / V5star(n);
V5(n) = Z(5,2) * I2(n) + Z(5,3) * I3(n) + Z(5,4) * I4(n) + Z(5,5) * I5(n) -
Const5;
u = 1 + n;
40
Vnode2(u) = V2(n);
Vnode3(u) = V3(n);
Vnode4(u) = V4(n);
Vnode5(u) = V5(n);
end
disp (':')
disp (' Electrical Power Utilisation 6EJ022 ')
disp (':')
disp (' Z-MATRIX Solution of Load Flow Assignment(2) 2010/11 ')
disp (':')
disp (' Successive Iteration Values ')
disp (':')
disp (' Vnode2 Vnode3 Vnode4 Vnode5
')
disp(':')
d = 0;
for c = 1:m
fprintf(' %1.4f %1.4fi\t, %1.4f %1.4fi\t, %1.4f %1.4fi\t, %1.4f
%1.4fi\n',...
real(Vnode2(1+d)), imag(Vnode2(1+d)), real(Vnode3(1+d)),...
imag(Vnode3(1+d)), real(Vnode4(1+d)), imag(Vnode4(1+d)),
real(Vnode5(1+d)), imag(Vnode5(1+d)));
d=d+1;
end
The Matlab program output code for the Z-MATRIX WITH FORWARD SUBSTITUTION
method of solution for the network load-flow problem.
:
Electrical Power Utilisation 6EJ022
:
Z-MATRIX Solution of Load Flow Assignment (2) 20010/11
:
Successive Iteration Values
:
Vnode2 Vnode3 Vnode4 Vnode5
:
1.0000 0.0000i , 1.0000 0.0000i , 1.0000 0.0000i , 1.0000 0.0000i
0.9512 -0.0381i , 0.9506 -0.0367i , 0.9269 -0.0567i , 0.9490 -0.0429i
0.9510 -0.0382i , 0.9504 -0.0368i , 0.9266 -0.0569i , 0.9489 -0.0430i
0.9510 -0.0382i , 0.9504 -0.0368i , 0.9266 -0.0569i , 0.9489 -0.0430i
Z-MATRIX with FORWARD SUBSTITUTION Now even faster convergence only Two Iterations
41
The solution of the network load flow problem network illustrated on page 5 has been solved using
the Matlab computer code supplied, (see pages 6 to 41).
Table 1A
From
To Busbar R (p.u.) X (p.u.) B (p.u.)
Busbar
1 2 0.05 0.11 0.02
1 3 0.05 0.11 0.02
1 5 0.03 0.08 0.02
2 4 0.04 0.09 0.02
2 5 0.04 0.09 0.02
3 4 0.06 0.13 0.03
4 5 0.04 0.09 0.02
42
Figure 1
43