DISTRIBUTION NETWORK RECONFIGURATION FOR POWER LOSS REDUCTION USING
HARMONY SEARCH
V. Seethiah
Dept. of Electrical and Electronic Engineering
University of Mauritius, Mauritius
ABSTRACT
A power distribution system includes sectionalizing
switches and tie switches. Sectionalizing switches
are normally closed switches while tie switches are
normally open switches. By changing the status of
the switches, an optimal configuration can be
obtained such that the real power loss in the system
is minimum. In this paper, a music based
metaheuristic algorithm was applied to the
Distribution Network Reconfiguration Problem to
minimize real power losses. The Harmony Search
Algorithm is presented in the paper and its
application to the Distribution Network
Reconfiguration problem is described. Simulation
results are presented for 4 test systems: 16-bus, 33-
bus, 70-bus system and a local Mauritian system.
Optimal configurations were obtained in all cases.
1. INTRODUCTION
A distribution system is part of the power system
concerned with the delivery of power from the
transmission system to the consumer. Distribution
system topologies include radial, loop network and
cross-loop network. Radial configuration was the
first topology that was used for the delivery of
power to the consumer. Interests in radial network
topology are due to the following facts:
x It is cheaper compared to other topologies
x Voltage and load flow can be controlled
effortlessly
x Less fault current on nearly all of the network
x Dispersed power system and distributed power
system are gaining importance, thereby making
radial topologies in distribution systems to come
back again.
Distribution Network Reconfiguration (DNR) can be
formulated as the altering of switch configuration of
a distribution network which leads to a change in the
configuration. Thus, the power flowing from the
substation to the consumer is changed. Network
reconfiguration is important if there are unbalanced
loads in the network or real power losses need to be
reduced. In fact, by altering the configuration of the
network, the active power can be reduced and a
better voltage profile can be obtained.
R. T. F. Ah King
Dept. of Electrical and Electronic Engineering
University of Mauritius, Mauritius
Email: r.ahking@uom.ac.mu
The DNR problem may be classified as the
Travelling Salesman Problem. Morton and Mareels
[1] stated that the problem can be recast into a
graph-theoretic framework, where the problem is to
find a spanning tree in a graph with weighted nodes
and branches, such that an objective function of the
weights, obtained by reference to Ohm’s and
Kirchoff’s Laws, is minimized. In fact, the network
reconfiguration in electrical distribution systems
belongs to a complex combinatorial optimization
problem where reconfiguration is realised by
changing the status of sectionalizing switches [2].
Several approaches to solve the problem based on
heuristics and metaheuristics have been made.
Heuristic methods include Switch Exchange Method
by Civanlar et al. [3], Sequential Switch Opening
Method by Shirmohammadi and Hong [4] and a
nonlinear constructive approach by McDermott et al.
[5]. On the other hand, metaheuristic approaches
include Simulated Annealing by Chiang and Jean-
Jumeau [6], hybrid Simulated Annealing-Tabu
Search algorithm by Jeon and Kim [7], Ant Colony
Search Algorithm by Pereira et al. [8] and Chang
[9], Genetic Algorithms (GA) by Ah King et al. [2],
Nara et al. [10] and Zhu [11], Fuzzy Logic
Controlled GA by Ah King et al. [12] and GA based
on matroid theory by Enacheanu et al. [13].
This paper presents a metaheuristic method based on
Harmony Search to solve the Distribution Network
Reconfiguration problem. Simulation results are
presented for 16-bus system, 33-bus system, 70-bus
system and a local system in Mauritius (Bramsthan
Network).
2. DNR PROBLEM FORMULATION
Given an electric distribution network, the objective
function to minimise real power loss can be
formulated as follows
f min ¦ I 2 R (1)
subject to
1. Radial network
The distribution network developed should have
a radial topology.
M (k ) 0 (2)
2. All loads on the distribution network should be
served
All the loads of the network formed should be
supplied with power.
W (k ) 0 (3)
3. Voltage Magnitude Constraint
The voltage at each bus on the network should
normally be around 1 ± 0.05 pu. Thus,
0.95 d Vi d 1.05 (4)
4. Kirchhoff Current Law (KCL)
KCL should be obeyed at each bus.
g (I , k ) 0 (5)
5. Kirchhoff Voltage Law (KVL)
KVL should be obeyed.
g (V , k ) 0 (6) FIG. 1 - IMPLEMENTED HARMONY SEARCH
FLOWCHART

