A New Approach for Distribution Feeder Reconfiguration for

Loss Reduction and Service Restoration

Whei-Min Lin
Hong-Chan Chin
Member Department of Electrical Engineering National Sun YatSen University Kaohsiung, Taiwan 804, R. O. C.
Abstract This paper presenls a new approach to solve Ihe
distribution feeder reconfiguration problem for loss reduction and
service restoration, By using the proposed algorifhm, a more
efficient network configuration can be obtained to reduce loss.
Three switching ndices were defined in this paper. Branch
voltage-drops and line constants were used with all the electrical
constraints. Meshed networks were considerad instead of the
radial topology by closing all the tie switches. By considering
only the largest switching ndex in each loop, this algorithm can
reduce the number of feasible states drastically. The switching
ndex can also be used for service restoration. Many tests have
been run to show its effectiveness.
I. INTRODUCTION
Feeder reconfiguration is a very important and usable
operation to reduce distribution feeder losses and improve system
security. There are a number of normally closed and normally
opened switches in a distribution system. By changing the
open/close status of the feeder switches, load currents can be
transferred from feeder to feeder. During a fault, switches are used
for fault isolation and service restoration. There are numerous
number of switches in the di st ri but i on system, and the number
of possible switching operalions is tremendous. Feeder
reconfiguration thus becomes a complex decision-making process
for dispatchers to follow.
With the progress of monitoring and control functions in
the distribution automation systems, real-time fault idenlification
and isolation are becoming possible. In Taiwan, Feeder Dispatch
Control System(FDCS) for Taipower Company(TPC) has been
installed to perform remote switching[lj. The sectionalizing
switches and tie switches can be controlled through pilot-wires.
The current FDCS could only detect and isolate faults.
Dispatchers could isolate a fault remotely following a fault
identification process. Load reconnection is based on dispalcher's
experience, and loss reduction has not been performed. This paper
deals with feeder reconfiguration and has developed a fast
restoration strategy based on the FDCS switching capability, The
proposed lgonthm would provide FDCS u new option for futurc

Many algorithms dealing with feeder reconfigurations

have been presented. Aoki et al.[2,3] used a quasi-quadratic
nonlmear programming technique to minimize power loss. Aoki
et al[4-6] also developed algorithms for load restoration. An
indicative formula and approximate power flow methods were
proposed in [2] and [7], The method described in [8 ] achieves
the optimal configuration by opening the branches with the
lowest current derived in the optimal load flow with all switches
closed. Civanlar et al.[9] and Baran[10] proposed an approximate
power flow method for loss reduction resulting from a switch
operation on distribution systems. The combinatorial
optimization techniques of genetic algorithms and simulated
annealing have been developed to find the optimal solution for
the switching problem in [11]. The knowledge based expert
system[12-14] has also been apphed to solve the problem of
distribution system reconfigurations.
However, the optimal switching strategies proposed by
most papers need to consider every candidate switch to evalate
the effectiveness of loss reduction. Extensive numerical
computation is often required if the conventional load flow
tecfmique has to be used, considering the large solution space
mvolved. An efficient search scheme is therefore desirable. In
this papel', the formula proposed in [15] is used to estmate the
line loss. A new approach has been developed to solve the
switching problem with mnimum numerical burden. Undcr
normal operational state, the network is considered for loss
reduction, and under restorative state, the network is considered
for load reconnection. Computer simulations were conducted to
show the effectiveness of the proposed algorithm.

II. PROBLEM FORMULATION

In normal distribution operations, feeder reconfiguration
can be used to minimize line losses. The operational constraints
have to be identified and satisfied. Meanwhile, the final network
must remain radial with all the loads connected.

upgrudc.
PE-809-PWRD-0-O6-1997 A paper recommended and approved by
the lEEE Transmission and Distribution Committee of the IEEE Power
Engineering Society for publication in the IEEE Transactions on Power
Delivery. Manuscript submitted December 26, 1996; made availabie for
printing June 11, 1997.

Fig. 1 Three-feeder sample system

Figure 1 shows a sample distribution network[9] consisting
of three feeders with thirtecn normally closed switches and three
tie switches. The notation (X,Y) is used to denote the operation of
opening switch Y and closing switch X. For instance, operation
(sl2,sl5) transfers Load 5 from Feeder I to Feeder II by opening

a sectionalizing switch S12 and closing the tie switch SI5. That
is, closing a switch should always be followed by the opening of
a switch.
From [15], the power loss in the line section between two

adjacent buses i and j can be computed by

where

: branch resistance between Bus i and Bus j

I.J

V-t(V. ): Bus i 0) voltage

