Electric Power Systems Research 69 (2004) 305–310

Formulation of distribution reconfiguration problem

using network topology: a generalized approach
V.N. Gohokar∗ , M.K. Khedkar, G.M. Dhole
Power System Lab, Shri Sant Gajanan Maharaj College of Engineering, Shegaon 444203, Maharashtra, India

Received 17 June 2003; received in revised form 19 September 2003; accepted 6 October 2003

Abstract

Radial distribution reconfiguration problem formulation is rather difficult from the computer simulation point of view. Complexity of
distribution network increases with increase in numbers of laterals and sublaterals. This needs a generalized approach, by which any radial
distribution system can be solved. This paper describes the formulation of the reconfiguration problem using network topology approach.
Algorithm developed can be used in general to radial system with any number of bifurcations. A modified iterative load flow method is also
discussed to assist the reconfiguration problem. Simple and efficient technique is described to detect the loops formed during reconfiguration
process. Formulation of single loop optimization problem is implemented to obtain network reconfiguration under normal operation.
© 2003 Elsevier B.V. All rights reserved.

Keywords: Network reconfiguration; Network topology; Single loop optimization

1. Introduction aimed at the reduction of the search space. In order to speed

Problem formulation of distribution system is indeed a
difficult task as the electric distribution systems are mostly
configured as radial for proper relay coordination. It cre-
ates a difficulty for simulation when the system laterals and
sublaterals are very large. The methodology to develop the
problem may be different for different systems. The system
reconfiguration is mainly done by closing and opening the
tie and sectionalizing switches for loss minimization. Sev-
eral heuristic schemes were proposed for this.
Reconfiguration of distribution feeders results into con-
siderable reduction in transmission loss. Distribution feeder
reconfiguration can be used at planning stage and also in
real time control. The desirable formula of method for
solution of reconfiguration problem with the capability to
having minimum computational efforts and eliminating un-
desirable switching options is developed in [1]. In addition
to network reconfiguration for loss reduction, load balanc-
ing is also taken into account in [2]. Heuristic methods
have been suggested for the efficient solution of the optimal
network configuration outlined in [3]. A rule-based expert
system is developed in [4] taking various switching options,
up the computation time required for switching operation
efficient load flow methods are employed in [5,6].
The single loop optimization is one of the simple meth-
ods based on simplex algorithm to reconfigure the system
[7]. This scheme quickly checks the possibilities of switch
positions for the minimum loss configuration and proposes
a heuristic scheme to develop the optimal switch plan with
minimum switch operation. In this paper a single loop opti-
mization scheme is applied to a hypothetical five transformer
33/11 kV distribution network. Formulation of the problem
is made simpler using the network topology approach.
The network topology helps in the development of gen-
eralized formulation of the problem. The tree and co-tree of
the graph represents, respectively, the original configuration
branches (twigs) and switching possibilities (links). Such
formulation helps in application of KCL and identification
of the loops formed after closing the tie switches. This pa-
per also describes a simple and efficient load flow iterative
scheme.
2. Network topological approach

∗ Corresponding author. The network topology proves its usefulness in the analysis
E-mail address: vngohokar@rediffmail.com (V.N. Gohokar). of power system due to its ability to represent the system

