Direct solution of distribution systems
S.K. Goswami
Prof. S.K. Basu, PhD
Indexing terms: Mathematical techniques, Topology
Abstract: The paper reports on a direct power
flow solution technique for radial distribution net-
works. The special topology of distribution net-
works has been fully exploited to make direct
solution possible. A unique branch and node
numbering scheme has been proposed to achieve
storage and computational economy. Composite
load characteristics can be easily modelled. The
method developed has been extended for meshed
and unbalanced distribution networks. In both
cases, modifications required are few and the
advantages obtained in balanced radial networks
in respect of storage and computational require-
ments have been preserved. The proposed method
has been successfully applied to the solution of a
number of practical distribution networks.
List o f symbols
v. = source bus voltage
Ii = ith load node’s current
Z(i.i) = i-jth term of loop impedance matrix
u(i.j ) = i-jth term of upper triangular matrix
ZI = impedance of the path from source to the
Ith branch
U I , UI‘ etc. = elements of upper triangular matrix corre-
- sponding to ZI of the impedance matrix
ZI = impedance ZI plus impedance of the load
- connected to branch I
U1 = element of U matrix corresponding to
of Z matrix
1 Introduction
Distribution networks, with their radial configurations
and wide ranging resistance and reactance values, are
inherently ill-conditioned, and conventional Newton-
Raphson and fast decoupled load flow methods are inefi-
cient in solving such networks. Special load flow solution
methods and modified versions of the conventional
methods have, however, been suggested for solving such
ill-conditioned power networks [l-31. In view of the
topological speciality of distribution networks, and non-
applicability of the simplifying assumption of a decou-
pled Jacobian matrix normally applicable to the
transmission networks, researchers associated with the
distribution systems have proposed several special load
flow solution techniques for distribution networks [4, 61.
Paper 756W (P9), first received 5th December 1989 and in revised form
4th July 1990
The authors are with the Electrical Engineering Department, Jadavpur
University, Calcutta 700032, India
78
The authors in this paper have presented a new method
for the solution of radial distribution networks. The dis-
tribution network power flow problem has been formu-
lated as a problem of simple circuit solution, to make a
direct solution possible. Loads, in the present formula-
tion, have been represented as complex impedances
instead of constant P, Q. Load impedances are, however,
modified in stages to represent constant P , Q. Composite
loads also can be modelled in a similar way if the break
up of the loads is known. The authors have also devel-
oped a unique bus and branch numbering scheme to
achieve storage and computational economy.
Though a number of methods have been developed for
the solution of radial distribution networks, very few
could be found that discuss the problem of solving net-
works that have both radial and meshed lines. A
compensation-based power flow method has been given
by Shirmohammadi et al. [SI. Another method [SI] uses
bifactored Y bus formulation. Practical distribution
systems require unbalanced representation of both the
three phase network and the load. Typical distribution
feeder involves three phase, two phase and single phase
lateral lines, and loading, also, is mostly unbalanced.
Conventional symmetrical component methods, there-
fore, can not be used for such systems. Special methods
for unbalanced distribution systems are, however, avail-
able [ S , 8, 91.
The method developed by the authors for balanced
radial systems has also been extended for meshed and
unbalanced networks. Distribution systems that have
both radial and meshed lines are first converted into a
radial system and are then solved. The solution of the
radial system requires very minor adjustments to obtain
the solution for the actual system. Both for meshed and
three phase unbalanced network representations, the
storage and computational economy achieved for bal-
anced networks can be preserved. The algorithm,
however, has to be modified for the special cases.
The advantage of the proposed method is that con-
vergence is never a problem. A number of distribution
networks have been solved for which the Newton-
Raphson and fast decoupled method failed to converge.
2 Problem formulation
A distribution network has a typical tree structure, the
root of the tree being the feeding node. Unlike the trans-
mission networks, where the presence of a large number
of interconnections and so many voltage controlled buses
makes the network unfit for noniterative solution, a
unique set of equations can be written for a distribution
network by applying Kirchhoff’s law and inserting the
source bus in all the equations, if loads are represented as
constant impedances instead of constant complex power.
Thus the distribution system load flow problem becomes
IEE PROCEEDINGS-C, Vol. 138, N o . I , J A N U A R Y 1991
a problem of simple circuit solution. Referring to Fig. 1,
which represents a typical distribution network that has
20 load buses, a set of 20 equations can be written includ-
ing the source bus in all the equations.
‘ s = . Z ( I , I ) ’ ~+ ‘ ( , , 2 ) ’ 2 + . . .
VS = Z ( n , I)’, + Z ( n , 2 ) 1 2 + ’ ’
Zs in the above set of equations include the load imped-
ances, V’ being a known quantity. The above equations
can be solved directly for load currents.
3 Preprocessing of t h e original n e t w o r k
Fig. 1 shows the standard form of the distribution
network acceptable to the algorithm presented in this
paper. No node in the network is the junction of more
than three branches; one incoming and two outgoing
branches. Networks with any other configuration have to
be transformed into the standard form of Fig. 1. This can
easily be done by inserting dummy nodes and lines of
zero impedances in the appropriate positions. Fig. 2
shows an example. In Fig. 26, D L , , DL2 , D L , are dummy
lines required to transform the nonstandard configu-
ration (Fig. 2a) into standard form (Fig. 26).
1 1 2 process, the load node reached first will be assigned the
Though dummy lines are of zero impedance, zero
values in the impedance matrix will appear in the off-
diagonal terms if a dummy line is inserted at the source
bus. Since loads are represented by impedances, load
impedances (which have much higher values than the line
+ Z ( l , n ) I n
impedance) appear in the diagonal terms and therefore
the concept of introducing dummy lines does not cause
any solution problem.
+ Z(n,n)’n (1)
3.1 A unique numbering scheme
Systematic numbering of nodes and branches is not an
essential criterion for getting a direct solution, but it is a
necessity for memory and computational economy. There
are two types of branches, main lines and laterals. Clus-
ters of laterals originate from the junctions of the main
lines. In Fig. 1, lines 1 to 5 are the main lines and lines 6
to 39 are the laterals. Main lines are to be numbered first.
A line further from the source node has to be assigned a
higher number than a line nearer to the source. O n com-
pletion of the numbering of all the main lines, the first
group of laterals coming out of the junction of main lines
1 and 2 are to be numbered. Laterals connected directly
to the main lines may be called ‘main laterals’. From the
main laterals, there will always be two outgoing laterals.
Out of these two laterals, the one connected to the fewest
number of sublaterals, has to be assigned a higher level.
That subgroup of laterals is numbered first. Only after
the completion of numbering all the sublaterals con-
nected through the lateral of a high level will the remain-
ing group be numbered. In each sub group also, the levels
at every stage of numbering have to be selected. In this

9” 25
first number ( N , ) . Load nodes reached in the later stages
will be assigned sequentially higher numbers ( N 2 , N , ,
...). After numbering all the branches and nodes of the
laterals connected to the source node through a smaller
numbered main line, the numbering of the laterals con-
nected through the next higher numbered ‘main line’ is
completed. In this process, the load node connected to
the highest numbered main line will get the highest load
node number. Fig. 1 demonstrates the proposed number-
ing scheme. It can be noticed that nodes other than the
63 load nodes have not been assigned any number as this is
Fig. 1 Typical distribution network
not required for a solution. The purpose of the proposed
numbering scheme will become evident.
L3/
3.2 Topological description of the network
Information on the topology of the standardised radial
network, is to be put in a special format. Information on
two topologies is required :
(i) ‘Highest numbered load node ahead and behind a
line section’: Table 1 shows the complete information for
Fig. 1. For line section 1, the highest numbered load node
ahead is 20, and there is no load node behind, thus the
L14 \ highest numbered load node behind is 0. For branch 23,
L the load node ahead is 10 (only one), and the highest
a
numbered load node behind is 9. This particular format
of topological description is very informative.

Fig. 2
pc L10 L11

b
Transformation of nonstandard configuration into standard
(ii) The second piece of information required is the
‘line connected to a load node’, as line 7 is connected to
load node 1 in Fig. 1. Table 2 shows the complete list for
Fig. 1.

3.3 Formation of the impedance matrix

form
U Nonstandard configuration
IEE PROCEEDINGS-C, Vol. 138, No. I , J A N U A R Y 1991
b Equivalent standard form
The problem of load flow in a distribution network, as
formulated in an earlier section, is of the form V = ZI. Z
is effectively the loop impedance matrix for N number of
loops, N being the number of load nodes. The start of
19
each loop is the source bus. V is a column vector, each the impedance elements through which the current of the
element being the source bus voltage. Owing to the radial ith load node flows. This impedance also includes the ith
nature of the network, the formation of Z is very simple. node’s b a d impedance. The off diagonal term Z ( i j, ) on
The self impedance of the ith loop is the summation of all the other hand, is the impedance of that section of the
network which is common for both the ith and jth node.
Table 1 :.Input data-line w i t h associated load nodes
The special format of input data makes the task much
Line Load node Load node Line Load pode Load node easier.
ahead behind ahead behind The impedance matrix has many identical terms. For
1 20 0 21 9 8 example, the impedance of line section 1 of Fig. 1 is the
2 20 6 22 16 3 common impedance between the groups of loops 1 to 6
3 20 9 23 10 9 and 7 to 20. Similarly, impedance from the source up to
4 20 16 24 16 10
5 20 19 25 11 10
line 3 is common between the groups 10 to 16 and 17 to
6 6 0 26 16 11 20 etc. A close look into the network of Fig. 1, makes it
7 1 0 27 12 11 clear that the Z matrix has as many different terms as the
8 6 1 28 16 12 number of lines in the network. Thus, for the network of
9 3 1 29 13 12
16 13
Fig. 1, only 39 locations are required to store a Z matrix
10 2 1 30
11 3 2 31 14 13 of size 20 x 20.
12 6 3 32 16 14
13 4 3 33 15 14 4 Solution technique
14 6 4 34 16 15
15 5 4 35 19 16
As previously mentioned, a quality cf the impedance
16 6 5 36 17 16 matrix is the presence of a large number of identical
17 9 6 37 19 17 terms. This property of the matrix can be transmitted
18 7 6 38 18 17 into its triangular factor, whether LU or Gaussian, if and
19 9 7 39 19 18 only if a special order is followed. The numbering scheme
20 8 7
proposed in this paper achieves this order. The upper
diagonal elements of the Z matrix and the corresponding
Table 2: Input data, lines connected t o each load node
upper triangular matrix for the network of Fig. 1 are of
Load node Connecting branch the form shown in Table 3 and 4, respectively.
1 7 To transmit the identical property of the nth row of
2 10 the Z matrix to the nth row of the U matrix, it is neces-
3 11 sary to have the identical property of the ( n - l)th,
4 13 ( n - 2)th, . . . , 1st row of the Z matrix. It is obvious that
5 15
6 16 the Z matrix has got this property that, however, is
7 18 formed by the proposed numbering scheme. Thus the
8 20 storage economy achieved for a Z matrix can also be
9 21 maintained in storing the U matrix. The U matrix,
10 23
11 25 however, will generate some new elements as columnwise
12 27 identity can not be maintained. Thus in Table 3 and
13 29 Table 4, although Z (1, 7), Z (2, 7) and Z (3, 7) are identi-
14 31 cal, U (1, 7), U (2, 7) and U (3, 7) are all different (viz. u’l
15 33
16 34
and U”1, respectively). The proposed numbering scheme
17 36 gives computational savings in two ways:
18 38 (i) only one element needs to be computed and stored
19 39 to represent hundreds of identical elements, depending
20 5 upon the size of the network
Table 3 : Form of Z matrix for Fig. 1 (upper diagonal elements)
1 2 3 4 -- 7 - 9 10 11 12----17 - 19 20

1
2
3

I
I
I
9
10
11

I
I
I
19
20

80 IEE PROCEEDINGS-C, Vol. 138, NO. I , J A N U A R Y 1991

Table 4 : Form of U matrix for Fig. 1 (corresponding t o Z matrix of Table 3)
1 2 3 4 - - 7 - 9 10 11 12 __-- 17 - 19 20

9
10
11

I
19
20
-

(ii) though columnwise identity can not be maintained,
computational saving is possible: if Z(;,j ) and Z ( i + lj ,) are
identical, U,i + j ) can be computed as
when U(i+1, i)old has been calculated from the previous
expression. Repeated modifications, as above, will be
required for all the cases for which Z i - k , and Zipk,+
are different. The network of Fig. 1, has 55 different terms
in the U matrix compared with 39 terms in the Z matrix.

It is, however, possible that Z,i 1. i) and Z,i- 1 , + 1 ) are
different. In such cases, U ( ; +1 , j ) has to be modified as
(3)
4.1 The solution algorithm
Though the LU factorisation technique has been used to
solve the load flow problem as previously mentioned, it
was modified to save computation and storage require-
ments. The complete algorithm has been given in the
form of flowchart in Fig. 3.

to1 3

for I and J

+-1
I

calculate U in normal
procedure ?=U,,

node M i n d J = J +1
(L,)+l ?

rcl-T-
columnwise identical term

X=U,,

gL
, = common line between

4'
to 3
2

stop

Fig. 3 Flowchart for the algorithm

IEE PROCEEDINGS-C, Vol. 138, N O . I , J A N U A R Y 1991 81

4.2 Representation of constant P, 0 loads and Table 5a : Line data for the test system
composite load characteristics Line sections Wire
Loads in the proposed formulation are represented as size R(n)jmile X(n)/mile
complex impedances. Load flow analyses are performed 300 Cu 0.196 0.655
1. 2. 3
generally with constant P , Q loads. In a power system, 4. 22 36.4Al 0.279 0.015
loads are neither of constant impedance nor of constant 5, 17, 24. 26, 35 210 Cu 0.444 0.439
P , Q values but are of a composite nature. However, the 6,8,9,12,14,19,28 2Cu 0.864 0.751
algorithm can take care of constant power representation 30, 32, 37
7. 10, 11. 13, 15, 16, 18, 4 Cu 1.374 0.774
of loads. The problem is to find the proper value of load 20, 21, 23, 25, 27, 29,
impedance. The voltage magnitudes obtained after the 31, 33. 34, 36, 38. 39
first solution are used to compute the load impedances
Length of each line section is one mile
for the next solution. Three such solutions are sufficient
to represent a constant power load maintaining Table 5b: Load data for the test system
~ ~

O.OO0 01 p.u. tolerance limit for realistic systems. Com- Load Reactive power Load Reactive power
posite load nature can also be represented with equal effi- node load node load
ciency. If the break up of the composite load in ith load 1 0.01 16 11 0.012
node is known, each component can be represented by 2 0.008 12 0.01 4
equivalent impedances, which at each solution step can 3 0.014 13 0.01 7
be adjusted to represent the actual load characteristics. 4 0.01 14 0.012
Thus, knowing the impedances of different load com- 5 0.01 5 15 0.015
6 0.01 4 16 0.0116
ponents and the current of that load node, the com- 7 0.024 17 0.019
ponent of current for a particular type of load can be 8 0.012 18 0.01 2
found and the correctness of representation can be 9 0.015 19 0.01 6
checked. 10 0.01 20 0.04
Load data given in p.u. on 15 MVA base; active power assumed to
5 Results f o r radial d i s t r i b u t i o n n e t w o r k s be 3 times the reactive power at each load node

The proposed algorithm has been used to solve a number When applied to the 23 kV test system as shown in
of distribution networks. Results obtained for the test Fig. 4, and taken from Reference [7], five solutions were
system of Fig. 1 are presented here. Table 5 shows the required to represent constant power load with a
details of wire size, resistance, reactance and loads. Solu- maximum power error of 4.4196 x 10- Maximum ’.
tions obtained at each step are shown in Table 6. 14
Three solutions were required to represent constant
power load with maximum 3.6716 x l o p 5p.u. error.
From the solution of each step given in Table 6, it is
obvious that the total number of solutions required to
represent constant power load depends on the magnitude
of the final voltage. The number of different elements of
triangular matrix to be calculated is 55, compared with
the 191 and 156 Jacobian elements required in the
Newton-Raphson and fast decoupled methods, respec-
tively. Fig. 4 Test system

Table 6 : Results of the test system

Load First solution Second solution Third solution
node
Magnitude B u s angle Magnitude Bus angle Magnitude B u s angle
(P.U.) (degree) (P.u.) (degree) (P.u.) (degree)
1 0.981 107 -1.004 13 0.979955 -1.066 82 0.979 874 -1.071 33
2 0.973913 -1.18463 0.972322 -1.25812 0.972214 -1.26332
3 0.973 103 -1.1 9384 0.971 467 -1.267 87 0.971 355 -1.273 11
4 0.972088 -1.225 38 0.970 366 -1.301 852 0.970 248 -1.307 25
5 0.968755 -1.29814 0.966813 -1.37945 0.966680 -1.38517
6 0.968889 -1,29660 0.966956 -1.37781 0.966824 -1.38352
7 0.973390 -1.61991 0.971 674 -1.72545 0.971 549 -1.73325
8 0.972524 -1.66213 0.970753 -1,77018 0.970624 -1.77814
9 0.972 119 -1.666 74 0.970 324 -1.775 07 0.970 194 -1.783 05
10 0.971 734 -1.953 07 0.969 751 -2.085 10 0.969 600 -2.095 03
11 0.967 532 -2.069 17 0.965 185 -2.21 1 26 0.965005 -2.22201
12 0.963918 -2.16908 0.961 244 -2.32025 0.961 036 -2.331 76
13 0.958487 -2.297 23 0.955 295 -2.460 70 0.955 043 -2.473 26
14 0.955664 -2.37584 0.952188 -2.54721 0.951 910 -2.56044
15 0.95286 -2.440 17 0.949 111 -2.1 68 11 0.948 809 -2.631 91
16 0.953 317 -2.434 95 0.949 605 -2.61 2 35 0.949 307 -2.626 10
17 0.968 329 -2.03491 0.966 152 -2.1 73 35 0.965 989 -2.1 8377
18 0.966 707 -2.087 03 0.964410 -2.229 24 0.964 238 -2.239 93
19 0.966 171 -2.093 16 0.963 835 8 -2.235 837 0.963 661 -2.246 55
20 0.971 217 -1.99623 0.9692436 -2.131 61 0.969095 -2.141 80

Max. AP,,AQ
6.8083 x 10 - 3 4.8728~10-~ 3.6716~10-~
Assumed voltage base=23 kV

82 IEE PROCEEDINGS-C, Vol. 138, N o . I , J A N U A R Y 1991

power errors for the previous four solutions were where, ZcommOn, ,
Z p a f h and Z p a f h are the impedances of
1.1979 x l o p 2 , 2.9811 x 7.3705 x and the common path of current, path 1 and path 2, respec-
1.8079 x lop4,respectively. tively. Z l o a d is the load impedance calculated at the
The minimum voltage for this system at the given load voltage of the meshed node.
conditions was as low as 0.8411 p.u. This occurred at /@

node 14. The line section details and load data for the
system are given in Table 7. The system of Fig. 4 had to
be converted into the standard form. For this system,
only 53 U elements were calculated and stored compared
to 158 and 126 Jacobian elements in the Newton-
Raphson and fast decoupled methods, respectively. A 90
bus system, on the other hand, did not converge at all in
the Newton-Raphson and fast decoupled methods, but
the present algorithm could represent constant power
load with only three solutions. For the 90 bus radial
system, there were 453 and 362 Jacobian elements in the
Newton-Raphson and fast decoupled methods, respec-
Fig. 5 Distribution network with both radial and meshed lines
tively, compared with only 153 U elements in the direct
solution technique.
Table 7 : Data for test system of Fig. 4
Feeder Wire
section size
0-1
1-2
2-3
300 CU
36.4 AI
210 CU
Load KVAR (connected to
2nd bus of the section)
0
174
0
I-"' ll.SI

3 4 2 Cu 312
4-5 2cu 0
5-6 4cu 0
6-7 4 Cu 0
7-8 4cu 0
8-9 4 Cu 63
9-10 4 cu 0
10-11 4cu 112
11-12 4Cu 219
12-13 4 CU 261
13-14 4 CU 243
8-15 2 CU 159
15-16 4Cu 183 Fig. 6 Equivalent radial network
16-17 4Cu 159
6-18 2 Cu 144 path 1
18-19 2 CU 224
19-20 4 Cu 165
6-21 2 Cu 69
3-22 210 Cu 174
22-23 210 Cu 639
23-24 2 CU 0
24-25 2 Cu 372 a
25-26 2 Cu 183 path 1
26-27 4 Cu 264
1-28 36.4 AI 294
28-29 4 Cu 294
29-30 4 CU 294
'------
The KW load at each bus is taken as 3 times the KVAR load path 2
Each line section is of one mile length

Fig. 7 Calculation of meshed node's current

6 S o l u t i o n for systems w i t h radial and meshed
Iines
Distribution networks having both radial and meshed
lines can be solved using the proposed method by break-
ing the meshes. Fig. 5 shows a typical distribution
network that has both radial and meshed lines. Fig. 6
shows the equivalent radial system after breaking the
meshed nodes.
Referring to Fig. 7 4 where ipl and i p , are the currents
through path 1 and path 2, the following equations can
be written :
G = z c o m m o n ( i P 1 + ip,)
+ zpoth 1 ipl + zlood(ipl + ip2)
% = zcommon(iP1 + i ~ 2 )
+ Z p o t h 2 ip2 + zlood(ipl + ipZ) (4)
IEE PROCEEDINGS-C, Vol. 138, NO. I , J A N U A R Y 1991
U I node intact b Configuration after breaking of I node
Eqn. 4 can be rewritten as
& = (Zcommon + Z p u f h 1 + Zload)
ipl + (Zcommon + zlood)ip2
&S = (Zcommon + zload)ipl
+ (Zcommon + Z p o t h 2 + zload)ipZ (5)
The above equations suggest the breaking of the meshed
node i into the nodes i , and i2 , as shown in Fig. 7b. The
load impedance connected to both i, and i , is Z l o o d . The
radial network obtained by breaking the meshes has to
be converted into the standard form, and nodes and
branches are to be numbered following the proposed
numbering scheme. The final network thus obtained can
83
now be solved using the method as discussed in the pre- Table 8. The maximum active or reactive power error
vious sections. after the three solutions are 1.5637 x
In the above, two equations have been written for the 3.0157 x l o p 4 and 1.6413 x lo-' P.u., respectively. The
meshed node i, and to apply the radial network solution number of U matrix elements to be computed and stored
algorithm, meshed node i had been represented by i, is 83, compared to 259 and 184 Jacobian elements in
and i2.- Thus, the voltage of node i, = the voltage of Newton-Raphson and fast decoupled methods, respec-
node i, = the voltage of the original meshed node i = tively.
ZioaAi~i +~PJ.
Table 8: Results for the test system
6.7 The solution algorithm Bus Voltage Phase
The presence of meshes in the network introduce non- (P.U.1 (degree)
identical terms in the Z matrix. If for the mth meshed 1 0.983 103 -0.96038
node, i and j are the nodes in the equivalent radial 2 0.976 239 - 1.220 85
network, let the ith node with the lowest number be 3 0.975 383 - 1.230 56
termed the 1st node, and the jth node with the highest 6 0.972 022 - 1.433 23

number be termed the 2nd node of the mesh. Zij will now 7 0.975 817 -1.371 76
9 0.974 671 -1.44510
be different from other elements of the ith row. This non- 12 0.972 147 -1.52674
identical entry in the Z matrix will result in nonidentical 15 0.966 821 -1.622 60
terms U,, in the corresponding upper triangular matrix, 16 0.967 310 -1.62040
where k = i, ..., j. However, uk,
,
..., ,-",
and
U , , ,+ may have identical values. U,, can be obtained by
18
19
0.970 968
0.970 395
-1.598 14
-1.604 68
,-,
little modification on uk, or U,,,,+ etc., depending on
the topology of the network. Presence of meshes, there-
, 20
Meshed nodes
0.974 934 -1.54240

4 and 11 0.975 359 -1.405 99

fore, require more storage space and computational 5 and 13 0.972 278 -1.472 01
effort. Modifications required in the algorithm, given in 8 and 17 0.975 259 -1.476 04
10 and 14 0.973 795 -1.51465
the form of flow chart in Section 4.1, are highlighted in
Fig. 8.
I L,+co"on line between ith and jth nodes 8 S o l u t i o n for unbalanced n e t w o r k s

It has been assumed that line impedances, modelled on a

phase basis and per-phase load at all the load nodes, are
known. Such modelling for lines and cables is possible
using the method of J.R.Carson [I 13 and W.A. Lewis

t
= load node behind (L,)+l
[12]. Three-phase transformers are also to be represented
on a per-phase basis [13]. The effect of line charging has
computat IonaI been neglected.
The method for balanced representation can also be
applied in solving unbalanced three-phase networks. The
same branch and node numbering schemes have to be
used. Because of three-phase representation, each load
node will represent three loops. For the nth load node,
+ +
[3(n - 1) llth, [3(n - 1) 21th and [3(n - 1) 31th +
loops will represent the a, b and c phases, respectively.
Formation of the Z matrix is as simple as in the single-
phase case. Because of the three-phase representation,
first bus =- first bus
generate U, corresponding
to meshed 'node +
network identity between the ith and (i 1)th load nodes
- u m ~ h="calculatec
- zik+z will appear in the [3(i - 1) + 11 and [3(i + 1 - 1) 11th +
no change K = f irst i'"?shec! rows of the 2 matrix. However, the identical property of
required node after), for
>first bus ]=load node behind the Z matrix is preserved in the corresponding U matrix,
generate U corresponding
(L,)+l thus saving a large amount of storage and computational
K-f irst nonmeshed
to meshed {ode changes node before J, for effort. In respect of searching requirements, the three-
due to the terms ) >load node behind phase representation has greater computational efficiency
K=first bus--------
%, -_____ (L,)+l
than the single-phase balanced representation, as, com-
Fig. 8 Modijications required in presence of meshed node pared with only one element in the single-phase case
involving nodes i and j , the three-phase representation
will have nine elements. For the case of columnwise iden-
7 Results f o r system w i t h b o t h mesh and radial
lines tity (i.e. when i - jth portion of the network is same as
i + 1, jth portion of the network), computational
Though the efficiency of the algorithm has been tested economy as achieved for single phase can be maintained.
with networks of different sizes and different numbers of The solution algorithm, however, has to be modified,
meshes, results for the test system of Fig. 1 are produced owing to the three-phase representation. The algorithm,
here. Four meshes have been assumed, by connecting in the form of a flow chart, is given in Fig. 9, and the
nodes 4 and 11, 5 and 13, 8 and 17 and 10 and 14. Thus, necessary equations are given in Section 12.1. U A A ,
the network of Fig. 1 is the equivalent radial form of the UAB, U A C etc., used in the flowchart, are to be inter-
original network that has both mesh and radial lines. preted as follows: For the common portion between the
Loads of the nodes 4, 5, 8 and 10 have been considered to ith and jth nodes, UAB,,represents the mutual elements
be the loads of meshed nodes. Voltages at different load between A and B phases, with A phase from node i and B
nodes, obtained after the third solution, are given in phase from node j. UBAijon the other hand, represents

84 IEE PROCEEDINGS-C, Vol. 138, No. I , J A N U A R Y 1991

the mutual elements between the B phase of node i and unbalanced network can be applied in such cases by
the A phase of node j . assuming dummy lines of zero self and mutual imped-
6

set I - 1 , J . l

&I next J

+
find mutual K . i and K,J

i
calculate UAA UAB UAC, of lcops to 2
UBB, UBC, U C usi
~ n,

1i
equation set 10

-~
-Y
ii-1
next I

compute UBA. UCA, UCB

equation set 11
iij
1 no of loops

compute UAA, UAB

I %
,
using equation set 7 ucc etc
L I J-+I+l
Y

&=of loops Y

I N
I + - BC. BB. BA equation
1
I
I

complete calculation of UBA.

UBB UCC using equation

t07
Fig. 9 Flowchart for unbalanced three-phase

8.1 Storage requirements
The network of Fig. 1 with three-phase representation,
has a Z matrix of size 60 x 60. The 60 x 60 Z matrix can
be stored in only (39 x 6) = 234 locations; i.e. 6 times the
single-phase case. For storing U , the memory require-
ment is (9 x requirements for single phase representation
-3 x loop no.), which for the above case is only 435. It
is also clear that U triangularisation requires computa-
tions Of 435 different Of which (55 - 39)9 = 144
elements have columnwise identity in the original Z
matrix. This leads to a great amount of saving in compu-
tational effort.
antesto represent the phases that do not physically exist.
Loads of those particular phases are to be assumed
as zero (a negligibly small load for computer
implementation).
9 Results f o r unbalanced d i s t r i b u t i o n n e t w o r k
Fig. 10 shows a distribution network (the test system of
Reference 10) that has single-phase, two-phase and three-
phase lateral lines. The conductor configurations and
assumed KVA loadings are indicated in the figure.
Assumed line impedances for different t w e s of conductor
< -

8.2 Solution for network with single-phase,
two-phase and three-phase lateral lines
Practical distribution networks have single-phase, two-
phase and three-phase lateral lines. The algorithm for an
Table 9: Self and mutual line impedances
Conductor Self impedance per mile
code (Q)
1 AA 0.368673 +j0.685 228
BB 0.375 688 +j0.671 464
cc 0.372 266 +j0.678 178
2 AA 0.977480 +;0.871 668
BB 0.984 397 +;0.865 438
cc 0.981 023 +J0.864779
6, 7, 8 1-1 0.977 480 +;0.871 668
2-2 0.981 023 +j0.868477
3. 4. 5 1.9280 + j l . 4 1 9 39
configurations a;e given in Table 9. The proposed algo-
rithm requires only two solutions to represent constant
power load with a maximum power error of
7.701 29 x p.u. Table 10 shows the voltages of
Mutual impedance per mile
(Q)
AB 0.0169 79 +j0.151 451
BC 0.01 8 826 +j0.207 232
CA 0.015 451 +jO.109 794
AB 0.01 6 7404 +;0.169685
BC 0.018 561 +;0.227 450
CA 0.015 233 +j0.126 388
1-2 0.015 233 +j0.126 388

I E E PROCEEDINGS-C, Vol. 138, NO. I , J A N U A R Y 1991 85

 Table 10: Results for the test system of Fig. 6
Bus VA (mag) VA (phase) V 6 (mag) V 6 (phase) VC (mag) VC (phase)
1 1.ooo 000 0.0000 1.000 000 - 120.0000 1.ooo 0000 120.0000
8 0.975 206 -0.2759 0.979 674 -1 20.1326 0.980 342 119.7059
14 0.966 317 2 -0.2847 0.972 963 -1 20.0787 0.970 670 119.6931
15 0.964 228 -0.2826 0.970 923 -1 20.0710 0.968 783 119.6903
17 0.969458 119.6937
9 0.965 016 -0.2904 0.974 879 -1 20.1357 0.976 832 119.7310
10 0.962 153 -0.2882 0.973 032 -1 20.1505 0.997 132 119.7418
11 0.960 470 -0.2929 0.972 530 -1 20.1559
13 0.971 723 -1 20.1 555
12 0.959 247 -0.2923
18 0.981 761 -0.3089 0.982 263 - 120.1826 0.982 959 119.6230
21 0.978 946 119.6251
22 0.976 537 119.6264
19 0.978 355 -1 20.1907
20 0.980 606 -0.3024 0.980 761 -1 20.191 9 0.983 210 119.6257
23 0.980 661 -0.3276 0.981 320 -1 20.2364 0.984 896 119.6099
24 0.979 545 -1 20.2403 0.984 192 119.6035
25 0.976 331 - 120.2386
5 0.981 250 -0.3329 0.982 353 -1 20.2305 0.984 723 119.6091
Voltages are given on a base of 4.16 kV; loadpower factor assumed to be 0.8

ments. The inherently ill-conditioned radial distribution

J h 7 5 - b network, due to the characteristics of the problem formu-
lation, always becomes a well-conditioned system and
hence there is no problem of computational instability.
150-30
The direct solution technique for radial distribution net-
75-c
(3 works has also been extended for meshed distribution

sub ’
0 1000’
1 1
56-c

4
500’

1
500

L,@
’
500’

1 1
500

2
0
I
‘ 150.3,
L
systems and systems that have unbalanced networks. It
has been shown that the storage and computational
economy achieved in balanced radial networks can also
be preserved for meshed and unbalanced networks. An
500’ 2 important advantage of the method is that there is no
150-30 problem of convergence, and an accurate solution is
+@
y
-
1000 guaranteed for any realistic distribution system that has a
realistic r / x ratio. Another important point is the ease
with which composite loads can be represented.
However, the difficulty in numbering the nodes and
branches may be mentioned. To overcome the limitation,
the authors are at present developing an algorithm to
generate the branch and node numbers automatically.

11 References
50-c \ --
200’4

1 RAJICIC, D., and BOSE, A.: ‘A modification to the fast decoupled

I 50-b power flow for networks with high R/X ratios’, IEEE Trans., May
1988, PWRS-3, pp. 743-746
Fig. 10 Test system with unbalanced radial network 2 IWAMOTO, S., and TAMURA, Y.: ‘A load flow calculation
Distances between buses are given in feet. method for ill conditioned power systems’, IEEE Trans., April 1981,
The number below each line section indicates the line type. PAS-100, pp. 17361743
Loads are either in three phase or single phase kVA. 3 TRIPATHY, S.C., DURGAPRASAD, G., MALIK, O.P., and
Line codes 1 and 2; have phases a, b, c, n HOPE, G.S.: ‘Load flow solutions for ill conditioned power systems
Line codes 3,4, 5 ; have phases (a, n). (b, n). (c. n), respectively by a Newton like method’, IEEE Trans., October 1972, P A S 1 0 1
Line codes 6, 7, 8; have phases (a, c, n), (a, b, n). (b, c, n). respectively 4 PAPADOPOULOS, M., HATZIARGYRIOU, N.D., and PAPA-
DAKIS, M.E.: ‘Graphics aided interactive analysis of radial dis-
different load nodes. The total number of U elements tribution networks’, IEEE Trans., October 1987, PWRD-2, pp.
computed and stored was 450. 1297-1 302
5 KERSTING, W.H., and MENDIVE, D.L.: ‘An application of
ladder network theory to the solution of three phase radial load-
10 Conclusion flow problem’. IEEE PAS Winter meeting, New York, January 1976
6 SHIRMOHAMMADI, D., HONG, H.W., SEMLYEN, A., and
A direct solution technique has been proposed for a LUO, G.X.: ‘A compensation-based power flow method for weakly
radial distribution network. The special configuration of meshed distribution and transmission networks’, IEEE Trans., May
the distribution networks suggests the development of a 1988, PWRS-3, pp. 753-762
special approach. The conventional power flow methods, 7 CIVANLAR, S., and GRAINGER, J.J.: ‘Volt/var control on dis-
tribution systems with lateral branches using shunt capacitors and
useful for transmission networks, proved themselves to be voltage regulators. Part-111. The numerical results’, IEEE Trans.,
inefficient in solving distribution networks. The proposed November 1985 PAS-104
direct solution method exploits the radial feature of the 8 SUN, D.I.H., ABE, S., SHOULTS, R.R., CHEN, M.S., EICHEN-
network. A unique branch and node numbering scheme BERGER, P., and FARRIS, D.: ‘Calculation of energy losses in a
has been devised and the problem has been formulated as distribution system’, IEEE Trans., 1980, PAS-99, (4), pp. 1347-1356
9 BERG, R., and HAWKINS, E.S.: ‘Mechanised calculation of unbal-
a simple problem of circuit solution. The algorithm has anced load flow on radial distribution circuits’, IEEE Trans., 1967,
been developed to save computation and storage require- PAS-86, pp. 41 5 4 2 2

86 I E E PROCEEDINGS-C, Vol. 138, N o . I , J A N U A R Y 1991

10 KERSTING, W.H.: ‘A method to teach the design and operation of Table 12: Line data in p.u.
a distribution system’, IEEE Trans., July 1984, PAS-103, pp. 194.5-
Line R X Line R X
19.52
11 CARSON, J.R.: ‘Wave propagation in overhead wires with ground 89-46 0.00020 0.001 50 8-61 0.001 20 0.007 50
return’. Bell Systems Technical Journal, October 1926, Vol. 5 47-46 0.00040 0.001 90 9-61 0.001 50 0.016 10
12 LEWIS, W.A., ALLEN, G.D., and WANG, J.C.: ‘Circuit constants 48-47 0.000 30 0.002 00 56-57 0.000 20 0.001 50
for concentric neutral undergrounded distribution cables on a phase 48-45 0.00010 0.001 20 10-57 0.000 30 0.002 50
basis’, IEEE Trans., 1978, PAS-97, (l), pp. 200-207 49-46 0.000 50 0.002 10 58-57 0.000 10 0.000 50
13 DILLON, W.B., and CHEN, M.S.: ‘Transformer modelling in 49-50 0.001 00 0.00500 11 -58 0.000 20 0.000 60
unbalanced three phase Networks’. IEEE Summer power meeting, 50-1 0.000 10 0.007 00 58-59 0.001 50 0.002 50
July 1972, paper 3-72-460-4 50-51 0.001 50 0.00750 12-59 0.000 30 0.001 50
2-51 0.001 60 0.00800 59-60 0.000 90 0.002 10
3-51 0.001 70 0.008 20 13-60 0.000 10 0.000 40
49-52 0.000 30 0.001 00 14-60 0.000 60 0.001 00
53-52 0.000 15 0.002 10 47-62 0.000 10 0.000 90
12 Appendix 53-4 0.000 12 0.0003 00 62-63 0.000 15 0.00080
53 - 54 0.001 20 0.00760 63-1 5 0.001 00 0.004 00
12.1 Data for the 90 bus test system 54-5 0.002 00 0.009 00 63-64 0.00040 0.000 90
54-55 0.001 20 0.009 50 64-65 0.000 20 0.000 80
55-6 0.00250 0.00870 65-16 0.001 50 0.001 70
Table 11 : Bus data in p.u. 55-7 0.01 2 80 0.042 50 65-17 0.001 00 0.002 50
Node P 0 Node P 0 52-56 0.009 00 0.031 00 64-66 0.000 10 0.000 30
56-61 0.008 50 0.01 2 50 18-66 0.000 10 0.000 40
1 0.012 0.006 24 0.045 0.01 9 66-67 0.000 15 0.00045 78-32 0.00030 0.001 00
2 0.067 0.023 25 0.01 3 0.009 67-19 0.000 20 0.00090 79-48 0.00002 0.00005
3 0.087 0.045 26 0.035 0.012 67-20 0.00030 0.001 60 79-33 0.00020 0.000 10
4 0.123 0.071 27 0.032 0.014 62-68 0.000 01 0.00005 79-80 0.000 40 0.000 80
5 0.082 0.032 28 0.024 0.013 68-70 0.000 04 0.000 09 80-34 0.000 20 0.000 80
6 0.062 0.034 29 0.124 0.057 69-70 0.000 10 0.000 60 80-81 0.000 10 0.000 70
7 0.340 0.1 20 30 0.098 0.067 69-21 0.000 10 0.000 50 81 -82 0.00050 0.001 00
8 0.023 0.01 7 31 0.088 0.054 69-22 0.000 20 0.000 80 82-35 0.000 40 0.000 80
9 0.024 0.01 8 32 0.077 0.052 70-71 0.000 20 0.000 70 82-36 0.00020 0.001 00
10 0.025 0.01 9 33 0.066 0.023 71 -23 0.000 10 0.000 90 81 -83 0.00070 0.001 20
11 0.034 0.01 4 34 0.076 0.034 71 -72 0.001 20 0.007 50 83-37 0.001 00 0.007 20
12 0.029 0.01 9 35 0.231 0.1 23 72-74 0.002 50 0.008 50 83-90 0.001 20 0.002 10
13 0.016 0.012 36 0.078 0.035 72-25 0.001 50 0.00790 90-84 0.001 50 0.00250
14 0.017 0.011 37 0.234 0.115 68-73 0.000 10 0.001 20 84-38 0.001 00 0.00700
15 0.181 0.067 38 0.243 0.124 73-74 0.000 20 0.000 70 84-85 0.000 20 0.000 90
16 0.245 0.123 39 0.067 0.024 74-26 0.000 30 0.000 80 85-39 0.001 20 0.00720
17 0.014 0.01 1 40 0.088 0.033 74-27 0.00050 0.001 20 85-40 0.001 50 0.00920
18 0.01 3 0.01 1 41 0.123 0.076 73-75 0.000 40 0.000 70 90-86 0.002 00 0.008 00
19 0.028 0.01 7 42 0.045 0.021 75-76 0.000 20 0.000 60 86-41 0.00070 0.001 40
20 0.1 23 0.051 43 0.01 2 0.009 76-28 0.000 10 0.000 70 86-87 0.00090 0.002 10
21 0.091 0.045 44 0.123 0.054 76-29 0.000 20 0.000 50 87-42 0.001 50 0.00280
22 0.1 23 0.067 45 0.165 0.091 75-77 0.000 20 0.000 80 87-88 0.001 70 0.00270
23 0.089 0.034 77-30 0.000 10 0.000 90 88-43 0.001 30 0.00230
77-78 0.000 40 0.000 70 88-44 0.001 70 0.00250
No load connected in buses 46-90 78-31 0.000 50 0.000 90
Bus 89 is the source bus

12.2 Equations for the elements of U for three phase ucci- i

representation
Equations useful for three-phase solutions are given
ucxij= ucxi-1 , j
( 1 -
ucci-1 , i - 1 - UAXi-1,j

below. The equations given below are the general equa- UACi- 1, j - UACi- i-
tions for computing U . In the present case, the network UAAi-l , i- 1
topology and the advantage of the numbering scheme
have been used to reduce computational effort. UBCi-1,j- UBCi-,,i-,
- UBXi-1.j
UBBi- i -
U AAi 1 ,
-

UAAi-l,i-l X = A, B, C (7)

X = A , B, C

(9)
IEE PROCEEDINGS-C, Vol. 138, NO. I , J A N U A R Y 1991 87
 U C X i j = UCXij - UACii U A X i J U A A i i

-
UBC,, U B X i j
UBXki U B & j - UCXki U C K j UBB,,
-
UBBkk uCCkk X=A,B (13)
X = A , B, C UAX.. UBX..
BX, = B X , - B A , 2- BB, 2
UAA,, UBBii
Y = A , B, C for X = A
UCX,,
= B. C forX = B - BCi ~

UCCij
=c forX = C

B A , UAB,,
BBj = BBj -
UAAii

BCj = BCj -
B A , UACii - BB, UBC,,
UAA,, UBBii
X=B,C B X i = B X i - B A , U X A i j - BBj U X B i j
Y = A for X =B - BCj UXCij

Y=A,B forX=C X = C, B, A
(1 1)
BCi = BCi/UCCii
UBXij = UBXij - UAXii U A Y i j / U A A i i
BB, = BBi - BC, UBCii
X=B,C
UBB,,
UCCij = UCCij - UACii U A C i j / U A A i i
B A , - BBi UABii - BCi UACii
- UBCi, UBC,, - UBBii
BA, =
UAAii
UBAij = UBAij - UABii UAAi,/UAAii (12) B A , BB, BC etc. are solution vectors.

88 I E E PROCEEDINGS-C, Vol. 138, N O . I , J A N U A R Y 1991