Y : branch admittance between Bus i and Bus i

where
AVn : the voltage drop between two terminis of Branch N
AV2av : the mean square voltage drop of all branches for a
chosen loop co
: weighing factor
The voltage ndex \^ is depicted in Figure 2 to show the
degree of each branch voltage drop.

The loss reduction problem can be formulated by minimizing

satisfying the electrical constraints of current and voltage limits.

When a fault occurs in the system, the faulty component(s)
can be isolated by opening appropriate switches. The process will
lead to the loss of loads. As a matter of fact, the distribution
network can be dividcd hito three groups after the fault
isolation[16]: 1) unaffected load points with sources; 2) the source
points; 3) the affected loads without sources. Service restoration
should find the best restoration strategy for the last group after the
fault. Besides, the following requirements should be enforced
during the restoration process.
1)mnimum switching
2)mnimum losses
3)satisfying the voltage and current constraints
4)using switches as cise to tie switches as possible

III. DEFINITION OF SWITCHING NDICES

For the distribution network, closing a tie switch will crate
a loop. The proposed algorithm starts with closing all switches[8]
to crate a meshed network. This meshed network will contain
many close-loops ( or "meshes"), and each loop should have a
"best" opening point for mnimum loss. Opening a switch in each
created loop, the radial topology can be regained. In the normal
operational state, our goal is to find the optimal "opening" switch
for each loop. In restorative state, the goal is to find the optimal
"closing" switch for each split group. In this paper, three
switching ndices were defined to search for the solution. The
node vollages and line parameters were used to define sets V and
. The defmitions of switching ndices for (/'
and L are
described below.

Fig. 2 Voltage ndex (i^

Line constants R and Y can also be used to minimize Equation

(1). Low current flow is expected for high R\Y\~ valu. An ohmic
index |i - can be defined as

where

R, : the average branch resistance for a chosen loop Y :

the average branch admittance for a chosen loop co:
weighing factor Figure 3 shows the degree of R\Y\~ for
index n The decisin index \i . can now be defined for the decisin
set D by using the product operation of ndices \x-and \ - as

Fig. 3 Ohimc ndex ,u The voltage index

The decisin index |i-

Minimizing R, :(|V: - Vj ||y j|) 2, it can be seen that low

voltage drop yields low loss. A voltage index \x - can be defined
for a particular Branch N (from i to j ) by

Start

Under nonnal operational state, the optimal decisin can be

obtained by

Read network and switch data

Cise all tie switches, crate meshed

network and nin AC load flow
loop i

For restorative state, the optimal decisin can be oblain by

Compute the switching ndices
UT \Xy
for all branches

with a "selected" groupofn- explained in a later section.

Use new approach to find the
optimal solution with mximum

Weighing factor co
For a loop created by closing a specific lie switch, a weighing
factor co is defined for each sectionalizing switch according to its
distance to this specific tie switch. If there are m number of switches
in a loop as shown in Figure 4. The weighing factor for the tie
switch and two neighboring switches are assigned the valu 1/m.
Branches b2, b2', and b3, b3' are 3/m. All the rest can be assigned in
a similar manner.

loop i
Open the selected loop
switch, starting from the
source loop

Constraint
-^violation ?

Yes

Cise the chosen switch, open

the switch with the second
largest nT, for the loop

No

Branch
bo bi br
b2 te1 bj te'
b4 br te te'

te te' te t>?.

co
1/m
3/m
5/m
7/m

Reconfiguration and report

^ Stop J

Fig. 4 Switch weighing factor in a loop

IV. THE SOLUTION PROCESS

Loss reduction
Figure 5 is the flowcliart of the overall reconllguration
process in the nonnal operational stalc.
Reconllguration should start from the upstream loops, that
is, according to the order of the mximum power flow calculated
for each loop. If a switch has already been selected in the previous
loop, it will be eliminated from searching in the next loop.
Example 1: Three-feeder system[9].
The sample distribution system in Figure 1 is used for
example. Tablc I shows the line data.
Closing all tie switches will crate a meshed network as
shown in Figure 6. Three loops are created in this network. The
switching ndices V, L and ) are computed and shown in Table n.
Fig. 5 Normal Loss Minimization Scheme

Fig. Mesh network of the sample system

Table I Data of the three-fceder samplesystem

Base: 100MVA,23KV
Bus
From- To
1-4

Resistance
(p.u.)
0.075

4-5

0.080

0.11

3.0

15

1.1

4-6

0.090

0.18

2.0

08

1.2

6-7

0.040

0.04

1.5

1.2

2-8
8-9
S-10
9-11
9-12
3-13
13-14

0.110
0.080
0.110
0.110
0.080
0.110
0.090

0.11
0.11
0.11
0.11
0.11
0.11
0.12

40
5.0
1.0
0.6
4.5
1.0
1.0

2.7
30
0.9
0.1
2.0
0.9
0.7

13-15
15-16
5-11

0.080
0.040
0.040

0.11
0.04
0.04

1.0
2.1

0.9
1.0

10-14

0.040

0.04

7-16

0.090

0.12

Reactance
(p.u.)
0.10

P(MW) (End Q(MVAR)

(End Bus)
Bus)
2.0
1.6

Cap.(MVAR)
(End Bus)

1.2
0.6
3.7
1.8
1.8

Table II Swilching ndices o // , L, D for samplc system

Loop 1

*V

Loop 3

sil

0.39753

0.71479

0.28416

sl2

0.64733

0.85964

0.55647

sl2
sl5

0.93953
0.99702

0.90409
0.74718

0.84942
0.74495

sl3
si 4

1
0.993S4

0.92522
0.86440

0.92522
0.85907

sl9*
si
sl6
Loop 2

0.97931
0.79692
0.20357

0.89944
0.73899
0,72764

0.88083
0.58891
0.14813

063256
0.76232
0.20518
0.60177

0.68281
0.88057

0.64585
0.76723
0.70264
0.76724

0.12376
0.99927

0.97941
0.99359
0.29202
0.78434

sl6
si 7*

sl5
sl7
si 8
sl9

0.08450
0.87994

s21
s23

0.97568
0.35179

0.64585
0.85964

0.63015
0.30241

s21
s24

0.99722
0.91905

0.70487
0.89412

0.70291
0,82174

s24
s25

0.63867
0.99824

0.86944
0.86439

0.55529
0.86287

s22

0.52372

0.68281

0.35760

s26*

0.99992

0.95444

0.95437

From Table II, we can see that the switches to be opened are
si9, si7, and s26 for the three loops respectively. The switching
operations are thus (sl5,s19) and (s21,sl7). Since s26 is already
opened, there is no need to change. For this particular example,
the power loss is 8.86% less than the original network as those
derived by other methods|2, 8-14] as shown in Table TTT.
Table III Loss analysis of the sample system
Loss (p.u.) Afier-