0378-7796/$ – see front matter © 2003 Elsevier B.V. All rights reserved.
doi:10.1016/j.epsr.2003.10.005
306 V.N. Gohokar et al. / Electric Power Systems Research 69 (2004) 305–310
into matrix form, by which the solution can be obtained very
easily. The formation of the appropriate network matrix is
an integral part of a digital computer program for solution
of power system problem.
In a radial distribution system, it is rather difficult to ob-
tain the system condition. If the laterals and sublaterals are
many in number, load flow calculations and identifying the
system loops involve lot of computational work. These draw-
backs can be overcome by using the network topology to a
particular radial system. This also improves the flexibility in
numbering the nodes and branches. Again the application of
KCL and KVL is quite easy, as compared to conventional
approaches. This approach does not require obtaining the
nodes beyond particular branches for load flow studies. It
also helps in obtaining the loop formation due to closing of
switches in the system to reduce losses.
To reconfigure the system, it is necessary to obtain the tree
and co-tree of a particular radial distribution system. This
tree and co-tree formulation indeed identifies the connectiv-
ity of the nodes and branches and formation of the loop. In
the analysis of electrical network, formulation of a suitable
model is the first step and model must describe the character-
istics of individual network components. A network matrix
equation provides a convenient model for digital simulation.
KCL can be applied easily by developing the bus inci-
dence matrix (A) for the twigs in the system. KCL at every
node is given by (1)
AT ib = ILoad (1)
where A is the b × n Bus incidence matrix considering the
source node as the reference node; ib the b × 1 branch or
twigs current matrix; ILoad the n × 1 load current matrix; b
the number of twigs or branches, n (number of nodes) − 1.
Fig. 1. Primary distribution network.
Using (1), it is easy to calculate the twigs current as given
in (2).
ib = kILoad (2)
This formulation assumes that the links are not added in
the system (i.e. original system configuration). Formulation
of the path incidence matrix helps to identify the path from
a particular node to reference node. Total system losses can
be obtained using (3)
TLoss = iTb R̃ib (3)
R̃ is the b × b diagonal matrix of resistances of the feeders.
The identification of the loop formed due to addition of
tie switch, i.e. link can be done by formulating the loop
incidence matrix for the branches and links. Eq. (4) helps in
identifying the loops formed in the complete system.


−(Al kT )T
C= (4)
ul
where C is the loop incidence matrix; Al the Bus incidence
matrix for the links; ul the unity matrix for links; k the path
incidence matrix for the branches.
Consider primary distribution network shown in Fig. 1
to illustrate (4). CB1–CB5 are normally closed sectionaliz-
ing switches and CB6–CB7 are normally open Tie switches.
Two main feeders are outgoing from substation (SS). Vari-
ous nodes, branches and links are numbered as mentioned
in figure. When the tie switches are closed, two closed
loops are formed which are identified by loop incidence
matrix C.
Graph of primary network is shown in Fig. 2. Matrix A,
Al , k and transpose of matrix C (CT ) are as given below.
 V.N. Gohokar et al. / Electric Power Systems Research 69 (2004) 305–310 307

efficient load flow iterative scheme is described here using

network topology approach [10]. It needs no particular se-
quence or order for numbering nodes and branches. They
can be numbered in any sequence. Initial condition required
for this method is the power flow data in the first section of
feeder outgoing form substation bus. This data can be eas-
ily metered at substation. Load flow and voltages are deter-
mined in forward direction.
Consider a distribution feeder connected between nodes
p and q represented by nominal model. If power flow and
voltage of sending end of a feeder is known, then it is easy
to calculate the voltage of the nodes by using (6)

Ypq
Fig. 2. Graph of primary distribution network. Spq
Eq = Ep + Ep Zpq − Zpq (6)
  2 Ep∗
−1 0 0 0 0 0
 1 −1 0 0 0 0  where Ep , Eq are the voltages of p and q nodes, respec-
   the shunt admittance of transmission line; S
tively; Ypq
 1 0 0 0 −1 0  pq
A=


 0 1 −1 0 0 0 

the complex power flowing through the feeder p–q; Zpq the
 0 0 0 −1 0 0  impedance of feeder p–q.
0 0 0 1 0 −1 If the power flows through the initial feeders, i.e. at the

 substations are known, then the voltages at all other nodes
0 1 0 0 −1 0 can be easily obtained. The following algorithm presents an
Al =
0 0 1 −1 0 0 iterative procedure to calculate the system load flow.
  1. Obtain the real power and reactive power flow through
1 1 1 0 1 0 each feeder section other than initial feeder by (7) and
0 1 1 0 0 0
  (8). Considering zero loss in each section.
0 0 0 0 1 0
k=0
 Ptot = kPLoad
 0 1 0 0 0
(7)
0 0 0 1 0 1 Qtot = kQLoad (8)
0 0 0 0 0 1

 PLoad , Qload are n × 1 matrix of real and reactive com-
0 1 −1 0 0 0 1 0 ponents of loads at each node except the reference node,
CT =
1 1 0 1 −1 0 0 1 respectively.
2. Assuming flat start, calculate real and reactive loss in
Inspecting first row of CT , it is observed that elements
every section of distribution network using
of branches 2, 3 and 7 are nonzero which indicate the loop
formed by closing tie switch CB7. Also inspection of second b

