Electric Power Systems Research 71 (2004) 145–152

Optimal service restoration and reconfiguration of network

using Genetic-Tabu algorithm
Dong-Joon Shin a , Jin-O Kim a , Tae-Kyun Kim b , Jin-Boo Choo b , C. Singh c,∗
aDepartment of Electrical Engineering, Hanyang University, Seoul, 133-791, Korea
b Korea Electric Power Research Institute, Daejun, Korea
c Department of Electrical Engineering, Texas A&M University, College Station, TX 77843, USA

Received 12 November 2003; accepted 28 January 2004

Abstract

This paper represents an approach for service restoration and optimal reconfiguration of distribution network using Genetic algorithm (GA)
and Tabu search (TS) method. Restoration and reconfiguration problems in distribution network are difficult to solve within feasible times,
because the distribution network is so complicated with the combination of many tie-line switches and sectionalizing switches and also has to
satisfy radial operation conditions and reliability indices. Therefore, this paper applied Genetic-Tabu algorithm (GTA) to find optimum value
with reasonable computation time. The Genetic-Tabu algorithm is a Tabu search combined with Genetic algorithm to find a global solution.
The case studies with 7-feeder model showed that not only the loss reduction but also the reliability should be considered at the same time to
achieve the optimal service restoration and reconfiguration in the distribution network.
© 2004 Published by Elsevier B.V.

Keywords: Loss and interruption cost reduction; Service restoration; Optimal reconfiguration; Genetic-Tabu algorithm

1. Introduction past few decades, distribution systems have received consid-

The existing distribution networks are growing with
complexity more and more, due to the gradual increase of
power demand and variation of loads. Efficient operation of
distribution networks can be achieved by reconfiguring the
network to reduce line losses and improve system reliability
[1,3].
Service restoration after a fault, usually referred to as
emergency service restoration, has become more important
especially as the distribution networks become automated
to improve the service quality. Use of remotely controlled
sectionalizing switches in such environments makes it possi-
ble to perform emergency service restoration from a control
center in much shorter time [2].
This paper describes a Genetic-Tabu algorithm (GTA) ap-
proach to the service restoration and optimal reconfiguration
of distribution network considering reliability cost. Over the
∗ Corresponding author.
E-mail address: singh@ee.tamu.edu (C. Singh).
erably less of the attention devoted to reliability modeling
and evaluation than generating systems. On the other hand,
analysis of the customer failure statistics of most utilities
indicates that the distribution system makes the greatest in-
dividual contribution to the unavailability of supply to a cus-
tomer. These customer failure statistics reinforce the need to
be concerned with the reliability evaluation of distribution
network.
The optimal operation of distribution network should pro-
vide electricity to customers with quality [4]. This paper
shows that service restoration and optimal reconfiguration of
distribution network should minimize loss relating to con-
ductor resistance of lines, as well as interruption cost (IC)
arising from outage costs of customers.
Service restoration and reconfiguration problems are too
complicated and time consumed to be solved. These prob-
lems are basically large-scaled combinatorial optimization
problems [5], because the urban distribution system is usu-
ally large in scale and contain numerous sectionalizing
switches to be operated. It is, therefore, difficult to rapidly
obtain an exact optimal solution on real system.

0378-7796/$ – see front matter © 2004 Published by Elsevier B.V.

doi:10.1016/j.epsr.2004.01.016
146 D.-J. Shin et al. / Electric Power Systems Research 71 (2004) 145–152

This paper, to solve these problems, suggests GTA to

minimize the cost function while keeping constraints such
as line power capacity, voltage drop at the load point and so
forth.
GTA proposed in this paper is Tabu search (TS) combined
with Genetic algorithm (GA) to reinforce convergence char-
acteristic in a global solution space. GTA is applied to the
sample model network in the case study to examine its ef-
fectiveness.
In the case studies, total cost minimization algorithm and
loss cost (LC) minimization algorithm were applied to dis-
tribution network model with 7-feeder, 38-load point, and
three customer types. The results show that not only the loss
cost but also the interruption cost should be considered at the
same time in operation of distribution network to achieve the
service restoration and optimal reconfiguration with mini-
mum cost. This paper also represents the advantages of GTA
against using GA only.
2. Loss cost
The optimal operating condition of distribution network
is usually considered to be obtained when line losses are
minimized, while keeping the limits of branch loading and
voltage limits. Therefore, in the case of radial structured dis-
tribution network, operators have to select switching opera-
tions in order to minimize line losses and maintain balanced
loads by opening and closing of each switch.
New line losses in the reconfigured distribution network
can be calculated by (1):
n