Switching times Loss (p.u.) Beforeswitching

2

Loss reduction (%)

switchmg

0.005115

8.86

0.004662

Service restoration
Identify all the Ns
switches for restoration. i =
1

Cise the ne.xt switch with mnimum

Constramt
violation ?

No

Display the swilches

for reconimiration

Yes

i >Ns

Yes

No
Abort the selected switch

Load shedding

Stop

Fig. 7 Service Restoration Scheme

Figure 7 shows the flowchart of the proposed restoration
algorithm. There is no need to re-compute the ndices. All ndices
used are the ones obtained in the normal state. Restoration
scheme has to identify the "faulty group without sources" first.
All tie switches connecting this group and other groups are the
candidate switches for restoration. It can be seen
that the state space is confined by this search, which will

enhance the performance substantially. If a candidate tie switch

has two different ndices \x ^ _ being a common branch between
two neighboring loops, the lower M should be chosen, Note
that for restoration, if the constraints can not be satisfied by the
chosen switches, load shedding has to be performed. For load

shedding, the electric componenl vvilh violation should be

identified and low priority loads beyond this componenl need to
be shed. In addition, if there is not any altrnate path available
for service restoration, service can not be restored until finish
repairing the faulty components.

Fig. 8 System configuration after isolation of faults

for example 2
Table IV All possible service restoration paths for
example 2
Path