3. HARMONY SEARCH
4. APPLICATION OF HS TO DNR PROBLEM
Harmony Search (HS) is a music-based
metaheuristic algorithm proposed by Geem et al. in A harmony consists of a vector of size n, separated
2001 [14]. into 2 parts as shown in Fig. 2.

Consider a Jazz improvisation. A jazz trio can be

made of
x Bass (double)
x Saxophone FIG. 2 - A HARMONY
x Guitar
For saxophone, consider the following pitches can TABLE 1 - SYMBOLS MEANING
be made: Symbols Meaning
Saxophone={So, La, Ti} num_bus Number of buses in network
Likewise, for double bass, generator_node Number of generator nodes in
double bass={Fa, Si, La} network
For the guitar, nl Number of branches in network
Guitar={La, Fa, So} N_1 Vector of Switches that is closed
A new harmony can be improvised when N_2 Vector of Switches that is open
The saxophonist play ‘So’, n Sum of elements N_1 and N_2
The double bass player plays ‘Si’, and
The guitarist plays ‘Fa’ Initialization of Harmony Memory Matrix
The new harmony obtained is given below Random values are placed in the Harmony Memory.
New harmony={So, Si, Fa} The component value, xi,j is always defined by
If the new harmony is better than the worst harmony 1”xi,j”n. Since initially we do not know if each
in memory, new harmony is added to the memory. harmony solution is radial or not, the (n+1)th column
The worst one is erased. The process is repeated is assigned to infinity. Equation (7) shows the
until a ‘perfect state’ harmony is obtained. Harmony Memory Matrix developed:
ª x1,1 x2,1  xn1,1 xn ,1 f ( x)'1 º
The Harmony Search Algorithm consists of five « » (7)
steps given below: « x1, 2 x2 , 2  xn1, 2 xn , 2 f ( x)'2 »
HM «       »
1. Initialisation of Harmony Search parameters « »
« x1,HMS 1 x2,HMS 1  xn1,HMS 1 xn ,HMS 1 f ( x)' HMS 1 »
2. Initialisation of Harmony Memory Matrix, HM « x1,HMS
¬ x2,HMS  xn1,HMS xn ,HMS f ( x)' HMS »¼
3. Improvisation of new Harmony from Harmony
Memory where f ( x)' j is the sum of the objective function
4. Update of the Harmony Memory Matrix value and the constraints violations for the jth
5. Repeat step 3 and step 4 for a number of harmony solution.
improvisation.
The Harmony Search (HS) Algorithm is Improvisation of a new harmony
implemented as shown in Fig. 1. Pick up components from Harmony Memory - A
number of components equal to (n*Phmcr) were
picked up from the Harmony Memory Matrix, where
Phmcr is the rate of choosing components from the
Harmony Memory. The components taken should
not form a loop. The picked up components are
either placed in N_1 vector, or N_2.
Pick up of random values - A number of
components equal to n*(1- Phmcr) are taken randomly
and placed in N_1 or N_2. The components taken
should ensure that two equality constraints are not
violated.
Pitch Adjustment
Two different approaches for pitch adjustment with
rate Ppar have to be considered since a harmony
consists of closed and open switches.
Pitch adjustment in N_1 vector
Suppose a component in N_1 is to be pitch adjusted.
The following procedures are done:
(i) The component is removed from the N_1
vector. Consequently, two graphs are obtained (Fig.
3 (b))
(ii) The Harmony Search operator then
searches all possible branches that have vertices of
both of the graphs of Fig 3(b).
(iii) The possible branches are placed in a
vector,
possible solution = {a, b, c, d}
(iv) The removed branch, b is located in the
possible solution vector. A coin is tossed. If a head
is obtained, the chosen component would be the one
which is į position to the right of component b in the
possible solution vector. If a tail is obtained, the
chosen component would be -į from the b
component. If we consider the neighboring index,
į=1, and a head is obtained, the chosen component
would be c. Likewise, if a tail was obtained, the
chosen component would be a.
(v) The chosen component is added to N_1
vector. The chosen component, which was initially
open, is removed in the N_2 vector. Branch b is
then added to the N_2 vector.
FIG. 3 - PITCH ADJUSTMENT IN VECTOR N_1
Pitch adjustment in N_2 vector
Consider a component in N_2 need to be pitch
adjusted. The following steps are performed:
(i) The component is removed from the N_2
vector. A loop is then formed, the Harmony Search
operator has to identify the loop.
The graphs are modified such that all branches in the
resulting graph are part of the loop. This operation
involves identifying the last nodes of Fig. 4(b) and
removes them from the graph until the number of
times each node is visited in the resulting graph is 2
(Fig. 4(c)).
(ii) The branches of the loop are placed in a
vector
cycle = {f, g, h, i, j, k}
The removed branch, h, is identified from the cycle
vector. A coin is tossed. If a head is obtained, the
component which is į to the left of branch h is
chosen. Consider į=2 and a tail is obtained, the
chosen component would be f. Likewise, if a head
was obtained, the chosen component would be j.
(iii) The chosen component is added to N_2 and
removed from N_1. Also, component h is added to
N_1. Fig. 4(d) is obtained.
FIG. 4 - PITCH ADJUSTMENT IN N_2
Dissonance considering
The dissonance considering operator handles the
constraints of the harmony. In the DNR problem,
the voltage constraint is handled by this operator.
The voltage at bus i should be 0.95”Vi”1.05.
Harmony Search will accept the infeasible
configurations during the first improvisations. As
the number of improvisations increases, the rate of
acceptance of infeasible configurations decreases
according to Fig. 5.
FIG. 5 - HARMONY SEARCH DISSONANCE
ACCEPTABILITY RATE FOR MaxImp=100.
Update of Harmony Memory Matrix
The objective function of the newly improvised
harmony is calculated together with its constraints.
The objective function value is calculated using the
power flow algorithm in [15]. If the newly
improvised harmony is better than the worst
harmony in the Harmony Memory, it is added to the
Harmony Memory. The worst harmony is then TABLE 2 - 16 BUS SYSTEM RESULTS
deleted from the matrix. Item Open Power Min.Volt
switches loss,MW age,pu
Stopping Criterion Initial 4,11,13 0.5114 0.96927
After a maximum number of improvisations, configuration
MaxImp, the best harmony is obtained on the first Proposed 6,9,11 0.4661 0.97158
row of the Harmony Memory Matrix. method
GA [2] 6,9,11 0.4661 -