P 2 + Q2i
PL = ri i
|Vi |
i=1
where ri is resistance of line i.
Annual loss cost can be calculated by using (1) and is
expressed by (2):
LC = ke PL
where ke is the annual unit power production cost ($/kW per
year).
Fig. 1. Three-state Model.
liability indices such as failure rate and interruption duration
should be calculated in advance.
The interruption cost model of customer sector is required
in order to evaluate customer interruption cost indices, and
the model in reference [6] is cited in this paper. Fig. 2
shows the interruption costs for five discrete outage dura-
tions, which is called the customer damage function (CDF).
Since the cost of interruption has been obtained only for
interruption durations of five discrete durations, the cost of
interruption for any other durations can be determined by
interpolation [4,6].
Now interruption cost can be evaluated by using (3) and
(4):
IC = Li ci (di ) (3)
n


IC = Li λi ci (di ) (4)
i=1
where: n is the number of load points; Li , load requirement
(kW); λI , failure rate (f per year); Ci (di ), customer damage
function ($/kW); di , outage duration (h).
(1)
The Eq. (3) shows the interruption cost in service restora-
tion, while (4) is interruption cost in reconfiguration of dis-
tribution network.
In the operation of distribution network, loss cost and in-
terruption cost are resulted respectively from resistive com-
ponents and faults in distribution network.
(2) The total cost is the sum of loss cost and interruption
cost shown (2), (3), and (4), and these costs should be taken

3. Failure modeling and interruption cost

In order to evaluate the reliability of power system, it

is desirable to establish a suitable modeling of system and
construct the appropriate state space diagram. Particularly, it
is important that switching actions be modeled and simulated
in the reliability evaluation process. In this paper, three-state
model in Fig. 1 is applied in reliability assessment.
Customers experience loss cost created by failure rate (λ)
and outage duration (d) of the load point, which is called
interruption cost. To evaluate interruption cost, the basic re- Fig. 2. Sector interruption cost.
 D.-J. Shin et al. / Electric Power Systems Research 71 (2004) 145–152 147

into account for minimizing the total cost. Total cost can be
evaluated by using (5).
Min TC = LC + IC (5)

While operating distribution network, current capacity and

voltage-drop should be kept in the allowed range. Particu-
larly, in the view of service restoration after a fault, there are
some rules to be considered for each feeder. In this paper,
the followings were applied: Fig. 3. Mutation using Tabu test.

[i] No feeders are overloaded.