Switch to be closed

1 (Group 1- Group 2)
2 (Group 3- Group 2)

sl9
sl7

Example 2.
The same system in Figure 1 is used again. Note that the
sample system is now a "better" network after the
reconfguration. A fault is assumed on component sl6. After fault
isolation, the system will be divided into four groups. As shown
in Figure 8, Group 2 has load points without sources. Group 2 is
the affected group. On the other hand, Group 1 and 3 have source
points, . so there are two paths for service restoration. Table IV
shows the two paths. From Table IV, we can see that Switch si7
should be chosen to cise. Running Load Flow shows that the
switching could crate a voltage violation. The next search si9
will also crate a voltage violation. Assuming that Load 12 is a
low priority load, Load 12 has to be shed to relieve the low
voltage violation on node 9. Service of Group 2 can now be
restored, satisfying the voltage and current constraints.

D
0.88083
0.87994*

V. TEST RESULTS AND DISCUSSION

The distribution network for reconfguration presented in
[10] is used for extensive testing. The figure is redrawn below
for convenience. The network consists of 32 buses and 5 looping
branches (tie lines) as shown in Figure 9. The total loads are
5084.26 kvv and 2547.32 kvar. Various tests have been run for
the proposed method. Part of the testing results are shown below
for examples. Methods proposed in other papers were also used
for comparison Examples are given to show results of the
performance test.
Loss reduction
Based on the proposed algorithm, the ndices JJ - are
calculated in Table 5. From Table V, the optimal break points

are {s~, s9, sl4, s37, s32} for each loop. In loop 3, although
Switch s9 has the largest index x ~ t has already been selected
by the previous loop. Switch s 14 with second largest u. - will be
chosen mstead. Switch s37 is a tie switch and is
^D

normally opened in the original network. Therefore, the

switching operation is to open switches s7, s9, ,s!4, s32, and
cise tie switches s33, s35, s34 and s36.

Fig. 9 Test network with loop number

Table V ndices for decisin set b
loop 1
swnch
s2

IX b
D

0.6662

s3

0.3809

s9

0.86S9

s4

0 6647

slO

s5

0.5502

loop 3
switch

ti f
D

^D

s9

loop 4
switch
0.9591
s3

loop 5
switch
0 5104
s25

0.3694

slO

0.4476

s4

0 5333

s26

0.5459

0.3762

sil

0.654S

s5

0.3260

s27

0.1911

sil

0.8426

sl2

0.3973

s22

0 6274

s28

0.5473

s6

0.9270

s21

0.8597

si 3

0.7988

s23

0.32S5

s29

0.5320

s7

0.9471

s35

0.6130

sl4

0.9434

s24

0 8267

s30

0.7523

sl8

0.3200

s33

0.2186

s34

0.5024

s25

0.4214

s31

0.8916

sl9
s20
s33

0.1928
0.9272
0,8796

s26
s27
s28
s37

0 6850
0 7367
0.9353
0.9397

s32
s36
si 5
sl6
s!7
s34
s6
s7

0.9774
0.9724
0.8601
0.7149
0.9681
0 3052
0.8715
0.7369

s8

0.5830

Fig. 10 Test system after isolation of fault on s5, s35

loop 2
switch
0.0818
s8

strategy is path 1. And the best restoration strategy for Group i to