5. RESULTS 5.2 33-Bus System

The Harmony Search algorithm was implemented in
MATLAB 7.0 and simulations were performed for
four test systems on a 2.00 GHz PC with Intel Core
2 Duo processor and 1 GB of RAM.
5.1 16-Bus System
An initial power loss of 0.5114 MW is obtained for
the 16-bus system [11]. The optimal configuration
found by the implemented algorithm shows that
switches 6, 9 and 11 should be opened and the
remaining switches closed giving a power loss of
0.4661 MW as shown in Table 2. The new
improved voltage profile is shown in red in Fig 6.
The algorithm found the optimal solution at the 7th
iteration (Fig. 7) and the run time for 100 iterations
was 22.719 seconds.
The initial power loss for the 33-bus system [11] is
0.20269 MW. The optimal configuration found by
the implemented algorithm shows that switches 7, 9,
14, 32 and 37 should be opened and the remaining
switches are closed (Table 3). The power loss of the
reconfigured system is 0.13955 MW. The new
improved voltage profile is shown in red in Fig 8
with a minimum voltage of 0.93782 pu at bus 32.
The algorithm found the optimal solution at the 62nd
iteration (Fig. 9). The run time for 100 iterations
was 28 seconds.

FIG. 8 - VOLTAGE PROFILE OF 33-BUS

SYSTEM

FIG. 6 - VOLTAGE PROFILE OF THE 16-BUS

SYSTEM

FIG. 9 - CONVERGENCE CHARACTERISTICS

