6.9.

HEURISTIC METHODS FOR THE OPTIMISATION OF MV DISTRIBUTION NETWORKS OPERATION

AND PLANNING
M. P. Papadopoulos

G. J. Peponis

N. G. Boulaxis*

N. X Drossos**

* National Technical University of Athens ** Public Power Corporation

INTRODOCTION
Most electric distribution medium voltage (MV)
networks are normally operated radially. However,
more or less there are always interconnecting facilities
between adjacent feeders, of the same or neiboring
HVMV substation. The facilities of modern
Distribution Control Centres, enable the maximum
exploitation of the existing M V networks by proper
selection of their configuration.
An effective reconfiguration strategy takes advantage
of the behaviour of the loads and has two main targets:
(i) to reduce the system energy losses; (ii) to relieve
the overloads in the network by load balancing.
Other optimisation criteria can also be applied.
Moreover the problem of optimal expansion planning
can be considered as the selection of network
configurationsfor successive years, that minimises the
total cost (investments, losses, etc.) during the study
periN whle satisfying the operational constrains.
Because of the complexity of the MV distribution
networks heuristic methods are the most suitable to
face the problem.

Greece

branch i and D is the set of the branches of the

network.
The SEM is based on the continuous reduction of the
network resistive losses following sequential closing of
an opened switch and opening of a closed one on the
loop formed.
The SSOM is based on the fact that the optimal power
flow (minimum losses and voltage drops) is obtained
when all the tie switches are closed The system is led
to a radial configuration starting the sequential
opening from the switches carrying the lowest current.
A comparative presentation of both methods, with
some considerable improvements, has been made in
[4,5]. In 161 they have been used for the development
of a general algorithm for optimal operation of
distribution networks.
Load Model

THE OPTIMAL RECONFIGURATION

PROBLEM

It is assumed that the total load at each node consists

of five types (e.g. residential, industrial, etc.) For each
type,lload variation with time is introduced in to the
network data base using typical load curves for the
entire analysis time period. Each daily load profile is
characterised by a frequency o occurrence during the
overall analysis period. Given the total power installed
and the load composition at each node, active and
reactive load curves can be obtained. Details are given
in [ 5 ] .

The Applied Methods

Network Size Reduction

Because of the complexity of the MV distribution

networks most of the developed algorithms for
network reconfiguration, use heuristic search
techniques, based on analytical or knowledge-based
engines. The more popular of the reconfiguration
methods are the Switch Exchange Method (SEM),
[I], and the Sequential Switch Opening Method
(SSOM), [2,3]. The minimisation of the total resistive
losses of the network for a given time period (e.g. one
year) is usually the optimisation criteria, that is the
minimisation of :

All radial laterals that cannot take part in any loop

formed by closing an initially open tie switch, can be
replaced by an equivalent load, without affecting the
optirrium reconfiguration process of the network. In
addition, part of lines of the same type, including
many nodes with loads. but not tie switches, can be
replaced by an equivalent branch and loads at its two
ends. Complete details of the applied overall method
of size reduction algorithm, has been presented in [51.

In t h s paper an heuristic method for optimum

expention planning and the developed software is
presented and applied in a typical 20kV distribution
network.

i ED

where Ri and Ii are the resistance and current of the

Network Reconfiguration For Load Balancing

The optimisation criteria of the configuration
presented in 2.1, is the total resistive loss
minimisation, without violating the predetermined

CIRED 97,2-5 June 1997, Conference Publication No. 438,O IEE, 1997

6.9.2
thermal and voltage drop limits. Another optimisation
criteria of practical interest in the maximisation of the
loading capability of the network. This can be obtained
by the minimisation of the Load Balancing Index
(LBI), PI:
LBI=
+J2 1
7I =
W,1T1(*
(2)
I EB

RI

lB

where: B: set of network branches forming loops

L , I Ri : length, load current and current
rating of the branch i

W,=LJ I

& : a weighting factor for the branch i,

Because of the similarity of (1) and (2), it is clear that

the same optimum reconfiguration algorithms can be
applied.

THE OPTIMAL EXPANSION PLANNING

The Applied Method
Since 1980, the expansion planning problem has been
formulated as a large scale non-linear Mixed Integer
Programming problem, [7,8]. Heuristic methods have
been presented recently, [9,10].
In the method proposed in this paper the problem is
solved in two steps:
-In the first step, the static sub-problem is faced:
Based on the method presented briefly in paragraph 2
(in detail in [5,6]), a set of technically accepted
solutions, presenting an economical interest, is
considered for Merent one or multi-year sub-periods
of the total study period. These sub-sets of selected

Figure 1: Classification of the selected configurations of set A, to the subsets B e of technically accepted
operation: the members of Be satisfy the operational constraints until year m.
configurations are denoted as
if they have been
constructed for the sequential years (n) to (m). The
selected configurations are classified in sub-sets B,
that can feed all of the loads until the year (m),
without operational limits violation. The above actions
are illustrated schematicallyin Fig 1.
-In the second step, the dynamic sub-problem is
solved: Based on the sets of the selected solutions
because of their economic interest the optimal
sequence of network configurations for the total study
period is determined, using Dynamic Programming
techniques.
The load data (load patterns describing their variation
per load type, the growth rates of existing and new
loads etc.) as well as all the possible reinforcements or
extension alternatives are given beforehand. Usually
these alternatives are the following:
0
reinforcement of existing lines and substations
0
installation of shunt capacitors or/and voltage
regulators

0
0

construction of new lines

construction of new substations and connection
lines

The Static Subproblem Solution

The solution of the static subproblem is based on the
modelling of all network reinforcement and extension
candidates as branch exchange alternatives leading to
the maximum cost reduction.
Precisely, all the reinforcement alternatives are
modelled by the installation of a new branch and the
removal (or set out of operation) of existing one on the
loop formed. Two new branches, correspondmg to the
transformer and the connecting lines, can be modelled
in case of substation reinforcement. For the connection
of new loads, fast heuristic algorithms can be applied
in order to determine the optimum point where the
added new branch will be connected.

6.9.3
After this modelisation the solution of the static
subproblem can be based on a modification of the
SEM method, presented in paragraph 2.1. This
method will be denoted as Branch Exchange MethodBEM.
The objective function of BEM includes the capital
cost, the operation and maintenance costs, as well as
the energy losses cost. Precisely the algorithm is as
follows:
1. Start: definition of the existing configuration (in
year 0), the load growth rates and the new forecasted
loads, and the reinforcement and extension
alternatives. Definition of the sets of sequential years
(n to m) that the economical configurations subsets
(&-,) will be constructed for. Continue with the first
set of sequential years, and the first substations
combination.
2. Determination of an initial configuration that feeds
all the loads of year (m), without operational limits
violations:
a) Determination of a radial configuration that feeds
all the loads of the year.
b) Reinforcement of the network if voltage or current
flow limits are violated. If a configuration that satisfies
all operational constraints can not be found, go to step
4 (next substation policy).
3.Application of BEM for the determination of the M
more economical (and technically accepted)
configurations (for the given substation policy, for the
sequential years n-m).
4.If there is another substations combination, go to
step 2.
5.If there is another set of sequential years n-m, go to
step 2.
6.At this point the set of selected configurations A has
been constructed, as the union of the subsets &-m
Classif) the selected confgurations to the subsets B,
(Fig.1).
The 'Dynamic Subproblem' Solution