Group 3 is path 4. Switches s9 and s7 should be closed for
restoration. Running Load Flow shows that there are no violations.
Fig. 11 Reduced network for Figure 10 Pable VI All
possible paths for service restoration switches

Path

Switch to be closed
s9

1 (Group 1- Group 2)
2 (Group 1- Group 2)
3 (Group 1- Group 3)
4 (Group 1- Group 3)
5 (Group 1- Group 3)

b
0.8689*
0.9591
0.9395
0.7369*
0.9774

sl4
s37
s7
s32

Service restoration

Performance test

Two faults wcre assumed to occur on components s5 and

s35 in the system. Aer fanlt isolation, the system can be divided
into three groups. In Figure 10, il can be sccn that Groups 2 and
3 have load points wilhout sources. Groups 2 and 3 are the
affected groups. Group 1 has sottrce points to supply power for
restoration. In order to find all possible service restoration
strategies, the network shown in Figure 10 is redrawn in Figure
11. 'Pable VI shows all candidate restoration strategies. From
'Pable VI, we can see that for Group 1 to Group 2, the best
restoration
Table VII Summary of test results

The etTectiveness of the proposed methods were

compared with many other methods for loss reduction. The
conventional methods of running power flow or expert systems
need more computing power and are less effective than the
proposed mefhod[2,8-14,17]. Among the many methods, the
three methods developed by Goswami and the three methods
developed by Baran and Wu liad nsed the same test system as
shown in Figure 9, and are thus shown here for comparison in
Table Vil to see the performance of the proposed method[ 10,17].
Note that Baran Method 2 and 3 yield the same result.
load allocation in distribution systems", IEEE Trans. on
Power Delivery, No. 1, 1987, pp. 147-155.
[3] K. Aoki, H. Kawabara, T. Satoh, M. Kanezashi, "An efficient
algorithm for load balancing of transformers and feeders",
IEEE Trans. on Power Delivery, Vol. 3, No. 4, 1988, pp.
1865-1872.
[4] K. Aoki, H. Kuwabara, T. Satoh, M. Kanezashi, "Outage
state optimal load allocation by automatic sectionalizing
switches operation in distribution system", IEEE Trans. on
Power Delivery, Vol. pwrd-2, No. 4, Oct. 1987, pp. 11771185.
[5] K. Aoki, T. Satoh, M. Itoh, H. Kuwabara, M. Kanezashi,
"Voltage drop constrained restoration of supply by switch
operation in distribution systems", IEEE Trans. on Power
Delivery, Vol. 3, No. 3, July 1988, pp. 1267-1274.

Switching
times

Goswami
Metlicd 1

Goswami
Method 2

Goswami
Method 3

Baran
Method 1

Baran
Method2,3

Proposed
Method

(35,8)

(37,28)

(33,7)

(33,6)

(33,6)

(33,7)

(37,28)

(33,7)

(34,9)

(35.11)

(35,11)

(35,9)

(36,32)

(35,11)

(35,14)

(36,31)

(36,31)

(34,14)

4
5
6
7

(34,! 4)
(8.9)
(33,7)
(28,37)
31.148

(34,14)
(36,32)
(28,37)
(11,9)
31.148

(36,32)

(37,28)
(6,33)

31 148

27.83

Total loss
reduction(%)

(36,32)

23.826

31.148

From Table VII, t can be seen that the proposed

algorithm is effective with mnimum switching operations.
Compared with Goswami Method 3, the proposed method can
avoid complicated numerical computation to yield a good
performance.
VI. CONCLUSIN
In this paper, a new approach has been developed for the
distribution network reconfiguration to minimize line losses and
restore services. This algorithm adopts a switching index_ to get a
proper set of switching operations. Switching ndices were
derived by using branch voltage drops and line constants. In
normal operational state, switches with the largest ndex in each
loop are considered for switching. Under service restorative
state, the candidate switches with the smallest ndex are
considered to restore disconnected load points. This process
confines the size of feasible states. Numerous tests have shovvn
that the proposed technique is eomputationally robust and
sfficient, and is suitable for both planning and operating
purposes.