[ii] The power flow of the distribution network is changed enlarge the search area in a solution space. In the suggested
by service restoration. In this case, the currents in all GTA, this diversity strategy is carried out by increasing the
the lines should not be exceeded. mutation probability of the selected genes.
[iii] Since the feeders in practice are usually operated in In this paper, GTA is successfully applied to both of the
radial, radial system structure should be retained, loss minimum service restoration and reconfiguration prob-
[iv] The required number of switching operations in the lem. In the proposed algorithm, strings of GA consist of sec-
restoration plan should be minimized. tionalizing switch status of radial configurations, and the fit-
[v] The configuration of restored system should be as ness function consists of the total operation cost and penalty
close to the original configuration as possible. In other values of voltage drop, current capacity violations, and so
words, only those switches, which are close to the forth.
out-of-service area, may be operated. Fig. 4 shows the flowchart of the entire GTA, and as can
be seen in this figure, the first half of the algorithm, from the
initial string coding to the crossover, is an ordinary genetic
4. Genetic-Tabu algorithm search procedure. After the crossover, Tabu test is conducted
to enforce the search ability.
Since GA utilizes the coded discrete information of the
artificial strings, it can be applied to ill-structured discrete
optimization problems as well as continuous optimization
one. Moreover, it searches population of several points in
parallel, not a single point, and the possibility of finding a
near optimum in an early generation is very high. Therefore,
GA can search global optimum with stable convergence [7].
TS is a meta-heuristic procedure in which the process
of finding the optimal solutions consists in a subordinate
heuristic that should be designed for each particular problem.
The memorization of the visited solution is a characteristic
aspect of TS methods, whose main novelty is the use of
flexible memory system for taking advantage of the history
of search. Therefore, TS has a local searching ability rather
than global searching in a short time.
This paper suggests GTA, which is a combination of GA
and TS. In the proposed algorithm, TS makes up for a weak-
ness of GA which is poor at local searching ability, while
global search is prominent.
The main strategy of GTA intends to strengthen intensifi-
cation in TS. In other words, solution attributes in tabu list
(memory space) are used to adjustment of mutation proba-
bility in GA. Therefore, this algorithm is expected to be a
faster convergence in a global space than using GA only.
The concept of mutation in GA using Tabu test is shown in
Fig. 3. During the optimization process, chromosomes rep-
resent the configuration of network and recorded in tabu list.
If, for example, the second and the sixth gene of chromo-
somes in the tabu list consist of almost same value than oth-
ers, it is reasonable to increase the diversity of these genes to Fig. 4. Flowchart for Genetic-Tabu algorithm.
148 D.-J. Shin et al. / Electric Power Systems Research 71 (2004) 145–152

Among the generation, the best solution is selected and Table 2

compared with the attributes of solution in tabu list. In this Reliability data of system components
case, if a new attribute of this solution is existed in tabu list, Transformer Breaker Busbar Line
mutation is operated in order to obtain another new solution. Passive failure rate (f per year) 0.015 0.006 0.001 0.065
Otherwise, this solution is recorded in tabu list, and replaces Active failure rate (f per year) 0.015 0.004 0.001 0.065
the current solution. Repair time (h) 10 4 2 5
Switching time (h) 1 1 1 1

5. Case studies
To evaluate reliability of distribution network and inter-
Two types of algorithms were applied to analyze the ser- ruption cost, three-state model as shown in Fig. 1 was used.
vice restoration and reconfiguration with 7-feeder test sys- Table 2 is the reliability data of system components to cal-
tem [8] in this paper; one is total cost with the sum of loss culate failure rate and repair time. In the test system, the
and interruption cost and the other is loss cost only. number of transformers, breakers, busbars and lines are 29,
The initial configuration of the test system is shown in 27, 7, and 7, respectively.
Fig. 8. In this figure, the numbers with “S” indicate the line
switches, and “LP” denotes load points. Table 1 shows the 5.1. Service restoration of distribution network
load data for the test system. The line impedance is 0.391
/km which is assumed to be same through the entire net- When a fault occurs in a distribution system (see Fig. 5),
work. The allowed current capacity is 160 A, limited capac- it is essential for system dispatchers to locate the fault, iso-
ity of feeder 9.2 MW, and annual unit power production cost late the faulted zone, and restore the electricity service to
168 $/kW per year [9]. the out-of-service area where is outside of the faulted zone.
The main purpose of a service restoration is restoration of
Table 1 loads during a fault by using the sectionalizing switches.
Load point data of distribution network Restoration should be taken in action in a short time as soon
Number of load points Customer type Load demand (MW) as possible. In addition, the out-of-service area should be
minimized to enhance the system reliability.
4, 9–13, 18–21, 32 Residential 0.8869
5, 14, 15, 22, 23, 37 Residential 0.8137 GTA was applied to both of minimum loss cost algorithm
26–30 Small user 1.63 and minimum total cost algorithm. Figs. 6 and 7 show the
31, 33–36 Small user 2.445 results of service restoration considering loss cost and total
1–3, 6–8 Commercial 0.844 cost, respectively. The fault was assumed to be occurred at
16, 17, 24, 25, 38 Commercial 0.6714
feeder 1 and cleared after 4 h.