2 (i) + Q2 (i)
Ptot
row of CT shows that loop formed by closing CB6 includes PLoss (j) = k(j, i) tot
r(i) (9)
|Ei |2
branches 1, 2, 4, 5 and 8. Formulation of loops helps in i=1,i=j
application of KVL to a particular loop as per Eq. (5) b

2 (i) + Q2 (i)
Ptot
CT e = ELoop (5) QLoss (j) = k(j, i) tot
x(i) (10)
|Ei |2
i=1,i=j
The above formulation helps to simplify the radial distri-
bution reconfiguration problem with ease and convenience where j = 1, 2, . . . , n; r and x are the resistance and in-
for the computer simulation. ductive reactance of feeder, respectively. In (9) and (10),
Ei is the sending end node voltage of ith element. Calcu-
late real and reactive loss in the every section of feeder
3. Load flow analysis of radial distribution system by using (9), (10), respectively.
3. Increment the complex power of each feeder by adding
Load flow analysis is an integral part of the distribution PLoss and QLoss to Ptot and Qtot
system reconfiguration. It involves more computational ef-
forts in simulation and programming. For radial and com- P = Ptot + PLoss
plex nature of distribution network unique lateral, node and Q = Qtot + QLoss
branch numbering scheme is described in [8]. The sequence
of numbering main, laterals and sublaterals is maintained where P, Q represents real and reactive power through
by [9] in order to solve load flow problem. A simple and each branch.
308 V.N. Gohokar et al. / Electric Power Systems Research 69 (2004) 305–310

4. Obtain the voltages of each node other than slack node
using (6).
5. Correct the PLoss and QLoss to new voltage and repeat
steps (3) and (4).
6. Stop the calculations if voltage difference between two
consecutive iterations is within specified tolerance.
given by (11). The loads are represented by constant current
representation model, which in turn do not alter the loop
currents. As opening of branch changes the load flow profile
of the system, it is necessary to obtain load flow at each
iterative stage.

Loss = |I|2 × rLoop

The convergence of this algorithm is quite comparable

with other schemes. + 2 × real( r × ILoop × I ∗ ) (11)

where rLoop = |CT | × r; I the change in loop current due

4. Single loop optimization to opening of the branch.
The detailed explanatory algorithm for single loop opti-
Due to implementation simplicity, computational effi- mization technique is given below.
ciency, solution feasibility and optimality, single loop opti-
1. Obtain load flow of initial configuration.
mization technique has been implemented successfully for
2. Decide which link to be added based on maximum volt-
network reconfiguration problem. In this a heuristic switch
age difference criterion.
plan is developed for network reconfiguration from initial
3. Find out which branches are included in the loop
configuration to optimal configuration.
by forming the basic loop incidence matrix given by
Decision of which switch is to be closed is based on
(4).
the voltage difference across the link. Link across which,
4. Find out loop current by, ILoop = CT × Iele , where Iele =
maximum voltage difference occurs is selected for closing.
[IBr /ILink ]; IBr the branch currents; ILink the link cur-
This leads to a simple problem to decide which branch to
rents; Iele the element current; ILoop the loop currents.
be opened to make a system radial.
5. Open the loop branch, I the branch current which is to
It is necessary to maintain a radiality of system for bet-
be opened. Calculate Loss by using (11).
ter protection. After closing link a loop formation occurs,
6. Search for minimum loss increment opened the branch
branches, which form a loop, can be obtained rather easily
having minimum loss increment.
by forming a loop incidence matrix. From which it is rather
7. Take load flow of new configuration and repeat the steps
easy to make the decision which branch is to be opened. The
(2)–(7).
decision of branch, which is to be opened, is made on the
basis of minimum loss increment criterion. This leads to an
iterative procedure of closing of an open switch and opening 5. Test results
a closed switch, which converges in a few iterations.
The criterion for the branch to be opened is based on Single loop optimization approach is tested over a hy-
minimum loss increment and is decided by calculating Loss pothetical five transformer, 11 kV system shown in Fig. 3.

Fig. 3. Hypothetical test system.

 V.N. Gohokar et al. / Electric Power Systems Research 69 (2004) 305–310 309

Table 1 Table A.1 (Continued )