The dynamic subproblem can be modelled as a

dynamic programming problem, since the aim is the
determination of the optimal policy, consisting of
optimal decisions in sequential stages. Precisely, using
dynamic programming terminology, [ll], we can
define the following:
0
Stage: Each year k of the study period: k= 1,...N
0
State: The state in each stage (year) k is the
configuration of the network at the beginning of
this year
0
Decision: The choice of a configuration of the
network. Decision &, is the state of the next stage
(year) k+ 1

Polilcy: A set of decisions for all the stages and

"Optimal policy" the policy that minimises the
totali cost
The objective function is the cumulative cost in each
stage, that is:
0

=
k= 1

{CA(% ) + OM(&,) + L(6k) + R(6k-i

Tak

>>

where:
CA(&): the capital cost related with the decision S,
OM(&): the operational maintenance cost
L(&): the cost of the resistive losses
R(t5,,1, &): the cost of the material removed
It can be easily proved that, in the above procedure,
given the current state, an optimal policy for the
remaining stages is independent of the policy adopted
in previous stages (Marcovian property), so that a
dynamic programming solution can be obtained.
The olptimal policy is obtained using standard
procedure of dynamic programming, [11], by the
backward and forward examination of the stages.
APPLKATION

The previously proposed method is applied for the

optimum expansion of the typical 20 kV distribution
system of Fig.2. The length of the main lines is : I-a6
7
3 6 h , I-b8 43 km, 1 1 ~ 44km.
The optimum development of the system for the next
10 yeius is considered, taking into account the
following:
1. The existing loads of each MVLV substation are
defined using their type (residential, industrial,
etc.) and their 24-hour load pattern (two patterns
for each year). Separate rate of increase for the
existing loads are defined, for each type and year of
the study period (mean increase rate 8,5 YO).The
expected new loads are also defined by their size,
type, rate of increase and starting year, as it is
indkcated in Fig.2 in parenthesis.
2. Tbe expansion candidates are illustrated in Fig.2
by dotted lines. Their selection was made by
preliminary analysis, according to paragraph 2,
taking into account the existing and the new loads.
Especially the sizes and sites of installation of
capacitors and the voltage regulators was selected
by static optimisation methods.
3. The standard constructions of the PPC (public
Pvwer Corporation-Greece) was considered (e.g.
conductor cross-sections, size of capacitors etc.), as
well as the loading and voltage drop limit (10Yo).
The discount rate was taken 8%.

6.9.4

......

Figure 2: Existing configuration and expansion candidates of the applications system

Some details and results at the analysis of the problem
are presented in the following:
1) The 12 most economical network configurations for
each one of the three new substations policies (I11 or
IV or I11 and IV) was considered during the solution of
the static subproblem. Subsets &-, of economical
configurations for one year (Al.] or A2.2etc.) was