Fig. 5. Distribution network model.

 D.-J. Shin et al. / Electric Power Systems Research 71 (2004) 145–152 149

Fig. 6. Service restoration of distribution network considering loss cost only.

Fig. 7. Service restoration of distribution network considering total cost.

The comparison of the results of each algorithm is tab-

ulated in Table 3. It also indicates that both algorithms re- Table 3
configure distribution network within the feasible range of Result of service restoration
examined constraints. Minimum loss Minimum total
From the results, load point 1 (commercial) was discon- cost algorithm cost algorithm
nected in minimum loss cost algorithm, while load point 5 Loss cost ($ per year) 34.645 35.007
(residential) disconnected in minimum total cost algorithm. Total cost ($ per year) 6461.99 4339.71
This different configuration may arise from the fact that the Maximum current (<160 A) 156.14 156.01
interruption cost of commercial load is higher than that of Maximum load of feeder (<9.2 MW) 8.6 8.9
Number of switching operation 2 2
residential.
150 D.-J. Shin et al. / Electric Power Systems Research 71 (2004) 145–152

Fig. 8. Convergence characteristic curves of service restoration considering Fig. 9. Convergence characteristic curves of service restoration considering
loss cost. total cost.

As can be seen in Table 3, when the loss cost is consid- Table 4

ered only, the minimum loss cost algorithm($34.645) shows Result of reconfiguration
the better result than the total cost minimization algorithm Minimum loss Minimum total
($35.007). However, in the view of total cost which consid- cost algorithm cost algorithm
ering both loss and interruption cost, the minimum total cost Opened switch 22, 24, 25, 26, 27 10, 22, 25, 26, 27
algorithm($4339.71) shows the better result than the mini- Loss cost ($ per year) 385,182 398,906
Total cost ($ per year) 825,372 821,947
mum loss cost algorithm($6461.99).
Figs. 8 and 9 show the convergence characteristics of
service restoration using GTA and GA only. From these
figures, it can be observed that convergence characteristic of configurations of distribution network considering loss cost
GA only is worse than that of GTA, and it seems from the and total cost, respectively, and the comparison of the re-
result of combination of global search ability of GA and a sulted values of each reconfiguration of distribution network
fast convergence capability of TS. is shown in Table 4.
As can be seen in Table 4, and Fig. 11, in the view of
5.2. Optimal reconfiguration of distribution network minimum total cost algorithm, distribution network is re-
configured with switches 10, 22, 25, 26, and 27 opened. Re-
The optimal reconfigurations for minimum loss cost only configuration of distribution network considering total cost
and total cost including interruption cost are also tested us- ($821,947) reveals the better result than that considering loss
ing GTA. Figs. 10 and 11 show the results of optimal re- cost ($825,372) only.

Fig. 10. Reconfiguration of distribution network considering loss cost.

 D.-J. Shin et al. / Electric Power Systems Research 71 (2004) 145–152