Switch plan
Line number Nodes p–q Resistance () Reactance ()
Switch to be closed Switch to be opened Loss in MW
7 7–8 0.26 0.078
Sb Eb Sb Eb 8 8–9 0.07 0.021
9 1–10 0.22 0.1448
4 71 70 71 1.0267 10 10–11 0.04 0.0263
66 107 64 65 0.9992 11 11–12 0.29 0.1044
23 43 23 43 0.9992 12 12–13 0.14 0.0504
13 13–14 0.36 0.1296
14 14–15 0.05 0.015
15 12–16 0.20 0.06
It is assumed that there are 15 switching possibilities 16 16–17 0.19 0.057
for transforming the load amongst the transformer. In all 17 11–18 0.06 0.0395
there are 118 branches. The data of the system is given in 18 18–19 0.06 0.0395
Appendix A. 19 19–20 0.02 0.0132
Table 1 gives the switch plan for optimal load transferring 20 20–21 0.04 0.0263
21 1–22 0.04 0.0263
between the transformers at the peak load hour condition. It 22 22–23 0.47 0.141
is observed that for this system at least 5% loss reduction 23 23–24 0.31 0.1116
occurred in comparison with the fully meshed reconfigured 24 24–25 0.11 0.0348
system. 25 25–26 0.26 0.078
Total loss of initial configuration of the system is 26 26–27 0.07 0.0252
27 28–29 0.15 0.0988
1038.59 kW, having initial transformer currents, re- 28 29–30 0.04 0.0922
spectively, 514.3852, 174.9321, 394.4794, 694.2161, 29 30–31 0.04 0.0922
235.2665 A. 30 30–32 0.07 0.081
Referring to Table 1, it is concluded that in merely three 31 32–33 0.04 0.018
iterations the optimal solution of network reconfiguration is 32 33–34 0.26 0.078
33 34–35 0.26 0.078
reached, reducing the system losses to 999.2 kW. 34 30–36 0.18 0.054
35 30–37 0.29 0.087
36 37–38 0.11 0.033
37 39–40 0.1 0.0658
6. Conclusion 38 40–41 0.1 0.0658
39 41–42 0.1 0.0658
In this paper, radial and complex distribution networks 40 42–43 0.06 0.0395
have been solved very efficiently using the network topol- 41 43–44 0.06 0.0395
ogy approach. In the proposed method, branches and nodes 42 44–45 0.14 0.0812
43 45–46 0.09 0.0324
can be numbered in any sequence. Load flow and identifi- 44 44–47 0.113 0.0407
cation of loop after addition of links are handled in a simple 45 44–48 0.09 0.0593
way. The proposed method has been tested on a five trans- 46 39–49 0.07 0.0461
formers, 11 kV system having a large number of branches. 47 49–50 0.04 0.0263
The solution results in at least a 5% loss reduction through 48 50–51 0.05 0.0329
49 51–52 0.05 0.0329
reconfiguration. 50 52–53 0.08 0.0527
51 53–54 0.04 0.0263
52 54–55 0.135 0.0486
53 54–56 0.135 0.0486
Appendix A 54 57–58 0.1306 0.047
55 58–59 0.1354 0.0487
Tables A.1 and A.2 give system data for a hypothetical 56 59–60 0.1354 0.0487
five-transformer distribution system. 57 60–61 0.1354 0.0487
58 61–62 0.1129 0.0406
59 62–63 0.1129 0.0406
60 63–64 0.0691 0.0249
Table A.1
61 64–65 0.0826 0.2974
Line data of sample system
62 57–66 0.3876 0.1395
Line number Nodes p–q Resistance () Reactance () 63 66–67 0.2239 0.0672
64 67–68 0.08502 0.0306
1 1–2 0.12 0.0432 65 68–69 0.0702 0.0253
2 2–3 0.11 0.0396 66 69–70 0.1278 0.0460
3 2–4 0.15 0.054 67 57–71 0.1682 0.1101
4 4–5 0.05 0.018 68 71–72 0.1354 0.0487
5 5–6 0.05 0.018 69 72–73 0.1354 0.0487
6 1–7 0.25 0.075
310 V.N. Gohokar et al. / Electric Power Systems Research 69 (2004) 305–310

Table A.1 (Continued ) Table A.2