FOR 33-BUS SYSTEM

TABLE 3 - 33-BUS SYSTEM RESULTS

Item Open Power Min.Volt
switches loss, MW age (pu)
Initial 33-37 0.20269 0.91308
configuration
Proposed 7, 9, 14, 0.13955 0.93782
method 32, 37
FIG. 7 - CONVERGENCE CHARACTERISTICS GA [2] 7, 9, 14, 0.13953 -
FOR THE 16-BUS SYSTEM 32, 37
5.3 70-Bus System method is 1.1759 MW (Table 5). The improved
voltage profile after reconfiguration is shown in red
The initial power loss for the 70 bus system [16] is in Fig. 12. The algorithm converged to the optimal
0.22675 MW. The optimal configuration found by solution at the 29th iteration (Fig. 13) and the run
the Harmony Search algorithm is given in Table 4 time for 100 iterations was 18.57 seconds.
and it is found that the power loss of the system can
be reduced to 0.20353 MW. The improved voltage
profile after configuration is shown in red in Fig 10.
The algorithm found the optimal solution at the 73rd
iteration (Fig. 11). The run time for 200 iterations
was 2046.2 seconds.

FIG. 12 - VOLTAGE PROFILE OF BRAMSTHAN

DISTRIBUTION NETWORK

FIG. 10 - VOLTAGE PROFILE OF 70-BUS

SYSTEM

FIG. 13 - CONVERGENCE CHARACTERISTICS