Fig. 11. Reconfiguration of distribution network considering total cost.
Fig. 12. Convergence characteristic curves of reconfiguration considering
loss cost.
Fig. 13. Convergence characteristic curves of reconfiguration considering
total cost.
Figs. 12 and 13 also show the convergence characteristics
of reconfiguration using GTA and GA only where the opti-
mal solution using GTA could be found in shorter time than
using GA only.
6. Conclusions
This paper deals with the service restoration and optimal
reconfiguration in distribution network. The operation with
151
loss minimization only can reduce the loss cost but might
increase the interruption cost. Therefore, the minimum loss
cost algorithm does not always show the optimal operation
with minimum operating cost. This paper shows that service
restoration and optimal reconfiguration of distribution net-
work should minimize interruption cost arising from outage
costs of customers as well as loss cost relating to conductor
resistance of lines.
This paper also shows the superiority of the combination
of two algorithms; GA and TS algorithm. GTA shows the
stable convergence with global searching ability in the case
study.
Acknowledgement
This work was supported in part by the KEPRI under
Grant 119 J03P J03.
References
[1] S. Civanlar, J.J. Grainger, H. Yin, S.S.H. Lee, Distribution feeder
reconfiguration for loss reduction, IEEE Trans. PWRD 3 (3) (1988)
1217–1223.
[2] C.C. Liu, S.J. Lee, K. Vu, Loss minimization of distribution feeders:
optimality and algorithms, IEEE Trans. PWRD 4 (2) (1989) 1281–
1289.
[3] D. Shirmohammadi, H.W. Hong, Reconfiguration of electric distribu-
tion networks for resistive line losses reduction, IEEE Trans. PWRD
4 (2) (1989) 1492–1498.
[4] Sankarakrishanan, R. Billinton, Effective Techniques for Reliabil-
ity Worth Assessment in Composite Power System Networks Using
Monte Carlo Simulation. IEEE Trans. PWRS 11 (3) 1996 1255–1261.
[5] Minen, J. Partanen, E. Lakervi, A Practical Approach For Estimating
Future Outage Costs In Power Distribution networks. IEEE Trans.
PWRD 5 (1) (1990) 311–316.
152 D.-J. Shin et al. / Electric Power Systems Research 71 (2004) 145–152
[6] R. Billinton, P. Wang, Distribution system reliability cost/worth analy-
sis using analytical and sequential simulation techniques, IEEE Trans.
PWRS 13 (4) (1998) 1245–1250.
[7] Zbigniew Michalewicz, Genetic Algorithms + Data Structures
= Evolution Programs, Springer-Verlag, 1992.
[8] R. Billinton, R.N. Allan, A reliability test system for educational
purposes—basic distribution system data and results, IEEE Trans.
PWRS 6 (2) (1991) 813–820.
[9] V. Glamocanin, Optimal loss reduction of distribution networks, IEEE
Trans. PWRS 5 (3) (1990) 774–782.
Tae-Kyun Kim received the BS, MS, and PhD degrees in electrical en-
gineering from the Hanyang University, Korea in 1986, 1989, and 1993,
respectively. He is a senior member of technical staff in Power Sys-
tem Analysis Center of Korea Electric Power Research Institute (KEPRI)
which is a research center of Korea Electric Power Corporation (KEPCO).
He has been actively involved in several research projects in the area of
power system analysis as a project leader. His interests are in power sys-
tem operation, planning and analysis. He has been especially working for
the development of Digital Power System Simulator and Power System
Stabilizer.
Jin-Boo Choo received the B.S., M.S., and Ph.D. degrees in electrical
engineering from Seoul National University, Korea in 1977, 1987, and
1994, respectively. Currently he is a leader of power system analysis cen-
ter and vice president of Korea Electric Power Research Institute (KEPRI)
which is a research center of Korea Electric Power Corporation (KEPCO),
Korea. He also is a team leader of National Research Laboratory ap-
proved by the Ministry of Science & Technology, Korea. His research
interests include power system analysis, operation, planning, control and
economic dispatching, FACTS and real time power system simulation
technologies.
Jin-O Kim received the B.S. and M.S. degrees in electrical engineering
from Seoul National University, Korea, in 1980 and 1983, respectively,
and Ph.D. from Texas A&M University, USA, in 1991. He is presently
associate professor in Department of Electrical Engineering at Hanyang
University. His research interests include power system reliability, plan-
ning, pricing, and strategies in competitive electricity market.
C. Singh is regents professor and department head of Electrical Engineer-
ing Department, Texas A&M University. He also hold the J.W. Runyon,
jr. ’35 Professorship II. He received the 1986–1987 Haliburton Profes-
sorship, and the 1992–1993 Dresser Professorship. He also served as Di-
rector, NSF Power System Program, for the year 1995–1996. Dr. Singh
is a senior TEES Fellow at Texas A&M University, Fellow of IEEE,
and recipient of the IEEE 1998 Distinguished Power Engineering Ed-
ucator Award. In 1997, he was awarded a D.Sc. by the University of
Saskatchewan for his research contribution.