Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
3, July 1992
0885-8977/92/$3.0001992 IEEE
Authorized licensed use limited to: Lokmanya Tilak College of Engineering. Downloaded on July 26,2010 at 08:35:31 UTC from IEEE Xplore. Restrictions apply.
1
1485
near optimum one. An immediate alternative to recalculated as Im-j lm-j old -1i-j etc.
the above approach is, therefore, to consider With the modified branch flows, node voltages
one loop at a time. are calculated, assuming that the voltage at
In this paper, the authors have developed the common node k remains unchanged at the
a new algorithm of feeder reconfiguration value before the closing of the switch.
utilising the concept of optimal flow Assume that at node i, V( is the
pattern.Unlike the algorithm of Shirmohammadi voltage calculated using the branch currents
and Hong(2), the authors'algorithm optimises of the path k...qyl-i and V T is the voltage at
the flow pattern in a single loop of the
network. Hence instead of closing all the
network switches to form a meshed network and
opening the switches, one after another, to
restore the radial configuration,the authors'
algorithm closes only one switch at a
particular instant to introduce a mesh in the
system and comes back to the radial
configuration by opening the same or a
different switch of the loop depending upon
the result of the optimal flow pattern
through the switches of the same loop.
'The optimal flow pattern through the
branches of the loop formed is determined by t i
solving KVL and KCL equations of the loop
with the branch impedances replaced by Fi9.1 LOOP formed by closing o mrmolly
corresponding resistances only. oprn svltch.
Power flow of the radial network is a
very important part of any feeder node i calculated using the branch flows of
reconfiguration algorithm. The authors have the path k...m-j-i. If the two values differ
developed a simple and flexible power flow by a negligible amount, the calculation
method for this purpose. stops, otherwise the incremental flow through
i-j is calculated as:&
SLIECTION QE ryS Q" SWITCA To BE CLOSGD AIi-j = ( Vi -Vi )/Zloop , which added
with Ii-j Rives the actual flow through i-j.
The feeder reconfiguration algorithm The process of calculation of branch flows
starts with a power flow solution of the and node voltages are continued.
radial network. A normally open switch is After the convergence is achieved, the
then closed to form a loop. Switch to be branch currents through the laterals
closed to form the loop may be selected originated from the nodes of the loops (42,
depending upon the voltage across the open q1,q0,m2,ml,m etc) are calculated using the
switch or arbitrarily. The authors have newly calculated node voltages.
checked three options, viz : - (i)close the Considering node q0,total current output of
normally open switch across which the voltage the node = current through (q0-q5) + current
is maximum ( expecting that because of the through (90-1) + current to the load
largest voltage difference this switching connected at node e;l.
will cause maximum reduction in loss.) Current through (q0-1,
(iilclose the switch across which the voltage ((Power through qO-i)/Vq ) *
is minimum, (expecting that because of Current to the load at q 0 =
minimum voltage difference modified solution ((load power connected at q )/Vq j*
can be obtained very quickly) (iii) select These currents are used to getermine the
the switch arbitrarily one after another. optimal flow pattern through the branches of
It has been found that the final the loop. (Superscript ' * ' means conjugate).
configuration obtained is the same in all the
three schemes. HeLhod-2:- Current through the branch i-j,when
switch at i is closed to form a loop, is
WLOTION QE NETWORK AFTER CLOSING A determined as discussed in Method-1. Load at
lKBULIZmSWITCB i is now supplied through two paths, k...qg-i
and k. n i - . i - i . The load *component supplied
The closing of a normally open switch through j-i is Sj-i = Vi1 j-i. Before closing
changes the flow pattern of the network which the switch the load at i was supplied through
has to be determined by a power flow q0-i. Since a part of the load is now being
solution. Three methods of varying accuracies shared by the other path, power through q0-i
have been tested for getting the modified is now, s w - i = sw-i old - s . i. The power
solution . flow through (qD-1) and (j-ij-being known,
loop k...qg-i-j-m...k, can be represented by
_ - Loads are assumed to be of constant an equivalent radial network obtained by
current values as obtained from the radial opening the loop at node i as shown in Fig 2,
network's power flow solution. Referring to where i l and i2 are the nodes obtained by
the Fig 1 and assuming that the open switch breaking the node i. The radial network power
at i or j to be closed now, a loop k , . . q ~ - i - flow algorithm can now be used for the
j-m. . . k will be formed. Current through i-j solution of the network. The solution so
is calculated as: obtained is utilised to determine the optimum
Ii-j = (Vi- Vj)/Zloop., where Zloo flow pattern.
= impedance of the loop k...qo-i-j-m.. . k. Alf
the branch flows from i to k are recalculated wod-3: After the power flow solution (a5
as Igrr -i = Iw-i old +Ii-j etc. Similarly discussed in Method-8) the voltage across
modified branch flow from j to k are
Authorized licensed use limited to: Lokmanya Tilak College of Engineering. Downloaded on July 26,2010 at 08:35:31 UTC from IEEE Xplore. Restrictions apply.
1486
b
I L ~ I L ~
Authorized licensed use limited to: Lokmanya Tilak College of Engineering. Downloaded on July 26,2010 at 08:35:31 UTC from IEEE Xplore. Restrictions apply.
1487
@L
the line loss is determined. Voltage
calculation and determination of line losses
are then continued for all the nodes and the
lines of the network. The total power loss in
17 I;
/
/
the section of the network ahead of a node is
termed as 'summed power loss' of the node.
After one iteration is completed, the summed
0 power loss of all the nodes are known. Next
We. 5 Olrtrlbutlon natwork wlth o r r l g n d (IQdr iteration is to be performed by modifying the
ond branch numbor. summed power as :
summed power = summed power + summed
power loss.
At the start,the voltage of the 'node behind'
'Line ahead-l(i)' and 'Line ahead-2 (i)' are is taken as Voltage of the 'node ahead'. The
the two lines originated from a node i. 'Node process starts with the known voltage at the
behind (i)' is the node behind the line 'i'. substation to calculate the voltage at node
In case of only one outgoing line from a node 1, which is then repeated for the whole
i, 'Line ahead-2 (i)' = 0. The list of 'Line network. The steps for the solution are as
ahead-l'(Lahead-1), 'Line ahead-2'(Lahead-2) follows : -
and 'Node behind ' (Nbhind), for the network 1. Compute suinined power at different nodes.
of Fig 5, are shown in Table 1. 2. Compute nods voltages and line power
losses.
Authorized licensed use limited to: Lokmanya Tilak College of Engineering. Downloaded on July 26,2010 at 08:35:31 UTC from IEEE Xplore. Restrictions apply.
1488
(NOMZ) SO?
through),calculation of 'summed power'for the
node is over and one will then move towards
the root node again.If Lahead-2 for the node
exists ( i. e. it there is an untravelled path) I II -.
N
calculation of 'summed power'starts from a
new terminal node. It is clear that, as all NOOE = NODE 2 I
the term'inal nodes are encountered, during
backward travel, the status of NFLAG for all Fig. 6 Flowchort for the detrrmlnotkn of Summed Powor
the intermediate nodes will be found set and
one can move to the root node completing the
process of calculating the 'summed power'.
Fig 6 shows the flowchart of the process.
VOLTAGE UPDATING CALCULATION 4E powER 1
Loss
The voltage updating starts at node-1.
The next node for which voltage updating is
performed is known from Lahead-1 of the node.
If a second line exists, it is known from
Lahead-2 and is kept in a list 'LWAIT'. LWAIT
thus stores the nodes whose voltages are to
be updated.Both for 'Lahead-l'and 'Lahead-X',
the starting voltage is the voltage of the \/ ~.AHEAD2td r""'
originating node. The process of updating and
'travel forward' continues till a terminal N
-
node is reached. Once a terminal node is
reached, the next direction for travel is
known from the list 'LWAIT'.
As the voltage updating and calculation
of power loss for all the line sections are
completed, the change in line loss in the two
consecutive iterations are calculated for
each line section. If the maximum of these
changes lies within the tolerance limit the
solution process is over, otherwise the PERFORMANm OF PAE POWER FLOW ALGORITHM
'summed power loss' at each node has to be
calculated and the voltage updating starts The power flow algorithm is very fast and
again from node 1 for the updated values of the result obtained is approximate. As
'summed power' plus 'summed power loss'.The already mentioned,the change in the line loss
flowchart of the process is given in Fig 7. has been used to check the convergence,
The voltage updating calculation for constant Solution times required for different test
power load is as follows : - systems (5) on a 80386 PC/AT with 16 MHz
clock are given in Table 2 . Solution times
1. Starting voltage of node i = voltage of required by the Newton-Raphson, and fast
the 'node behind'. decoupled method are also given for the
2. Current through through line i , purpose cif comparison. Since re1 ative, rather
Ii =((summed power(i) +summed power than absolute accuracy is sufficient for n
loss(i))/Vi) feeder reconfiguratiun algorithm ( 1 ) ,this
Authorized licensed use limited to: Lokmanya Tilak College of Engineering. Downloaded on July 26,2010 at 08:35:31 UTC from IEEE Xplore. Restrictions apply.
1489
fast power flow method, giving approximate switching. and absolute accuracy is r L u t that
result, can be used for such on line important. The optimal configuration obtained
applications. by the authors, however, is different from
those of references (2) I% (3). Starting with
W 2Ai Solution times h r different a t the initial configuration of Fig 5, switching
srrsters
_ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ - - - - - - - - - - - - - - - - - -performed,
- - - - - -given
- as reported by the authors of (31,
are in Table 5. The authors of
System Solution time(Secs.)on 80386 PC/AT reference (3) have used three different
descrip- with 16 MHz clock methods (Ml,M2,M3)of varying accuracies to
tion To1 : To1 : Tol: Tol: estimate the change in loss due to a branch
@.GI01 0.0m1 0.m0a1 (a.rn001 exchange. Each switching decision in these
_-______--__________------------------_----- methods, has been made after checking five
40 bus 1.04 1.09 1.26 1.42 switching options corresponding to the five
open switches. Total line loss in the final
44 bus 1.09 1.20 1.53 1.70 configuration (Ml) was. found to be of
0.01488578 pu. In the iinal configuration,
90 bus 1.64 1.86 2.19 2.30 obtained by the algorithm of Shirmohammadi
and Hong ( 2 ) , openn lines are 10, 14, 32, 7 8s
37 and the line loss is 0.0141541 pu. It may
be noted that the configuration obtained by
the algorithm proposed by the authors appears
to be the best one having the minimum active
power loss. The reconfigured network has a
better voltage profile. The voltage at
System PC/AT with 16 MHz clock Convergence various buses for the initial and final
NR FD NR FD configuration are shown in Table 6.
40 bus 2.63 2.47 3 NC T&LG 9 . L a and kd for
44 bus 2.19 2.08 3 NC
90 bus 5.27 4.94 NC NC _ _ _ _ _ _ _ _ _ svstem
___________-------------------------
_ _ _ _ _ _ _ _ - _ _ _ _ _ _ _ - _ _ _ - - - - - - - - - - - - - - - - - -Line
- - - - - End
- - nodes Line Impedance Load at Node2
-
itn = iteration, NC = not converged No. Node1 Node2 r(ohm) x(ohm) P(kw) Q(kvar)
NR = Newton-Raphson, FD = Fast Decoupled ____________________-------------------------
tolerance=0.0001 pu. 1 0 1 0.0922 0.0470 100.0 60.0
2 1 2 0.4930 0.2511 90.0 40.0
-eEmALGORITHMmFEGDER 3 2 3 0.3660 0.1864 120.0 80.0
4 3 4 0.3811 0.1941 60.0 30.0
5 4 5 0.8190 0.7070 60.0 20.0
The computer program has been developed in 6 5 6 0.1872 0.6188 200.0 100.0
FORTRAN to examine the efficiency of the 7 6 7 0.7114 0.2351 200.0 100.0
proposed algorithm. The problem of feeder 8 7 8 1.0300 0.7400 60.0 20.0
reconfiguration has been studied with the 9 8 9 1.0440 0.7400 60.0 20.0
network of Fig 5, which has been taken from 10 9 10 0.1966 0.0650 45.0 30.0
reference (3). Dotted lines in Fig 5 are the 11 10 11 0.3744 0.1238 60.0 35.0
tie lines and switches connecting nodes (33- 12 11 12 1.4680 1.1550 60.0 35.0
20), (34-8), (35,21), (36-17) and (37-28) are 13 12 13 0.5416 0.7129 120.0 80.0
open for the initial configuration.It has 14 13 14 M. 5910 0.5260 60.0 10.0
been assumed that ON\OFF switches exist at 15 14 15 0.7463 0.5450 60.0 20.0
every node of the network. The line and load 16 15 16 1.2890 1.7210 60.0 20.0
data for the network are given in Table 3. As 17 16 17 0.7320 0.5740 90.0 40.0
already mentioned, network switches had been 18 1 18 0.1640 0.1565 90.0 40.0
closed based upon three diffrent criteria. 19 18 19 1.5042 1.3554 90.0 40.0
(1). Switch having 'maximum voltage across' 20 19 20 0.4095 0.4784 90.0 40.0
is closed first. 21 20 21 0.7089 0.9373 90.0 40.0
(2). Switch having 'minimum voltage across' 22 2 22 0.4512 0.3083 90.0 50.0
is closed first. 23 22 23 0.8980 0.7091 420.0 200.0
(3). Arbitrary switching. 24 23 24 0.8960 0.7011 420.0 200.0
Also, it has been mentioned that three 25 5 25 0.2030 0.1034 60.0 25.0
different methods of varying accuracies have 26 25 26 0.2842 0.1447 60.0 25.0
been tested for getting a modified network 27 26 27 1.0590 0.9337 60.0 20.0
solution after a switch is closed. 28 27 28 0.8042 0.7006 120.0 70.0
In all the cases the problem converged to 29 28 29 0.5075 0.2585 200.0 600.0
the same solution. The method used for the 30 29 30 0.9744 0.9630 150.0 70.0
modified network solution did not affect the 31 30 31 0.3105 0.3619 210.0 100.0
decision regarding which switch is to open, 32 31 32 0.3410 0.5302 60.0 40.0
to restore the radial configuration from the 33 7 33 2.0000 2.0000 - -
meshed network. The criteria used to select 34 8 34 2.0000 2.0000 - -
the switch to be closed resulted in different 35 11 35 2.0000 2.0000 - -
paths towards the final solution, but the 36 17 36 0.5000 0.5000 -
final solution remains the same. Table 4 37 24 37 0.5000 0.5000 - -
shows the results of the proposed algorithm.
Modified network solutions obtained in three
different methods resulted in the same ADVANTAGE OF THE PRaWSgP ALGORITHM
switching decision. This, perhaps, is due to
the fact that relative accuracy is The Proposed algorithm has the following
sufficient to make a decision regarding special characteristics:
Authorized licensed use limited to: Lokmanya Tilak College of Engineering. Downloaded on July 26,2010 at 08:35:31 UTC from IEEE Xplore. Restrictions apply.
1490
Authorized licensed use limited to: Lokmanya Tilak College of Engineering. Downloaded on July 26,2010 at 08:35:31 UTC from IEEE Xplore. Restrictions apply.
1491
Authorized licensed use limited to: Lokmanya Tilak College of Engineering. Downloaded on July 26,2010 at 08:35:31 UTC from IEEE Xplore. Restrictions apply.