Line data for switching possibilities (links)
Line number Nodes p–q Resistance () Reactance ()
Link number Nodes p–q Resistance () Reactance ()
70 73–74 0.0555 0.020
71 74–75 0.1010 0.0364 118 3–53 0.27086 0.0975
72 75–76 0.1010 0.0364 119 15–27 0.27086 0.0972
73 76–77 0.0688 0.0248 120 22–36 0.16 0.0576
74 77–78 0.0777 0.028 121 22–43 0.12 0.0432
75 77–79 0.1971 0.0591 122 31–11 0.1424 0.0513
76 71–80 0.0420 0.0151 123 51–38 0.09 0.0324
77 57–81 0.1866 0.1229 124 54–9 0.31 0.1116
78 81–82 0.0622 0.0409 125 65–106 0.1319 0.0475
79 82–83 0.0622 0.0409 126 65–96 0.06 0.0216
80 83–84 0.0869 0.0313 127 83–70 0.13543 0.0488
81 84–85 0.0515 0.0216 128 116–69 0.1542 0.0558
82 85–86 0.0767 0.0276 129 118–80 0.0217 0.0078
83 86–87 0.0840 0.0302 130 119–71 0.06 0.0216
84 87–88 0.0601 0.0216 131 3–70 0.27086 0.0975
85 88–89 0.0536 0.0194 132 56–89 0.2363 0.0851
86 89–90 0.0669 0.0241
87 88–91 0.0536 0.0131
88 57–93 0.2233 0.0804 References
89 93–94 0.0622 0.0409
90 94–95 0.0622 0.0409
[1] S. Civanlar, J.J. Grainger, H. Yin, S.S.H. Lee, Distribution feeder
91 95–96 0.0622 0.0409
reconfiguration for loss reduction, IEEE Trans. Power Delivery 3 (3)
92 96–97 0.0622 0.0409
(1998) 1217–1223.
93 97–98 0.0311 0.0205
[2] M.E. Baran, F.F. Wu, Network reconfiguration in distribution systems
94 98–99 0.03732 0.0246
for loss reduction and load balancing, IEEE Trans. Power Delivery
95 99–100 0.03732 0.0246
4 (2) (1989) 1401–1407.
96 100–101 0.03732 0.0246
[3] D. Shirmohammaddi, H. Wayne Hong, Reconfiguration of electric
97 98–102 0.0622 0.0409
distribution networks for resistive line losses reduction, IEEE Trans.
98 102–103 0.02488 0.106
Power Delivery 4 (2) (1989) 1492–1498.
99 104–105 0.4875 0.1755
[4] T. Taylor, D. Lubkeman, Implementation of heuristic search strategies
100 105–106 0.2167 0.078
for distribution feeder reconfiguration, IEEE Trans. Power Delivery
101 106–107 0.0449 0.0296
5 (1) (1990) 239–246.
102 107–108 0.07692 0.0401
[5] H.-D. Chiang, R. Jean-Jumeau, Optimal Network reconfigurations
103 108–109 0.1490 0.0536
in distribution systems. Part 2. Solution algorithms and numerical
104 109–110 0.0544 0.0196
results, IEEE Trans. Power Delivery 5 (3) (1990) 1568–1574.
105 106–111 0.11 0.033
[6] H.-D. Chiang, R. Jean-Jumeau, Optimal network reconfigurations
106 104–112 0.052 0.0187
in distribution systems. Part 1. A new formulation and a solution
107 112–113 0.1273 0.0458
methodology, IEEE Trans. Power Delivery 5 (4) (1990) 1902–1909.
108 113–114 0.0542 0.0195
[7] J.-Y. Fan, L. Zhang, J.D. McDonald, Distribution network recon-
109 114–115 0.1273 0.0458
figuration: single loop optimization, IEEE Trans. Power Syst. 2 (3)
110 115–116 0.0815 0.0293
(1996).
111 115–117 0.0696 0.0251
[8] D. Das, H.S. Nagi, D.P. Kothari, Novel method for solving radial
112 117–118 0.0767 0.0276
distribution network, IEE Proc. Gener. Trans. Distrib. 141 (4) (1994)
113 104–119 0.2034 0.0732
291–298.
114 104–120 0.0622 0.0409
[9] S. Ghosh, D. Das, Method for load flow solution of radial distribution
115 120–121 0.01244 0.0082
network, IEE Proc. Gener. Trans. Distrib. 146 (6) (1999) 641–648.
116 121–122 0.0135 0.089
[10] G.W. Stagg, A.H. Ei-Abiad, Computer Methods in Power System
117 122–123 0.04063 0.0146
Analysis, McGraw-Hill, Singapore, 1968.