BRAMSTHAN DISTRIBUTION NETWORK
TABLE 5 - BRAMSTHAN DISTRIBUTION
NETWORK RESULTS
FIG. 11 - CONVERGENCE CHARACTERISTICS Item Open Power Min.Volt
FOR 70-BUS SYSTEM switches loss,MW age (pu)
TABLE 4 – 70-BUS SYSTEM RESULTS Initial 33-36 1.2333 0.85517
configuration
Item Open Power Min.Volt
switches loss,MW age (pu) Proposed 21, 33, 1.1759 0.87681
method 34, 36
Initial 69-79 0.22675 0.90592
configuration GA [2] 21, 33, 1.1759 -
34, 36
Proposed 13, 28, 0.20353 0.92728
method 45, 51,
67, 70,
73, 75, 6. CONCLUSIONS
76, 78,
79 Harmony Search was successfully applied to solve
Heuristic- 13, 14, 0.204011 0.9268 the DNR problem for four test systems. The
Expert [16] 27, 28, Harmony Search operator ensures that a radial
45, 46, topology is obtained. The voltage constraint was
50, 51, considered in the HS operator named dissonance
66, 67, considering. This operator accepts unfeasible
68 configurations at the start of improvisation. As the
number of iterations increases, the probability of
5.4 Bramsthan 33-Bus Distribution Network acceptance decreases. It was found that Harmony
Search uses an elitism concept since only best
The proposed method was tested on a local system, configurations are stored in the Harmony Memory.
located in Bramsthan [2]. The initial power loss for
the system is 1.2333 MW. The power loss for the It was found that during some improvisations,
optimum configuration found by the proposed Harmony Search was trapped in local optima, just as
Simulated Annealing. A hybrid Harmony Search
Algorithm with Genetic Algorithm or Fuzzy Logic
can be implemented to counteract the problem.
Furthermore, capacitor placement can also be
combined in the problem in order to reduce losses in
the network and improve voltage profile.
Simultaneously consideration of both feeder
reconfiguration and capacitor placement has been
shown by Chang [9] to be more effective than
considering only one technique.
7. REFERENCES
[1] MORTON, A.B., AND MAREELS, I.M.Y.,
‘An Efficient Brute-Force Solution to the
Network Reconfiguration problem’, IEEE
Transactions on Power Delivery, Vol. 15, No. 3,
July 2000, pp. 996-1000.
[2] AH KING R.T.F., RADHA, B., AND
RUGHOOPUTH, H.C.S., ‘A Real-Parameter
Genetic Algorithm for Optimal Network
Reconfiguration’, IEEE International
Conference on Industrial Technology (ICIT'03),
Maribor, Slovenia, 10-12 December 2003, pp.
54-59.
[3] CIVANLAR, S., GRAINGER, J.J., YIN, H.,
AND LEE, S.S.H., ‘Distribution Feeder
Reconfiguration for Loss Reduction’, IEEE
Transactions on Power Delivery, Vol. 3, No. 3,
July 1988, pp. 1217-1223.
[4] SHIRMOHAMMADI, D., AND HONG, H.W.,
‘Reconfiguration of Electric Distribution for
Resistive Line Loss Reduction’, IEEE
Transactions on Power Delivery, Vol. 4, No. 2,
April 1989, pp. 1492-1498.
[5] MCDERMOTT, T.E., DREZGA, I., AND
BROADWATER, R.P., ‘A Heuristic Nonlinear
Constructive Method for Distribution System
Reconfiguration’, IEEE Transactions on Power
Systems, Vol.14, No. 2, May 1989, pp. 478-
483.
[6] CHIANG, H.D., AND JEAN-JUMEAU, R.,
‘Optimal Network Reconfiguration in
Distribution Systems: Part 1: A new formulation
and a Solution Methodology’, IEEE
Transactions on Power Delivery, Vol. 5, No. 4,
November 1990, pp. 1902-1909.
[7] JEON, Y.-J., AND KIM, J.-C., ‘Network
Reconfiguration in Radial Distribution System
using Simulated Annealing and Tabu Search’,
IEEE Power Engineering Society Winter
Meeting, 23-27 January 2000, Vol. 4, pp. 2329-
2333.
[8] PEREIRA, F.S, VITTORI, K., AND DA
COSTA, G.R.M., ‘Distribution System
Reconfiguration for Loss Reduction based on
Ant Colony Behavior’, IEEE/PES Transmission
and Distribution Conference and Exposition:
Latin America, Venezuela, 15-18 August 2006,
pp. 1-5.
[9] CHANG, C.-F., ‘Reconfiguration and Capacitor
Placement for Loss Reduction of Distribution
Systems by Ant Colony Search Algorithm’,
IEEE Transactions on Power Systems, Vol. 23,
No. 4, November 2008, pp. 1747-1755.
[10] NARA, K., SHIOSE, A., KITAGAWA, M.,
AND ISHIHARA, T., ‘Implementation of
Genetic Algorithm For Distribution Systems
Loss Minimum Re-configuration’, IEEE
Transactions on Power Systems, Vo. 7, No. 3,
August 1992, pp. 1044-1051.
[11] ZHU, J.Z., ‘Optimal Reconfiguration of
Electrical Distribution Network using the
Refined Genetic Algorithm’, Electric Power
Systems Research, Vol. 62, No. 1, 2002, pp. 37-
42.
[12] AH KING, R.T.F., RADHA, B., AND
RUGHOOPUTH, H.C.S., ‘A Fuzzy Logic
Controlled Genetic Algorithm for Optimal
Electrical Distribution Network
Reconfiguration’, IEEE International
Conference on Networking, Sensing, and
Control (ICNSC2004), Taipei, Taiwan, 23-25
March 2004, pp. 577-582.
[13] ENACHEANU, B., RAISON, B., CAIRE, R.,
DEVAUX, O., BIENIA, W., AND HADJSAID,
N., ‘Radial Network Reconfiguration Using
Genetic Algorithm Based on the Matroid
Theory’, IEEE Transactions on Power Systems,
Vol. 23, No. 1, February 2008, pp. 186-195.
[14] GEEM, Z.W., KIM, J.H., AND
LOGANATHAN, G.V., ‘A New Heuristic
Optimization Algorithm: Harmony Search’,
Simulation, Vol. 76, No. 2, 2001, pp. 60-68.
[15] TENG, J.-H., ‘A Network Topology based
Three Phase Load Flow for Distribution
Systems’, Proc. Natl. Sci. Counc. ROC(A), Vol.
24, No. 4, 2000, pp. 259-264.
[16] REDDY, V.V.K., AND SYDULU, M., ‘A
Heuristic-Expert based Approach for
Reconfiguration of Distribution Systems’, IEEE
Power Engineering Society General Meeting,
24-28 June 2007, pp. 1-4.