VII. REFERENCES
[1] Y. H. Tsai, "Fault processng of feeder dispalch control
system for Taipei South District Office", Taipower Monthly
Joumal, Vol. 567, 1995, pp. 11-25.
[2] K. Aoki, T. Ichimori, M. Kanezashi, "Nonrial state optimal

(61 K. Aoki, K. Nara, M. Itoh, T. Satoh, H. Kuwabara, "A new

algorithm for service restoration in distribution systems",

IEEE Trans. on Power Delivery, Vol. 4, No. 3, July 1989, pp.
1832-1839.
[7] C. S. Chen, M. Y. Cho, "Determination of critical switches
in distribution system", IEEE Trans. on Power Delivery, Vol.
7, No. 3, 1992, pp. 1443-1448. [8] D. Shirmohammadi, H.
W. Hong, "Reconfiguration of
electrical distribution networks for resistive line losses
reduction", IEEE Trans. on Power Delivery, Vol. PWRD-4,
1989, pp. 1492-1498. [9] S. Civanlar, J. J. Grainger,
H. Yin, S. S. H. Lee,
"Distribution feeder reconfiguration for loss reduction",
IEEE Trans. on Power Delivery, Vol. PWRD-3, 1988, pp.
1217-1223. [10] M. E. Baran, F. F. Wu, "Network
reconfiguration in
distribution systems for loss reduction and load balancing",
IEEE Trans. on Power Delivery, Vol. PWRD-4, 1989, pp.
1401-1407. [11] R. E. Lee, C. L. Brooks, "A method and its
application to
evalate automated distribution control", IEEE Trans. Power
Delivery, Vol. 3, 1988, pp. 1232-1240. [12] T. Taylor and D.
Lubkeman, "Implementation of heuristic
strategies for distribution feeder reconfiguration", IEEE
Trans. Power Delivery, Vol. 5, 1990, pp. 239-245. [13] C. C.
Liu, S. J. Lee, and S. S. Venkata, "An expert system
operational aid for restoration and loss reduction of
distribution systems," IEEE Trans. on Power Delivery, Vol.

3, 1988, pp. 619-625. [14] C. C. Liu, S. J. Lee, and K. Veu,

"Loss minimization of
distribution feeders: optimality and algorithms", IEEE Trans.
on Power Delivery, Vol. PWRD-4, 1989 pp. 1281-1289. [15]
Y. Baghzouz, S. Ertem, "Shunt capacitor sizing for radial
distribution feeders with distorted substation voltages",
IEEE Trans. Power Delivery, Vol. 5, No. 2, April 1990, pp.
650-658. [16] N. D. Sarma, Soumen Ghosh, K. S. Parakasa
Rao, Manda
Srinivas, "Real time service restoration networks", IEEE
Trans. on Power Delivery, Vol. 9, No. 4, Oct. 1994, pp.
2064-2070. [17] S. K. Goswami, S. K. Basu, "A New
Algorithm for
Reconfiguration of Distribution Feeders for Loss
Minimization", IEEE Trans. on Power Delivery, Vol. 7, No.
3, July, 1992, pp. 1484-1490.

Whei-Min Lin was born on October 3rd, 1954. He received his

BS-EE from the National Chao-Tung university, MS-EE from
the University of Connecticut, and his Ph.D. EE from the
University of Texas in 1985. He worked at Chtmg-Hwa Institute
for Economic Research, Taiwan, as a visiting researcher after his
graduation. He joined Control Data Crop. in 1986 and worked
with Control Data Asia in 1989. He has been with National Sun
Yat-Sen university, Taiwan, since 1989. Dr. Lin's interests are
GIS, Distribution System, SCADA and Automatic Control
System. Dr. Lin is a member of IEEE and Tan Beta Pi.
Plong-Chan Chin Received his MS degree from the National
Sun Yat-Sen University in 1991. Currently, he is pursuing his
Ph.D degree in the same University. Flis interests are Energy
Management Systems and Distribution Automatic System.