considered
2) Under the above conditions, the static subproblem

solution results to the determination of 571

economical configurations, classified to the subset B,
as follows:
Blo ~ 8 0B, g =94, Bg =118, B7 ~ 1 1 8B,j
, =190, B5 ~ 3 0 0 ,
B4 ~ 3 4 4B3
, ~ 3 8 2B2
, ~476,B1 4 7 1 ,

H V l M V Substation

HVlMV Substation

6 0 0 C k V A (1)
9 0 0 C k V A (4)
6 0 0 C k V A (6)

Figure 3: Optimal system expansion for the study period. The new constructions are illustrated in bold
cbaraeters, and the year of construction is indicated in parenthesis.

6.9.5

3) A sensitivity analysis has shown that for up to 9

Gonfigurations the same results are obtained as well as
that the consideration of subset for more than one year
has not considerable influence.
The computer program can present the optimum
configuration and the corresponding new installation
for each year. For reason of space limits, the propped
optimum policy for the 10 years, is presented in Fig.3.
Nevertheless the year of each new installation is
indicated in parenthesis, as well as their size.
Comparing the candidate constructions of Fig2
(dotted lines) with the selected of Fig.3, it is
remarkable that the installation of capacitors is
preferred instead of voltage regulators or line
reinforcement. The construction of the interconnection
a6-1- b8-9 the 5th year (which is necessary only for
one year) is proposed to postpone the construction of
the new substation IV, by keeping the voltage limit
over 10%. This is also clear from Fig.4, where the
minimum voltage of the system for each year is
indicated. The annual energy losses are also indicated.

-Minimum Voltage(%) *-Energy

losses (MWh)

98,

, 4500

96

3750

94

30003

92

2250

3E
g
t,

90

1500

4 5
year

r3

10

Figure 4: Operation indices changes during the

study period
The proposed method has been coded using C
language, and the computer program is executed on a
low cost PC (IBM compatible, with a 486 processor at
80 MHz). The execution time for this application is
about 3.5 hours, 85% of which is required for the
construction of the set of economical configurations
(static subproblem solution). The solution of the
dynamic subproblem is much faster.
CONCLUSIONS

A new dynamic heuristic method for the optimum

expantion planning of MV distribution networks is
proposed, based on decoupling the problem to the
static and dynamic subproblem.
The static subproblem is solved using branch
exchange methods, that are based on the
corresponding methods for the optimisation of MV
networks operation (for losses reduction and load

balancing). The dynamic subproblem is solved using

dynamic programming.
The proposed method, which is demonstrated in the
paper using a typical distribution network, can be
effectively used for extended sensitivity analyses, since
only the: dynamic subproblem is necessary to be solved
in these cases.
REFEXENCES

S. Civanlar, J.J. Grainger, H. Yin, S.S.H. Lee:

Distribution Feeder Reconfiguration for Loss
Redixtion, IEEE Trans., 1988, PWRD-3, (3), pp.
1217-1223
Merlin, A., and Back, H.: Search for a minimalloss operating spanning tree configuration for an
urban power distribution system, Proceedings of
PSCC , Cambridge, 1975, paper 1.2/6
Shirmohammadi, D. and Hong, H. W.:
Reconfiguration of electric distribution networks
for resistive line losses reduction, IEEE Trans.,
1989,PWRD-4, (2), pp. 1492-1498
Peponis, G.J., Papadopulos, M.P. and
Hatziargyriou, N.D.: Distribution network
reconfiguration to minimize resistive line losses,
Proceedings of Athens Power Technology, Vol. 2,
Sepitember 1993, pp. 601-605:republished in
Proceedings of IEEEPES 1994 Summer Meeting,
Paper ART 425-06-21
G.J. Peponis, M.P. Papadopoulos: Reconfiguration
of Ibdial Distribution Networks: Application of
Heuristic Methods on Large Scale Networks, IEE
Proc. C, 1995, 142, (6), pp. 631-638
G.J
Peponis, M.P. Papadopoulos, N.D.
Hatziargyriou: Optimal Operation of Distribution
Networks, IEEE/PES 1995 WM Proc., paper No
wlLll27-1 PWRS
T. Gonen, I.J. Ramirez-Rosado: Review of
Distribution System Planning Models: a Model for
Optimal Multistage Planning, IEE Proc. C, 1986,
1331,(7), pp. 397-408
V.H. Qluntana, H.K. Temraz, K.W. Hipel: Twostage Power System Distribution Planning
algorithm, IEE Proc. C, 1993, 140, (l), pp. 17-29
K. Nara, T. Satoh, K. Aoki, M. Kitagawa: MultiYear Expansion Planning for Distribution
Systems, IEEE Trans., 1991, PWRS-6, (3), pp.
9511-958
10 K. Nara, T. Satoh, H. Kuwabara, K. Aoki, M.
Kitagawa, T. Ishihara: Distribution Systems
Expansion Planning by Multi-Stage Branch
Exchange, IEEE Trans., 1992, PWRS-7, (l), pp.
208-2 14
11 F.S. Hillier, G.J. Lieberman: Introduction to
Operations Research,
McGraw-Hill
Book
Company, 1989