You are on page 1of 63


1.1 Introduction
The subject of minimizing distribution power losses has gained a great deal
of attention due to the high cost of electrical energy and therefore, much of current
research on distribution automation has been focusing on the minimum loss
configuration. Besides economic consideration, the effect of electric power loss is
the heat energy dissipation, which increases the temperatures of the associated
electric components and can result in insulation failure. By minimizing the power
losses, the system may acquire longer life span, and has greater reliability.
Therefore, loss minimization in distribution systems has become the subject of
intensive research.
In Practical systems, the methods employed for reduction of losses are
!etwor" reconfiguration, which is the selection of the proper
topological structure of the networ" for minimum losses.
Installation of capacitors, when this is economically justified.
#ost electric distribution feeders are configured radially for effective
coordination of their protection systems. By changing the state of networ" switches,
the radiality can always be preserved. The optimal operating condition of
distribution networ"s is obtained when line losses are minimized without any
violations of branch loading and voltage limits.
There are two types of switches in the system one is normally $closed
switch% connecting the line sections called &sectionalizing switch' and the other is
normally $open switch% on the tie(lines connecting either two primary feeders or two
substations, or loop(type laterals called &tie switch'. The change in networ"
configuration is achieved by closing or opening of these two types of switches in
such a way that the $radiality% of the networ" is maintained. *istribution lines or
line sections show different characteristics as each has a different mi+ture of
residential, commercial and industrial type loads and their corresponding pea" times
are not coincident. This is due to the fact that some parts of the distribution system
becomes heavily loaded at certain times of the day and less loaded at other times.
Therefore, by shifting the loads in the system, the radial structure of the distribution
feeders can be modified from time to time in order to reschedule the load currents
more efficiently for loss minimization.
*uring normal operating condition, networ"s are reconfigured for two
purposes ,i- to minimize the system real power losses in the networ" and to
increase networ" reliability, ,ii- to relieve the over loads in the feeders. The former
is referred to as feeder reconfiguration for loss reduction and the latter as load
balancing. In this thesis .nt /olony 0ptimization ,./0- is used to solve
distribution networ" reconfiguration and load balancing problem.
1.2 Literature survey
/ivanlar et al. 1)2 conducted the early wor" on feeder reconfiguration for
loss reduction. In 132, Baran et al. defined the problem of loss reduction and load
balancing as an integer(programming problem. !ara et al. 142 presented an
implementation that used a genetic algorithm to loo" for the minimum loss
configuration. In 15672, the authors suggested the use of the power flow method
based on a heuristic algorithm to determine the minimum loss configuration of
radial distribution networ"s. In 182, 192 the authors proposed a solution procedure
that employed simulated annealing ,:.- to search for an acceptable non(inferior
In 192 the authors have formulated the load balancing and service restoration
problems by considering the capacity and voltage constraints as a mi+ed integer
nonlinear optimization problem. Baran and ;u 172 have devised the problem of loss
minimization and load balancing as an integer programming problem .. correlation
e+isted between load balancing and loss reduction has been described in 1<2. .s the
objective functions for load balancing and loss reduction are very similar, the
calculations for load balancing are similar to that of loss(reduction case, and
therefore the search for loss( reduction can also be applied to improve load
balancing in distribution networ"s. . constrained multi(objective and non(
differentiable optimization problem with equality and inequality constraints for both
loss(reduction and load balancing has been proposed in 172. =.Peponis et al. 1)>2
have developed an improved switch(e+change method for load balancing problem,
using switch e+change operations. In the method of 1))2,1)32 some networ" branch
data are eliminated, while others are replaced by equivalents. .ccurate voltage
values changes of energy losses and load balancing inde+ are calculated using the
reduced size networ" model. #... ?ashem et al. 1))2 have proposed a load
balancing inde+ and shown that improvement in load balancing can be achieved by
networ" reconfiguration ;hei(#in @in et al. 1)32 have presented a current(inde+
based load balancing algorithm for the three 6phase unbalanced distribution
Aecently researchers have paid much attention in obtaining the solution of
distribution networ"s. Baran and ;u 1)42 have developed load flow solution in a
distribution system by the iterative solution of three fundamental equations "nown
as *ist Blow Branch Cquations representing real power, reactive power and voltage
magnitude similar to static load flow equations of transmission system. They have
computed the system Dacobian #atri+ using a chain rule. In their method the
mismatches and the Dacobin #atri+ involve only the evaluation of simple algebraic
e+pressions and no trigonometric functions. They have also proposed decoupled and
Bast(decoupled distribution load flow algorithms.
/hiang 1)52 developed three solution algorithms for distribution system
based on Baran and ;u *ist Blow Branch Cquations. !ewton(Aapson ,!A- method
requires heavy computation in finding Dacobian #atri+. /hiang%s decoupled
algorithm modifies !A method by e+ploiting the numerical properties of the system
Dacobian to improve its computational efficiency. Burther improvement can be
achieved by assuming diagonal elements of Dacobian as constants. This leads to the
development of /hiang%s second algorithm namely Bast(decoupled algorithm, which
has the same spirit as the Bast(decoupled load flow methods for Transmission
systems. In this algorithm the system Dacobian is constructed only once at the first
iteration and is used for the remaining iterations. It is possible to further reduce the
computational burden associated with second algorithm based on the assumption
that system diagonal Dacobian matrices are close to identity matri+. This is
implemented in /hiang%s third algorithm namely very Bast(decoupled algorithm,
which does not require any Dacobin matri+ construction and factorization.
Dasmon E @ee 1)F2 further developed the distribution power flow equations
such that the loss terms in two of the fundamental equations are grouped and
represented in a single line equivalent. This process represents the actual
distribution networ" by a simple single line equivalent. This method e+tends the
single line equivalent networ" to be used for load flow calculations and for deriving
the conditions for voltage collapse to occur. The conventional load flow methods
can indicate the possibility of voltage collapse but are unable to predict its
occurrence in advance. *ue to the simplicity of the single line equivalent technique,
Dasmon E @ee method is most suitable for use in real(time distribution system
monitoring as stability analysis based on this method is much simplified. .s this
method is much simplified for finding losses, it doesn%t provide accuracy. .ll
voltage terms are eliminated from the equations for solving the load flows there by
simplifying the equations for iterative solution.
The conventional distribution load flow methods involve the formation of
Dacobin matri+ and trigonometric functions. ?ersting 1)72 presented a load flow
technique based on the ladder networ" theory and it appears to wor" very well. *as,
?otari and ?alam 1)82 developed a simple and efficient method, which involves
only the evaluation of a simple algebraic e+pression of voltage magnitudes. :o this
method is efficient and requires less computer memory.
.nt /olony 0ptimization ,./0- is a paradigm for designing metaheuristic
algorithms for combinatorial optimization problems. The first algorithm which can
be classified within this framewor" was presented in )<<) and, since then, many
diverse variants of the basic principle have been reported in the literature. The
essential trait of ./0 algorithms is the combination of a priori information about
the structure of a promising solution with a posteriori information about the
structure of previously obtained good solutions.
#etaheuristic algorithms are algorithms which, in order to escape from local
optima, drive some basic heuristic either a constructive heuristic starting from a
null solution and adding elements to build a good complete one, or a local search
heuristic starting from a complete solution and iteratively modifying some of its
elements in order to achieve a better one.
./0 is a class of algorithms, whose first member, called .nt :ystem, was
initially proposed by /olorni, *origo and #aniezzo. The main underlying idea,
loosely inspired by the behavior of real ants, is that of a parallel search over several
constructive computational threads based on local problem data and on a dynamic
memory structure containing information on the quality of previously obtained
result. The collective behavior emerging from the interaction of the different search
threads has proved effective in solving combinatorial optimization ,/0- problems.
The objective of distribution reconfiguration is to minimize losses in distribution
networ" and to balance loads on the distribution networ", and this requires
computation of power loss and bus voltages which can be obtained from load flows.
2.1 Introduction
The conventional load flow methods of transmission systems are not suitable
for distribution systems. #any researches have suggested modified versions of the
conventional load flow methods for solving the distribution networ" by considering
it as ill(conditional power networ" and they included admittance matri+, Dacobins,
Trigonometric functions that results in large computational time.
2.2 Load &o' #o&ution
The thesis uses a new load flow technique for solving radial distribution networ"s
which involves only the evaluation of a simple algebraic e+pression of receiving end
voltage and involves no trigonometric function as apposed to the standard load flow
methods. Gsing ?irchoff%s current law and ?irchoff%s voltage law a set of iterative
equations were developed. It is very efficient and has e+cellent convergence
characteristics. The radial topology of distribution networ"s has been fully e+ploited by
this method. In solving the radial distribution networ" for load flow some assumptions
were assumed to simplify the solution.
). It is assumed that the three phase radial distribution networ"s are balanced
and represented by their equivalent single line representation.
3. Half(line charging susceptances of distribution lines are negligible and
these distribution lines are represented as short lines.
4. :hunt capacitor ban"s are treated as loads.
2.2.1 Circuit (ode&
In this section circuit model of a )7(node radial distribution system is
.s it is assumed that three(phase radial distribution system is balanced, it can
be represented by its equivalent single line diagrams. Big.3.) shows single line
diagram of ICCC )7 node radial distribution system.
2.2.2 #o&ution "et*odo&o+y
In any radial distribution system, the electrical equivalent of a branch(),
which is connected between node ) and 3 having a resistance A
and inductive
reactance I
is shown in Big.3.3
/onsider branch ). The receiving(end node voltage can be written as
- ) , - ) , - ) , - 3 ,
:ectionalizing :witch
Tie :witch
@oad /enter
Beeder ) Beeder 3 Beeder 4
) 3 4
)F )7
i+.2.1, IEEE 1- $us #yste(
) , 3 !ode number
), 3,. . . . Branch number
:imilarly for branch 3,
- 3 , - 3 , - 3 , - 4 ,
.s the substation voltage K
is "nown ,ta"en as ) p.u-, so if I
is "nown,
i.e., current of branch(), it is easy to calculate K
from Cqn.3.). 0nce K
"nown, it is easy to calculate K
from Cqn.3.3, if the current through branch 3 is
"nown. :imilarly, voltages of nodes 5,F,L. nd ,number of nodes- can easily be
calculated if all the branch currents are "nown. Therefore, a generalized equation of
receiving(end voltage, sending(end voltage, branch current and branch impedance is
,i )- ,i - , j- , j-

;here $j% is the branch number.
i M sending end node of branch $j%
iN) M receiving end node of branch $j%
Cqn.3.4 can be evaluated for j M ),3L., nb ,number of branches-. /urrent
through branch ) is equal to the sum of the load currents of all the nodes beyond
branch ), i.e.

3 i
- i , @ - ) ,
In general
i+, 2.2 #in+&e &ine dia+ra( o. a /ranc*
- ) , - ) ,
- 3 , - 3 ,
) 3

" i
- i , @ - j ,
The current through branch 3 is equal to the sum of the load currents of all
the nodes beyond branch 3 plus the sum of the charging currents of all the nodes
beyond branch 3. Therefore, if it is possible to identify the nodes beyond all the
branches, it is possible to computer all the branch currents. Identification of the
nodes beyond all the branches is realized through an algorithm as e+plained in
:ection 3.4.
The load current of node $i% is
- i , @ - i , @
- i , @
jO P


;here $i% M 3,4,L., nd
M@oad current of node $i%
iQ Q node to connected load power /omple+ O j P
- i , @ - i , @
@oad currents are computed iteratively. . flat voltage profile for all the
nodes is assumed for the first iteration and load currents of all the loads are
computed using Cqn.3.F. The branch currents are computed using load currents in
Cqn.3.5. . detailed load(flow(calculation procedure is described in :ection 3.5.
The comple+ power loss of a branch $j% between node $i% and node $iN)% is
computed as follows
Power fed into the branch $j% between bus $i% and $iN)% at bus $i% is ( )
,i- , j-
K ,I -
:imilarly power fed into the branch $j% at bus $iN)% is ( )
,i )- , j-
K ,I -

Therefore the power loss in the branch $j% is written as
- j , - j ,
@O j @P
( )
,i- ,m-
K ,I -
N( )
,i )- ,m-
K ,I -

The real and reactive power losses of branch $m% are given by
( )
,m- ,i - , j- ,i )- , j-
@P real K I K I

( )
,m- ,i- , j- ,i )- , j-
@O imag K I K I
2.0 I&&ustration o. Node Identi.ication
/onsider ICCC()7 node radial distribution system shown in Big.3.). The
formation of various vectors used in sparsity technique for node identification is
given below
2.0.1 A&+orit*( .or Node Identi.ication
Bollowing algorithm e+plains the methodology of identifying the nodes and
branches connected to a particular node in detail, which will help in finding the
e+act load feeding through that particular node. A&+orit*( .or or(ation o. 1ectors 2Adn3 Ad/3 " and "T4
:tep ) Aead system branch data
:tep 3 Initialize vector #B with ) E :M>
:tep 4 Initialize the count for node iM)
:tep 5 Initialize count for branch count jM)
:tep F if ,iM M :C 1j2- go to step 8 else go to step 7
:tep 7 if ,iM M AC1j2 go to step 9 else go to step <
:tep 8 :M:N)
.dn 1:2 M AC 1j2
.db 1:2 M j
:tep 9 :M:N)
.dn 1:2 M:C 1j2
.db 1:2 Mj
:tep < if ,jRnd-
jMjN) go to step F else go to step )>
:tep )> #T1i2 M:
#B 1iN)2 M#T1i2 N)
:tep )) if ,iRMnd-
iMiN) go to step 5 else go to step )3
:tep )3 stop
Ta/&e 2.2, " and "T vectors o. .i+ 214
!ode no. #B 1i2 #T 1i2
) ) )
3 3 3
4 4 4
5 5 7
F 8 8
7 9 <
8 )> )>
9 )) )4
< )5 )7
)> )8 )8
)) )9 )9
)3 )< )<
)4 3> 33
)5 34 34
)F 35 3F
)7 37 37
#B1i2 M#emory location from
#T1i2 M#emory location to for a particular node $i%.
;here, iM) to nd
Ta/&e 2.0 Ad5acent /ranc* 2Ad/4 6 node 2Adn4 vectors o. i+. 2.1
The details of the implementing vectors in sparsity technique are given in
Tables 3.) and 3.3. $#B% and $#T% govern the reservation allocation of memory
location for each node. ;ith the help $.dn% and $.db%, vectors constructed $#B%
and $#T% vectors it is very simple to calculate the effective branch currents and
voltages at any particular node.
2.7 Load &o' Ca&cu&ation
The loadflow used in this thesis is forward(bac"ward distribution loadflow.
Initially flat voltage profile is assumed for all the nodes i.e., voltage is set to )p.u.
2.7.1 $ac8'ard Pro)a+ation
The purpose of the bac"ward propagation computation is to obtain updated
branch currents in each section, by considering the previous iteration voltages at !ode .dn .db !ode .dn .db
) ) 5 ) )5
9 7
3 3 9 F )F )) 9
4 4 )4 )> )7 )3 <
) ) )8 )> 9 8
F F 3 )9 )) < 9
7 7 4 )< )3 < <
8 F 5 3 3>
4 )>
5 4 3) )5 ))
< 8 5 33 )F )3
)> 8 7 5 34 )5 )4 ))
3 F 35
)4 )3
)3 < 7 3F )7 )4
)4 )> 8 37 )7 )F )4
each node. *uring bac"ward propagation, voltage values are held constant at the
values obtained in the forward path and updated branch currents are transmitted
bac"ward along the feeder using bac"ward path. Bac"ward propagation starts at the
e+treme end branch and proceeds towards source node.
2.7.2 or'ard Pro)a+ation
The purpose of the forward propagation is to calculate the voltages at each
node starting from the feeder source branch. The feeder substation voltage is set at
its actual value. *uring forward propagation the current in each branch is held
constant to the value obtained in bac"ward wal". The node voltages are calculated
using Cqn.3.4.
2.7.0 Test .or Conver+ence
The convergence criterion is the voltage mismatch between voltages obtained
in the current iteration and the previous iteration. @oadflow iterations are stopped
when the iterations reach a ma+imum iteration count or when the ma+imum
deviation in the node voltages for a successive iterations is less than a pre(specified
tolerance value.
2.7.7 A&+orit*( .or Load &o' Ca&cu&ations
:tep ) Aead the line and load data
Bor jM) to ,nd()-
iM3 to nd
Initialize K1i2MKK1i2M).>
Crr M >.>>>>)
:tep 3 IT M )
:tep 4 Aead #B, #T, .dn, .db vectors
:tep 5 /alculate load current at each node starting from the last load.
Gsing the load currents obtain branch currents using Cqn.3.5
:tep F Bor bus iM3 to nd
Bor jM #B1i2, nM.dn1j2, "M.db1j2
/alculate the node voltages using Cqn.3.4
:tep 7 Bor iM3 to nd
If ,,K1i2(KK1i2- R Crr- go to step 9 else go to step 5
:tep 8 ITNN
:tep 9 Bor jM) to ,nb-
/alculate real and reactive power loss using Cqn.3.7
:tep < Print voltages at each bus, TP@, TO@, and number of iterations
:tep )> stop
0.1 Introduction
Insects that live in colonies, such as ants, bees, wasps and termites, follow
their own agenda of tas"s independent from one another. However, when these
insects act as a whole community, they are capable of solving comple+ problems in
their daily lives, through mutual cooperation. Problems such as selecting and
pic"ing up materials, and finding and storing foods, which require sophisticated
planning, are solved by insect colonies without any "ind of supervisor or controller.
This collective behavior which emerges from a group of social insects has been
called &swarm intelligence'. .nts are capable of finding the shortest route between
a food source and the nest without the use of visual information, and they are also
capable of adapting to changes in the environment
The natural metaphor on which ant algorithms are based is that of ant
colonies. Aeal ants are capable of finding the shortest path from a food source to
their nest without using visual cues by e+ploiting pheromone information. ;hile
wal"ing, ants deposit pheromone on the ground and follow, in probability,
pheromone previously deposited by other ants. In Big.4.), we show a way ants
e+ploit pheromone to find a shortest path between two points. /onsider Big.4.),a-
ants arrive at a decision point in which they have to decide whether to turn left or
right. :ince they have no clue about which is the best choice, they choose randomly.
It can be e+pected that, on average, half of the ants decide to turn left and the other
half to turn right. This happens both to ants moving from left to right and to those
moving from right to left. Bigs.4.),b- and 4.),c- shows what happens in the
immediately following instants, supposing that all ants wal" at appro+imately the
same speed. The number of dashed lines is roughly proportional to the amount of
pheromone that the ants have deposited on the ground. :ince the lower path is
shorter than the upper one, more ants will visit it on average, and therefore
pheromone accumulates faster. .fter a short transitory period the difference in the
amount of pheromone on the two paths is sufficiently large so as to influence the
decision of new ants coming into the system 1this is shown by Big.4.),d-2. Brom
now on, new ants will prefer in probability to choose the lower path, since at the
decision point they perceive a greater amount of pheromone on the lower path. This
in turn increases, with a positive feedbac" effect, the number of ants choosing the
lower, and shorter, path. Kery soon all ants will be using the shorter path.
i+. 0.1 $e*avior o. Rea& Ants
The above behavior of real ants has inspired Ant system, an algorithm in
which a set of artificial ants cooperate to the solution of a problem by e+changing
information via pheromone deposited on graph edges. The ant system has been
applied to combinatorial optimization problems such as the traveling salesman
problem ,T:P- and the quadratic assignment problem. The ant colony system
,./:-, the algorithm presented in this thesis, builds on the previous ant system in
the direction of improving efficiency when applied to hard combinatorial problems
such as traveling salesmen problem quadratic assignment problem and even to
networ" reconfiguration problem.
The concept of .nt colony system can be better e+plained by applying it to
Traveling salesmen problem. The main idea is that of having a set of agents, called
Ants, search in parallel for good solutions to the T:P and cooperate through
pheromone(mediated indirect and global communication. Informally, each ant
constructs a T:P solution in an iterative way it adds new cities to a partial solution
by e+ploiting both information gained from past e+perience and a greedy heuristic.
#emory ta"es the form of pheromone deposited by ants on T:P edges, while
heuristic information is simply given by the edge%s length.
0.2 Ant syste(
Ant system 1)92 is the progenitor of all the research efforts with ant
algorithms and was first applied to the T:P. .nt system utilizes a graph
representation which is augmented as follows in addition to the cost measure
- s , r ,
, each edge
- s , r ,
has also a desirability measure
- s , r ,
, called
pheromone, which is updated at run time by artificial ants ,ants for short-. ;hen ant
system is applied to symmetric instances of the T:P,
- r , s , - s , r ,
but when it is
applied to asymmetric instances it is possible that
- r , s , - s , r ,
Informally, ant system wor"s as follows. Cach ant generates a complete tour
by choosing the cities according to a probabilistic state transition ruleS ants prefer to
move to cities which are connected by short edges with a high amount of
pheromone. 0nce all ants have completed their tours a global pheromone updating
rule ,global updating rule, for short- is appliedS a fraction of the pheromone
evaporates on all edges ,edges that are not refreshed become less desirable-, and
then each ant deposits an amount of pheromone on edges which belong to its tour in
proportion to how short its tour was ,in other words, edges which belong to many
short tours are the edges which receive the greater amount of pheromone-. The
process is then iterated. The state transition rule used by ant system, called a
random-proportional rule, is given by Cqn.4.), which gives the probability with
which ant $"% in city $r% chooses to move to the city $s%
[ ] [ ]
[ ] [ ]


otherwise , >
,r- D s if
- u , r , - u , r ,
- s , r , - s , r ,
- s , r , p
- r , D u


is the pheromone,

is the inverse of the distance
- s , r ,
- r , D
is the set of cities that remain to be visited by ant " positioned on city r ,to
ma"e the solution feasible-, and

is a parameter which determines the relative

importance of pheromone versus distance
- > , >
In Cqn.4.) we multiply the pheromone on edge
- s , r ,
by the corresponding
heuristic value
- s , r ,
. In this way we favor the choice of edges which are shorter
and which have a greater amount of pheromone.
In ant system, the global updating rule is implemented as follows. 0nce all
ants have built their tours, pheromone is updated on all edges according to
" )
,r, s- ,) - ,r, s- ,r, s-



otherwise >
" ant by done tour s- if,r, ,
- s , r ,

) > < < is a pheromone decay parameter

@ is the length of the tour performed by ant "
$m% is the number of ants
Pheromone updating is intended to allocate a greater amount of pheromone
to shorter tours. In a sense, this is similar to a reinforcement learning scheme, in
which better solutions get a higher reinforcement ,as happens, for e+ample, in
genetic algorithms under proportional selection-. The pheromone updating formula
was meant to simulate the change in the amount of pheromone due to both the
addition of new pheromone deposited by ants on the visited edges and to pheromone
evaporation. Pheromone placed on the edges plays the role of a distributed long(
term memory this memory is not stored locally within the individual ants, but is
distributed on the edges of the graph. This allows an indirect form of
communication called stigmergy.
.lthough ant system was useful for discovering good or optimal solutions for
small T:P%s, the time required to find such results made it infeasible for larger
problems. #arco *origo and @uca #aria =ambardella devised three main changes to
improve .nt system performance which led to the definition of the .nt colony
system ,./:-.
0.0 Ant Co&ony #yste(
The .nt /olony :ystem ,./:- differs from the previous ant system because
of three main aspects
i- The state transition rule provides a direct way to balance between
e+ploration of new edges and e+ploitation of a priori and accumulated
"nowledge about the problem
ii- The global updating rule is applied only to edges which belong to the
best ant tour,
iii- ;hile ants construct a solution a local pheromone updating rule ,local
updating rule, for short- is applied.
Informally, the ./: wor"s as follows $m% ants are initially positioned on $n%
cities chosen according to some initialization rule ,e.g., randomly-. Cach ant builds
a tour ,i.e., a feasible solution to the T:P- by repeatedly applying a stochastic
greedy rule ,the state transition rule-. ;hile constructing its tour, an ant also
modifies the amount of pheromone on the visited edges by applying the local
updating rule. 0nce all ants have terminated their tour, the amount of pheromone on
edges is modified again ,by applying the global updating rule-. .s was the case in
ant system, ants are guided, in building their tours, by both heuristic information
,they prefer to choose short edges- and by pheromone information. .n edge with a
high amount of pheromone is a very desirable choice. The pheromone updating rules
are designed so that they tend to give more pheromone to edges which should be
visited by ants.
0.0.1 AC# #tate Transition Ru&e
In the ./: the state transition rule is as follows an ant positioned on node
$r% chooses the city $s% to move to by applying the rule given by
[ ] [ ] { }


u r u r t
r J u

- , , - , , ma+ arg
- ,
n- e+ploratio ,Biased otherwise
ion- ,e+ploitat q q if

where q is a random number uniformly distributed in 1> )2, q
is a parameter
( ) ) q >

, and $:% is a random variable selected according to the probability
distribution given by Cqn.4.).
The state transition rule resulting from Cqns.4.) and 4.4 is called pseudo-
random-proportional rule. This state transition rule, as with the previous random(
proportional rule, favors transitions toward nodes connected by short edges and with
a large amount of pheromone. The parameter q
determines the relative importance
of e+ploitation versus e+ploration ;hen a particular ant is positioned in node r, a
random number q
( ) ) q >
is generated. If
( )
q q
, then the best branch is selected,
this means that e+ploitation was the decisive factor, while in the opposite case, the
selection of the route is performed according to the probabilistic transition rule Cqn.4.)
0.0.2 AC# :&o/a& U)datin+ Ru&e
In ./: only the globally best ant ,i.e., the ant which constructed the shortest
tour from the beginning of the trial- is allowed to deposit pheromone. This choice,
together with the use of the pseudo(random(proportional rule, is intended to ma"e
the search more directed. .nts search in a neighborhood of the best tour found up to
the current iteration of the algorithm. =lobal updating is performed after all ants
have completed their tours. The pheromone level is updated by applying the global
updating rule of Cqn.4.5.
,r, s- ,) - ,r, s- ,r, s- + L4.5
( )


otherwise >
best global s- ,r, if @
- s , r ,

( ) ) > < <

is the pheromone decay parameter, and gb
is the length of the globally
best tour from the beginning of the trial. .s was the case in ant system, global
updating is intended to provide a greater amount of pheromone to shorter tours.
Cqn.4.5 dictates that only those edges belonging to the globally best tour will
receive reinforcement.
0.0.0 AC# Loca& U)datin+ Ru&e
;hile building a solution ,i.e., a tour- of the T:P, ants visit edges and
change their pheromone level by applying the local updating rule of Cqn.4.F.
- s , r , - s , r , - ) , - s , r , +
) > < <
is a parameter.
0.0.7 #i(i&arities and Di..erences 'it* Rea& Ants
#ost of the ideas of ./0 stem from real ants. In particular, the use of the
following .nt behavior
a- . colony of cooperating individuals
b- .n ,artificial- pheromone trail for local stigmergetic communication
c- . sequence of local moves to find shortest paths
d- . stochastic decision policy using local information and no loo"(ahead. Co&ony o. coo)eratin+ individua&s
.s real ant colonies, ant algorithms are composed of a population, or colony,
of concurrent and asynchronous entities globally cooperating to find a good
&solution' to the tas" under consideration. .lthough the comple+ity of each
artificial ant is such that it can build a feasible solution ,as a real ant can somehow
find a path between the nest and the food-, high quality solutions are the result of
the cooperation among the individuals of the whole colony. .nts cooperate by
means of the information they concurrently readTwrite on the problem%s states they
visit. P*ero(one trai& and sti+(er+y
.rtificial ants modify some aspects of their environment as the real ants do.
;hile real ants deposit on the world%s state they visit a chemical substance, the
pheromone, artificial ants change some numeric information locally stored in the
problem%s state they visit. This information ta"es into account the ant%s current
history or performance and can be readTwritten by any ant accessing the state. By
analogy, we call this numeric information artificial pheromone trail, pheromone
trail for short. In ./0 algorithms local pheromone trails are the only
communication channels among the ants. This stigmergetic form of communication
plays a major role in the utilization of collective "nowledge. Its main effect is to
change the way the environment ,the problem landscape- is locally perceived by the
ants as a function of all the past history of the whole ant colony. Gsually, in ./0
algorithms, an evaporation mechanism similar to real pheromone evaporation
modifies pheromone information over time. Pheromone evaporation allows the ant
colony slowly to forget its past history so that it can direct its search toward new
directions without being over(constrained by past decisions. #*ortest )at* searc*in+ and &oca& (oves
.rtificial and real ants share a common tas" to find a shortest ,minimum
cost- path joining an origin ,nest- to destination ,food- sites. Aeal ants do not jumpS
they just wal" through adjacent terrain%s states, and so do artificial ants, moving
step(by(step through &adjacent states' of the problem. The e+act definitions of state
and adjacency are problem specific. #toc*astic and (yo)ic state transition )o&icy
.rtificial ants, as real ones, build solutions applying a probabilistic decision
policy to move through adjacent states. .s for real ants, the artificial ants% policy
ma"es use of local information only and it does not ma"e use of loo"(ahead to
predict future states. Therefore, the applied policy is completely local, in space and
time. The policy is a function of both the a priori information represented by the
problem specifications ,equivalent to the terrain%s structure for real ants-, and of the
local modifications in the environment ,pheromone trails- induced by past ants.
.rtificial ants also have some characteristics that do not find their
counterpart i.e. in real ants.
.rtificial ants live in a discrete world and their moves consist of transitions from
discrete states to discrete states.
.rtificial ants have an internal state. This private state contains the memory of
the ants% past actions.
.rtificial ants deposit an amount of pheromone that is a function of the quality
of the solution found.
.rtificial ant%s timing in pheromone laying is problem dependent and often does
not reflect real ant%s behavior. Bor e+ample, in many cases artificial ants update
pheromone trails only after having generated a solution.
To improve overall system efficiency, ./0 algorithms can be enriched with
extra capabilities such as loo"(ahead, local optimization, bac"trac"ing, and so
on that cannot be found in real ants. In many implementations ants have been
hybridized with local optimization procedures.
0.7 Case study,
Traveling salesmen problem ,T:P- for )F cities
The position of each city is represented by the co(ordinates in two dimension plane.
/onsidering the following parameters for .nt /olony :earch algorithm
!umber of antsF
, ) . > ,
) . >
>>>) . >

, q
M>.<, #a+imum number of iterationsM)>>
Table 4.) *ata for )F /ities position for traveling salesmen problem
Position of /ities in 3*
coordinate system
,measured in ?m from
reference point-
) ,<F, 9<- < ,53, 4>-
3 ,93, 54- )> ,49, <3-
4 ,37, 33- )) ,78, 3<-
5 ,)3, )4- )3 ,5), 7)-
F ,94, )8- )4 ,F, 9)-
7 ,<5, 4)- )5 ,<3, 43-
8 ,9F, F9- )F ,97, <<-
9 ,5F, 78-
#o&ution, Bor the )F cities problem given in case study, after the application of
.nt colony search algorithm the best tour ,minimal closed tour length- of 475.85F7
?m is obtained. The sequence of cities to be visited is given by the following
1 ; 2 17 - < 11 = 0 7 12 > 10 1? 1< 1
The route map for the traveling sales man is as given in fig.4.3
0 10 20 30 40 50 60 70 80 90 100
i+, 0.2 Route (a) o. t*e sa&es(an
The )F cities problem ant colony search algorithm is applied for hundred
iterations and the convergence of the algorithm for best fitness is shown in fig.4.4.
0 10 20 30 40 50 60 70 80 90 100


Convergence characteristics for Travelling Salesmen Problem
i+, 0.0 conver+ence c*aracteristics .or 1< cities trave&in+ sa&es(an )ro/&e(
0.7.1 actors e..ectin+ Per.or(ance o. Ant co&ony searc* a&+orit*(
). !umber of ants /onvergence can be accelerated by increasing the number of
cooperative agents ,$.nts%-. The ma+imum number of ants which can be used
for ./: algorithm is limited by the number of cities. The optimal number of
ants is close to the number of cities. /onvergence performance of ./: algorithm
for different number of ants is shown in Big.4.5.
3. $Beta% value

represents the relative importance between pheromone and

distance between cities. Bor
, ./: algorithm wor"s solely on the
pheromone amount deposited on the path and the effect of path distance is not
ta"en into account, and the convergence is delayed. ;ith
> >
performance is improved as shown in Big.4.F
4. >

Initial pheromone value >

is set to a small value. #ore precisely initial

pheromone value should be set to a value near to the inverse of the fitness value to
improve the convergence performance.

values are determined e+perimentally with different values for the
specified problem and the values are ta"en which gives best performance.
0 10 20 30 40 50 60 70 80 90 100
It erat ions


Convergence c haract erist ic s for Different Number of Ant s
3 Ant s
6 Ant s
9 Ant s
i+, 0.7, Conver+ence o. AC# a&+orit*( .or t*ree3 si@ and nine Ants
0 10 20 30 40 50 60 70 80 90 100
It erat ions


Convergenc e charac t eris t ic s for Different " Bet a" Values
Bet a=0
Bet a=1
Bet a=2
i+.0.<, Conver+ence o. t*e a&+orit*( .or di..erent

0.< :enetic A&+orit*(
=enetic algorithm is a search heuristic inspired by biological evolution. The
basic =. algorithm involves the +eneration of a population of possible solutions,
eva&uation of the solutions according to a fitness function, se&ection of a set of fit
&parent' solutions, and finally re)roduction of those parents to generate a new
population of possible solution. The following section is a brief e+planation of the
important processes which are simulated during a =.. The terminology of =.s
remains firmly embedded in biology, and so it is common to discuss &parents,'
&children', &alleles' and so on.
0.<.1 Re)resentation and itness
The first step in creating a =. is to select a solution representation and a
fitness function. The solution representation has historically been a fi+ed(length
string of units ,bits, real numbers, letters, etc.-, and this is still the standard
representation used today. Cach string must represent a possible solution in some
non(arbitrary way. The fitness function defines the shape of the fitness landscape.
The fitness function is the essence of the problem it provides the means by which
the quality of a solution may be assessed, and the probability that a solution will
reproduce. The function needs to be a direct measure of the quality of the proposed
0.<.2 :eneration o. an initia& )o)u&ation
The initial population is typically generated at random such that each string
represents a potential solution ,often impossible solutions are e+cluded-.
.lternatively, the population may be seeded in areas where it is li"ely to find a
solution, potentially shortening the time required to solve the problem.
0.<.0 #e&ection o. so&utions
. fitness(based selection method is used to choose those solutions which will
produce the ne+t generation. The selection method is biased towards individuals of
higher fitness, in order that better genetic material can persist in the population, and
be improved upon through reproduction. There are several different selection
schemes used in =.s.
). 0ne common method, fitness proportionate selection, selects parents with a
probability which is directly proportional to their fitness. This requires
evaluating the fitness of every solution in the population.
3. . second method which may require fewer fitness evaluations is
tournament selection. In this method, solutions are randomly selected to
participate in a &tournament'S the solution with the highest fitness is
selected, and the process repeats until enough parents are chosen.
#ost selection methods are stochastic, and so may allow a small number of
less(fit solutions to reproduce. This has the advantage of maintaining diversity in
the population.
0.<.7 Re)roduction
Aeproduction generally consists of two parts, crossover and mutation.
0.<.7.1 Crossover
/rossover is the basic method of recombining genetic material from two
parents. /rossover commonly involves randomly selecting some number of
crossover points, and e+changing those alleles which lie between the points. Bor
e+ample, if the two parents below undergo two(point crossover at the positions
indicated, they may produce either of the two &children' shown
0.<.7.2 "utation
#utation is the disruption of genetic material after crossover. By introducing
random variations into the child population, we can ensure that the diversity of the
population remains large, and the ability to e+plore the landscape is retained.
#utation generally depends on a mutation rate, which is the probability that any one
allele will mutate to a new value. . typical mutation on one allele may involve
&flipping' one bit from > to ) or visa versa in a binary string, or adding a random
value to an allele in a string of real numbers.
0.- T*e a&+orit*(
Parent ) > > >
> > > >
Parent 3 ) ) )
) ) ) )
/hild ) > > > ) ) ) ) >
/hild 3 ) ) ) > > > > )
The most basic =. simply runs through these processes in order, and repeats
until either an adequate solution has been found or a certain amount of time has
passed. The canonical =. therefore proceeds as follows
=enerate an initial population
:elect a set of parents by some fitness(based method
Perform crossover on parents to produce children
Perform mutation on children
G!TI@ a terminating condition has been reached
Net'or8 Recon.i+uration
7.1 Introduction
Between 4> and 5> U of total investments in the electrical sector goes to
distribution systems, but nevertheless, they have not received the technological
impact in the same manner as the generation and transmission systems. *istribution
networ"s wor" mostly with minimum monitoring. The manual control of capacitors,
sectionalizing switches and voltage regulators are operated manually without
adequate computation support for the systemQs operators. !evertheless, there is an
increasing trend to automate distribution systems to improve their reliability,
efficiency and service quality. .utomation is possible due to the advance
microprocessor control technology, to its increasing cost reduction and due to its
joint use with telecommunications technologies. It is possible to install distribution
operation centers where the networ" is constantly monitored and control actions can
be made remotely. ;ith the aid of these technologies it is possible to monitor
substations and feeders to reconfigure feeders and to control voltage and reactive
If the networ" reconfiguration and voltage control and reactive power
adjustments become routine operations, the operators will not trust only on their
criteria and e+perience to operate the system. It will be necessary to have dedicated
software that assists the operator in selecting appropriate control actions. 0ne of
these actions is the networ" reconfiguration that can be oriented to different
objectives. Gnder normal operating conditions, the networ" is reconfigured to
reduce the systemQs losses andTor to balance load in the feeders. Gnder conditions of
permanent failure, the networ" is reconfigured to restore the service, minimizing the
zones without power.
*istribution systems consist of groups of interconnected radial circuits. The
configuration may be varied via switching operations to transfer loads among the
feeders. Two types of switches are used in primary distribution systems. They are
normally closed switches ,sectionalizing switches- or normally open switches ,tie
switches-. Both types are designed for both protection and configuration
management. !etwor" reconfiguration is the process of changing the topology of
distribution systems by altering the openTclosed status of switches.
!etwor" reconfiguration is a complicated combinatorial, non(differentiable,
constrained optimization problem because the distribution system involves many
candidate(switching combinations.
In this thesis an ant colony search algorithm ,./:.- 1)<2 is used to solve the
optimal networ" reconfiguration problem for power loss reduction. The ./:. is a
relatively new and powerful intelligence evolution method for solving optimization
problems. It is a population(based approach that uses e+ploration of positive
feedbac" as well as greedy search. By applying the ./:., the near(optimal solution
to the networ" reconfiguration problem can be effectively achieved. The merits of
the ./:. are parallel search and optimization capabilities. This method was
inspired by the observation of the behaviors of ant colonies. The ./:. used in this
thesis uses artificial ants, which to some e+tent have memory and are not completely
blind, thus can be applied to the networ" reconfiguration problem in which switch is
discrete. The state transition rule, global, and local updating rules are introduced to
ensure the optimal solution. In order to demonstrate the effectiveness, the proposed
approach is applied to two e+ample systems. 0ne is a three(feeder distribution
system from the literature and another is a practical distribution networ" of Taiwan
Power /ompany ,TP/-, both are solved, respectively, by the proposed methods, :.
and =.. Brom the computational results, it is observed that the convergence
property of the ./:. method is better than that of the other two methods.
7.2 Pro/&e( .or(u&ation
The objective of the networ" reconfiguration problem is to minimize the
system power loss, subject to operating constraints under a certain load pattern. The
objective function can be e+pressed as follows
- : : ,P min B min
/I I /K K loss T,
+ +
is the total real power loss of the system. Parameters !

the penalty constants, S
the squared sum of the violated voltage constraints, and
is the squared sum of the violated current constraints. #oreover, the penalty
constants are determined as follows
,)- /onstant

- is given a value of $>%, if the associated voltage ,current-
constraint is not violated.
,3- . significant value is given to !

- if the associated voltage ,current-
constraint is violatedS this ma"es the objective function to move away from the
undesirable solution.
Bor secure operation, the voltage magnitude at each bus must be maintained
within its limits. The current in each branch must satisfy the branch%s capacity.
These constraints are e+pressed below
ma+ i min
ma+ , i i
where i
is voltage magnitude of bus i, K
and K
are minimum and ma+imum
bus voltage limits, respectively. i
and I
are current magnitude and ma+imum
current limit of branch i, respectively.
The proposed method uses a set of simplified feeder(line flow formulations for
power flow analysis to prevent complicated computation.
7.0 A))&ication o. Ant Co&ony #earc* A&+orit*( 2AC#A4 to
recon.i+uration )ro/&e(
7.0.1 #tate transition ru&e and &oca&A+&o/a& u)datin+ ru&e
.s illustrated in chapter 4, by the guidance of the pheromone intensity, the
ants select preferable path. Binally, the favorite path rich of pheromone become the
best tour, the solution to the problem. This concept develops the emergence of the
./:. method. .t first, each ant is placed on a starting state. Cach will build a full
path, from the beginning to the end state, through the repetitive application of state
transition rule. ;hile constructing its tour, an ant also modifies the amount of
pheromone on the visited path by applying the local updating rule. 0nce all ants
have terminated their tour, the amount of pheromone on edge is modified again
through the global updating rule. In other words, the pheromone(updating rules are
designed so that they tend to give more pheromone to paths which should be visited
by ants. In the following, the state transition rule, the local updating rule, and the
global updating rule are briefly introduced. #tate transition ru&e
The state transition rule used by the ant system, called a random(proportional
rule, is given by Cqn.5.5, which gives the probability with which ant k in node i
chooses to move to node #.
[ ] [ ]
[ ] [ ]


otherwise , >
,i- D s if
- m , i , - m , i ,
- j , i , - j , i ,
- j , i , p
- i , D m


is the pheromone which deposited on the edge between nodes i and #,

the inverse of the edge distance, J
,i- the set of nodes that remain to be visited by
ant k positioned on node i, and

is a parameter which determines the relative

importance of pheromone versus distance. Cqn.5.5 indicates that the state transition
rule favors transitions toward nodes connected by shorter edges and with greater
large amount of pheromone. Loca& u)datin+ ru&e
;hile constructing its tour, each ant modifies the pheromone by the local
updating rule. This can be written below
- j , i , - ) , - j , i , +
where >

is the initial pheromone value and

is a heuristically defined parameter.

The local updating rule is intended to shuffle the search process. Hence, the
desirability of paths can be dynamically changed. The nodes visited earlier by a
certain ant can be also e+plored later by other ants. The search space can be
therefore e+tended. Burthermore, in so doing, ants will ma"e a better use of
pheromone information. ;ithout local updating, all ants would search in a narrow
neighborhood of the best previous tour. :&o/a& u)datin+ ru&e
;hen tours are completed, the global updating rule is applied to edges
belonging to the best ant tour. This rule is intended to provide a greater amount of
pheromone to shorter tours, which can be e+pressed below
- j , i , - ) , - j , i ,

+ L5.7
where is the distance of the globally best tour from the beginning of the trial and
2 ) > 1
is the pheromone decay parameter. This rule is intended to ma"e the
search more directedS therefore, the capability of finding the optimal solution can be
enhanced through this rule in the problem solving process.
7.7. Co()utationa& )rocedures o. t*e )ro)osed (et*od
The solution process begins with encoding parameters. . tie(switch ,T:- and
some sectionalizing switches with the feeders form a loop. . particular switch of
each loop is selected to open to ma"e the loop radial such that the selected switch
naturally becomes a tie switch. The networ" reconfiguration problem is identical to
the problem of selecting an appropriate tie switch for each loop to minimize the
power loss. . coding scheme 13>2 that recognizes the positions of the tie switches is
proposed. The total number of tie switches is "ept constant, regardless of any
change in the system%s topology or the tie switches% positions. Big.5.) shows an
individual that is composed of tie switches% positions. *ifferent switches from a
loop are, respectively, selected for cutting the loop circuit and trying to become a tie
switch. .fter each loop is made radial, a configuration is proposed. The fitness
value ,defined as the system loss- associated with this proposed configurations is
determined using Cqn.3.7. Binally, the best one among the proposed configurations
is selected, and which is a feasible solution ,radial configuration- with minimum
The fitness function ,Total real power loss- to be minimized is as follows

) j
@oss loss T,
- j , P min P min min f
where $nb% is the total number of branches in the system. Big.5.3 shows a flowchart
of the main computational procedures. The proposed method mainly involves power
loss computation using Cqn.3.7, bus voltage determination using Cqn.3.4 and ./:.
application. The computation finds configurations with various states of switches so
that the value of the objective function is successively reduced.
Tie switch no.) Tie switch no.3 . . . . Tie switch no. $n%
i+ure.7.1 co()osition o. an individua&
The main computational processes are briefly stated below.
#te) 1 2Initiation- .t first, the colonies of ants are randomly selected which
estimated the initial fitness in the different permutations. . random number
generator can be employed to generate the number of ants within the
feasible search space. In addition, these ants are positioned on different
nodes while the initial pheromone value of >

is also given at this step.

#te) 2 2Cstimation of the fitness- In this step, the fitness of the ants, which is
defined as the objective function, is estimated. Then, the pheromone can be
added to the particular direction in which the ants have chosen. .t this
stage, a roulette selection algorithm can be employed based on the
computed fitness. Then, by spinning this designated roulette, a new
permutation of pheromone associated with different paths is formed. In
other words, based on a roulette selection method, a path ,fitness- with
higher amount of pheromone will be easy to find a new path. Hence, it
would be more suitable for guiding the ants to the direction.
#te) 0 2.nt reconfiguration- The ant%s reconfigurations are based on the level of
pheromone and distance. .s Cqn.5.5 shows, each ant selects the ne+t node
to move ta"ing into account
- j , i ,
- j , i ,
values. . greater
- j , i ,

means that there has been a lot of traffic on this edgeS hence, it is more
desirable to approach the optimal solution. 0n the other hand, a greater
- j , i ,
indicates that the closer node should be chosen with a higher
probability. In the networ" reconfiguration study, this can be seen as the
difference between the original total power loss and the new total power
loss. Therefore, in this step, the ant reconfiguration process helps convey
ants by selecting directions based on these two parameters.
#te) 7 2@ocalTglobal updating rule- ;hile constructing a solution of the networ"
reconfiguration problem, ants visit edges and change their pheromone level
by applying the local updating rule of Cqn.5.F. Its purpose is not only
broadening the search space, but dynamically increasing the diversity of ant
colony. .fter n iterations, all ants have completed a tourS the pheromone
level is updated by applying the global updating rule of Cqn.5.7 for the trail
which belongs to the best selected path. Therefore, according to this rule,
the shortest path found by the ants is allowed to update its pheromone, also
this shortest path will be saved as a record for the later comparison with the
succeeding iteration.
#te) < 2Termination of the algorithm- Cnd the process if &the ma+imum iteration
number is reached' or &all ants have selected the same tour' is satisfiedS
otherwise, repeat the outer loop. In addition, the number of ants and the
number of iterations were e+perimentally determined. .ll the tours visited
by ants in each iteration should be evaluated. If a better path found in the
process, it will be saved for later reference.
7.< &o' c*art o. Ant co&ony searc* a&+orit*(
Aead line and load
:olve feeder flow for the system, compute its
fitness to determine its initial power loss
Aandom selection of ant initiation
.pplying state transition rule and using roulette
wheel a new permutation of pheromone associated
with different paths is formed
.pply local pheromone updating rule
:olve feeder flow and determine system
power loss
Gpdate pheromone using global
updating rule
Termination of
the algorithm
Proceed to ne+t generation
i+.7.2 &o'c*art o. Ant co&ony searc* a&+orit*(
7.- I()rove(ent o. conver+ence c*aracteristics o. net'or8
recon.i+uration usin+ &ine contro& strate+y
The simplicity of the proposed methodology ma"es it suitable for an on(line control
strategy for feeder loss reduction. The strategy for selecting the best switching
option is further e+plained via the e+ample system of Big.5.3.
To maintain continuous power supply to all the loads and to improve convergence
characteristics, the following set of rules to be adopted for selection of switches.
Aule) .ll switches those do not belong to any loop are to be closed.
Aule3 .ll switches connected to the sources are to be closed.
Aule4 :ectionalizing switches, those lie on @K side ,from load flow- of the tie
switches, are ta"en as opening options of the initial configuration.
;hen closing the tie switch F, five options for opening sectionalizing
switches ), 3, <, 9 and 7 are available. Brom load flow results
:ectionalizing :witch
Tie :witch
@oad /enter
Beeder ) Beeder 3 Beeder 4
) 3 4
)F )7
i+.7.2, IEEE 1- $us #yste(
) , 3 !ode number
), 3,. . . . Branch number
)) F 5)
transferring loads on Beeder() to Beeder(3 is e+pected to increase
losses. /onsequently, from rule 3 opening the sectionalizing switch ) or 3 are
regarded as undesirable and need not be considered. Therefore, associated with
closing the tie switch F are three candidate options, viz., opening the sectionalizing
switches <, 9 and 7, respectively. :imilarly, for switch )), opening
switch )3 or )5 is considered to be undesirable when the tie switch )) is closed.
Bor a similar reason, transferring loads on Beeder(4 to Beeder() when the tie switch
)7 is closed, it is e+pected to increase lossesS consequently the corresponding
switching options are eliminated from further consideration.
7.; Load /a&ancin+
*istribution lines or line sections show different characteristics as each has a
different mi+ture of residential, commercial and industrial type loads and their
corresponding pea" times are not coincident. This is due to the fact that some parts
of the distribution system becomes heavily loaded at certain times of the day and
less loaded at other times. Therefore, by shifting the loads in the system, the radial
structure of the distribution feeders can be modified from time to time in order to
reschedule the load currents more efficiently for loss minimization. *uring normal
operating condition, networ"s are reconfigured for two purposes ,i- to minimize the
system real power losses in the networ" and to increase networ" reliability, ,ii- to
relieve the over loads in the feeders. The former is referred to as feeder
reconfiguration for loss reduction and the latter as load balancing.
7.;.1 or(u&ation o. Load $a&ancin+ Pro/&e(
.n objective function for load balancing is presented which consists of two
components. 0ne is the branch load balancing inde+ and the other is the system load
balancing inde+. Branch load inde+ ,@B
- is defined as a measure of how much a
branch can be loaded without e+ceeding the rated capacity of that branch. The
objective is to optimize the branch load indices so that the system load(balancing
)) F
K R K )> )5
inde+ is minimized. In other words, all the branch load balancing indices are set to
be more or less the same value and are also nearly equal to the system load
balancing inde+.
The load(balancing problem is formulated in the form of branch load
balancing and system load balancing indices are
The branch load balancing inde+

- i ,
- i ,
- i ,

The system load balancing inde+

) nb
) i
- i ,
- i ,
;here, nb is the total number of branches in the system.
The system load(balancing inde+ will be minimized when the branch load
indices are optimized by rescheduling the loads. In effect, all the branch load(
balancing indices, @B
are made appro+imately made equal to each other and closely
appro+imately equal to each other and also closely appro+imate to the system load
balancing inde+, @B
Aepresenting mathematically,

) nb
) i
- i ,
- i ,
In realization of the objective function, the following conditions are ta"en into
,i- The system loss must be minimized.
,ii- The voltage magnitude of each node must be within a permissible range,
i i
The condition of a branch will become critical when the load balancing
inde+, @B
of that branch is equal to ) and the branch rated capacity will be
e+ceeded if it is greater than ). If the system is lightly loaded, the system load
balancing inde+, @B
will be low and its value will be closer to zero, and the
individual branch load balancing indices will also be low. If the loads are not
balanced ,unbalanced- in the system, the load(balancing indices of individual
branches will differ widely, whereas, the balanced load will ma"e the load(
balancing indices of all the branches nearly equal. It is not practically possible to
ma"e all the branch load(balancing indices, @B
e+actly equal. However, it is
possible that by rescheduling the loads or reconfiguring the feeder the load(
balancing indices of the branches will be adjusted, and hence the load balancing in
the overall system improved.
Resu&ts and Ana&ysis
The effectiveness of the proposed algorithm is illustrated using three
e+amples consisting of ICCC )7 bus radial distribution system, ICCC 44 bus system
for reconfiguration for loss reduction and ICCC 7< bus system for load balancing.
<.1. E@a()&e 1, IEEE 1- /us Radia& distri/ution syste(
The ant colony search algorithm is tested for loss reduction using networ"
reconfiguration on ICCC )7 bus radial distribution networ". The data of this system
is given in .ppendi+(..
.nt colony search algorithm and =enetic algorithm are repeatedly run for
)>> times and the best, worst and average computation results are tabulated in
Table.F.3. Brom the computational results it is observed that both =enetic algorithm
and .nt colony search algorithm have the same best results, however the average
loss reduction for ./:. is higher than =.1)72. #inimum voltage before
reconfiguration is >.<7<38 p.u with a voltage regulation of 4.>84U and after
reconfiguration is >.<8)F9 p.u with voltage regulation of 3.953U.
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16
Bus number



Voltage after reconfguraton
Voltage befor reconfguraton
i+.<.2, 1o&ta+e )ro.i&e o. IEEE1- /us syste( /e.ore and a.ter recon.i+uration
Beeder ) Beeder 3 Beeder 4
) 3 4
)F )7
:ectionalizing :witch
Tie :witch
@oad /enter
i+ <.1, IEEE 1- $us #yste( a.ter recon.i+uration
5 10 15 20 25 30

Convergence characteristics for different number of Ants
3 Ants
6 Ants
9 Ants
i+.<.0, Conver+ence c*aracteristics o. AC# a&+orit*( 'it* di..erent nu(/er
o. Ants
Brom Big.F.4 it is observed that as the number of ants increases convergence of
algorithm improved. ;ith 4, 7, < ants ./: algorithm converged to final solution at
, F
and 4
iteration respectively in a random trail run of the algorithm.
0 5 10 15 20 25 30
It erat i ons

c onvergenc e Charac t eri s t i c s wi t h/ wit hout li ne c ont rol s t rat egy
wi t hout l ine c ont rol s t rat egy
wi t h l i ne c ont rol s t rat egy
i+.<.7, conver+ence c*aracteristic o. IEEE 1- /us syste( 'it* and 'it*out
i()&e(entation o. &ine contro& strate+y e@)&ained in section 27.<4
Bor )7 bus radial distribution system, the number of candidate switch option
for loop ), loop3 and loop4 are four, three and five respectively. This leads to total
combinations of si+ty. ;ith the concept of line control strategy applied for the
problem the switching options decreased with three, two and three switch in loop),
loop3 and loop4 respectively with total combination of )9. Hence with the
application of line control strategy as e+plained in section ,5.F-, convergence time is
drastically improved. Brom Big.F.5 it can be seen that without line control strategy
convergence occurred at )F
iteration where as with the strategy convergence
reached at F
iteration. The result obtained is for a random run of the program.
<.2 E@a()&e 2, IEEE 00 /us Radia& distri/ution syste(
The ant colony search algorithm is tested for loss reduction using networ"
reconfiguration on ICCC 44 bus radial distribution networ". The data for ICCC
radial distribution system is given in .ppendi+(B.
Ta/&e.<.1. 1o&ta+es o. /uses o/tained /e.ore and a.ter recon.i+uration
) ) )
3 >.<<8>3 >.<<8>8 )9 ?.=10?7 >.<587)
4 >.<93<4 >.<97<< )< >.<<75< >.<<F>9
5 >.<8F5F >.<9358 3> >.<<3<3 >.<8944
F >.<79>F >.<89)F 3) >.<<33) >.<8484
7 >.<5<7F >.<784) 33 >.<<)F8 >.<8>38
8 >.<57)7 >.<7778 34 >.<8<45 >.<945)
9 >.<5)43 >.<7384 35 >.<8378 >.<8788
< >.<4F>F >.<F<47 3F >.<7<4F >.<8457
)> >.<3<34 >.<7395 37 >.<5883 >.<7FF4
)) >.<3948 >.<73<> 38 >.<5F)F >.<74)8
)3 >.<3798 >.<743> 39 >.<448) >.<F37F
)4 >.<3>83 >.<7>7> 3< >.<3FF> >.<5F)3
)5 >.<)957 >.<F<9) 4> >.<3)<5 >.<5)<)
)F >.<)8>5 >.<F44) 4) >.<)889 >.<495<
)7 >.<)F79 >.<F)FF 43 >.<)797 ?.=0;>1
)8 >.<)47F >.<5974 44 >.<)7F9 >.<5839
0 5 10 15 20 25 30
Node number



Voltage profile for IEEE 33 bus system
Node Voltage
after reconfiguration
Node voltage
before reconfiguration
i+.<.< variation o. node vo&ta+e /e.ore and a.ter a))&ication o. recon.i+uration
.or 00 node radia& distri/ution syste(
0 10 20 30 40 50 60 70 80 90 100

Convergence characteristics with/without line control strategy
without line control strategy
with line control strategy
i+.<.- conver+ence c*aracteristic .or 00 node syste( 'it* and 'it*out &ine
contro& strate+y
<.0 E@a()&e 0, IEEE -= radia& distri/ution syste(
The ant colony search algorithm is tested for load balancing using networ"
reconfiguration on ICCC 7< bus radial distribution networ".
Ta/&e.<.2 1o&ta+e )ro.i&e /e.ore and a.ter recon.i+uration .or &oad /a&ancin+
<.7 #u((ary o. resu&ts
Bor reconfiguration of distribution system for loss reduction
Ta/&e <.0 Resu&ts .or 1- /us syste(
0riginal .fter reconfiguration
) ) ) 47 >.<<<<3 >.<<<97
3 >.<<<<8 >.<<<<8 48 >.<<<8F >.<<999
4 >.<<<<4 >.<<<<4 49 >.<<<F< >.<<894
5 >.<<<95 >.<<<97 4< >.<<<F5 >.<<8F3
F >.<<<>3 >.<<<89 5> >.<<<F5 >.<<8F)
7 >.<<>>9 >.<<9<3 5) >.<<995 >.<<>73
8 >.<9>89 >.<<9>4 53 >.<<9FF >.<987<
9 >.<88<8 >.<<89> 54 >.<<9F) >.<984)
< >.<8774 >.<<885 55 >.<<9F> >.<9839
)> >.<8)74 >.<<8F8 5F >.<<95) >.<97<8
)) >.<8>F4 >.<9534 57 >.<<95> >.<97<7
)3 >.<7847 >.<93>9 58 >.<<<8< >.<<<8>
)4 >.<7554 >.<9>F< 59 >.<<9F5 >.<<F9>
)5 >.<7)F4 >.<9F)3 5< >.<<58> >.<93<7
)F >.<F977 >.<9F)< F> >.<<5)F >.<8<99
)7 >.<F9)4 >.<95<5 F) >.<88<5 >.<<887
)8 >.<F835 >.<957> F3 >.<88<4 >.<<88F
)9 >.<F834 >.<95F< F4 >.<8495 >.<<877
)< >.<F788 >.<95F< F5 >.<8>7> >.<<8F8
3> >.<F758 >.<95F< FF >.<77)3 >.<<8F)
3) >.<FF<< >.<8<75 F7 >.<7)8F >.<<8F)
33 >.<FF<9 >.<8<74 F8 >.<4<3F >.<<8F)
34 >.<FF<) >.<8<F7 F9 >.<39)9 >.<5)75
35 >.<FF8F >.<8<5) F< >.<34<> >.<5)75
3F >.<FFF9 >.<8<35 7> >.<)998 >.<478)
37 >.<FFF) >.<8<)9 7) >.<))58 >.<3<5F
38 >.<FF5< >.<8<)7 73 >.<)))9 >.<3<)7
39 >.<<<<4 >.<<<<4 74 >.<)>8< >.<3989
3< >.<<<9F >.<<<9F 75 >.<>99< >.<37<3
4> >.<<<84 >.<<<84 7F ?.=?>01 ?.=2-0<
4) >.<<<8) >.<<<8) 77 >.<8>58 >.<95)8
43 >.<<<7> >.<<<7> 78 >.<8>58 >.<95)8
44 >.<<<4F >.<<<4F 79 >.<78>4 >.<9)8F
45 >.<<<>) >.<<<>) 7< >.<78>4 >.<9)8F
4F >.<<9<F >.<<9<F
.nt colony search
.nt colony
Tie switches F,)),)7 <,8,)7 <,8,)7 <,8,)7
Power loss
577.)377 577.)377 577.)377
;orst F)).54F7 5<4.)F53 5<3.9433
.verage 594.>559 579.93)9 578.)>F3
.verage loss
reduction ,U-
( F.F557 9.43F9 9.77)F
!o. of
( 3 3 3
!o. of times
best solution
( 5> 94 <7
e+ecution time
( 3.>37< >.48<7F> >.453><>
Ta/&e <.7 Resu&ts .or 00 /us syste(
.fter reconfiguration
.nt colony
search algorithm #odified
.nt colony
Tie switches
44, 45, 4F, 47,
8, )>, )5, 39,
8, <, )5, 39, 43 8, <, )5, 43, 48
Power loss
)5>.8)4> )4<.<9F4 )4<.FF9F
;orst )F7.5<)4 )77.))<) )5).3))4
)54.<>74 )4<.<F57
.verage loss
reduction ,U-
( 38.))89 3<.>>88 4>.<F8)
!o. of
( F F 5
!o. of times
best solution
( )5 4) 77
e+ecution time
9.FF)3>3 8.<<FF>> 8.8)<)>>
Ta/&e <.<Resu&ts .or -= /us syste(
.fter reconfiguration
.nt colony
search algorithm
.nt colony
search algorithm
Tie switches
7<, 8>, 8), 83,
)>, )5, )F, 3F,
)>, )4, 3>, 35,
)>, )4, 3>, F8,
inde+ ,@B
>.F9<F >.F8>3 >.F8>>
;orst >.75<) >.F839 >.F8>5
.verage >.7)98 >.F8>7 >.F8>>
.verage @B
reduction ,U-
( 45.5F)8 4<.F577 4<.7>83
!o. of
( F F 5
!o. of times
best solution
( )5 47 F9
e+ecution time
34.)5F3>> )<.)597>> )F.<)4<>>
-.1 Conc&usions
In this thesis, an .nt /olony :earch .lgorithm ,./:.- was applied to
distribution system for loss reduction and load balancing using networ"
reconfiguration and the results are compared with the results of =enetic .lgorithm
,=.-. The computational results showed that the ant colony search algorithm is
better than the genetic algorithm. Aesults further confirmed that the ./:. method
can more efficiently search the optimal or near(optimal solution for networ"
reconfiguration problems and it is the best in the average solution as well as the
average /PG time. The proposed method is helpful for operating e+isting systems
and planning future systems.
-.2 uture sco)e o. 'or8
#ost of the distribution system optimization methods involve complicated
combinatorial, non(differentiable and constraint optimization which can be easily
solved using .nt colony :earch algorithm.
The ./:. can be applied for capacitor placement and sizing in distribution
/onductor size and type for minimizing the total annual investment in
distribution system can be solved using ./:..
). :. /ivanlar, D. D. =rainger, H. Vin, and :. :. H. @ee, &*istribution feeder
reconfiguration for loss reduction,' ICCC Trans. Power *elivery, vol. 4, pp.
)3)86)334, Duly )<99.
3. #. C. Baran and B. B.;u, &!etwor" reconfiguration in distribution systems
for loss reduction and load balancing,' ICCC Trans. Power *elivery, vol. 5,
pp. )5>)6)5>8, .pr. )<9<.
4. ?. !ara, .. :hiose, #. ?itagawoa, and T. Ishihara, &Implementation of
genetic algorithm for distribution systems loss minimum reconfiguration,'
ICCC Trans. Power :yst, vol. 8, pp. )>556)>F), .ug. )<<3.
5. :. ?. =oswami and :. ?. Basu, &. new algorithm for the reconfiguration of
distribution feeders for loss minimization,' ICCC Trans. Power *elivery, vol.
8, pp. )5956)5<), Duly )<<3.
F. *. :hirmohammadi and H. ;. Hong, &Aeconfiguration of electric
distribution networ"s for resistive line loss reduction,' ICCC Trans. Power
*elivery, vol. 5, pp. )5<36)5<9, .pr. )<9<.
7. T. P. ;agner, .. V. /hi"hani, and A. Hac"am, &Beeder reconfiguration for
loss reduction .n application of distribution automation,' ICCC Trans.
Power *elivery, vol. 7, pp. )<336)<4), 0ct. )<<).
8. H. /. /heng and /. /. ?ou, &!etwor" reconfiguration in distribution
systems using simulated annealing,' Clect. Power :yst. Aes., vol. 3<, pp.
3386349, #ay )<<5.
9. H. *. /hiang and D. D. Aene, &0ptimal networ" reconfiguration in
distribution systemsWPart ) . new formulation and a solution
methodology,' ICCC Trans. Power *elivery, vol. F, pp. )<>36)<>9, !ov.
<. ?ashem #... #oghavvemi #. &#a+imizing radial voltages stability and
load balancing via loss minimization in distribution networ"s'. ICC
Proceedings international conference Cnergy #anagement Power *elivery
,C#P*%<9-, :ingapore, #arch )<<9, pp 4(F.
)>. Peponis =, Papadopoulos #. &.pplication of heuristic methods on large
scale networ"s. ICC Proceedings In ( =eneration, Transmission and
*istribution, )<<F, vol )53,7-, pp 74)(749.
)). ?ashem #., =anapathy K, Dasmon =B. &!etwor" reconfiguration for load
balancing in distribution networ"s. ICC Proc(=eneration, Transmission and
*istribution )<<<, vol )57,7-).
)3. ;hei(#in @in, Hong(/han /hin. &. current inde+ based load balancing
technique for distribution systems'. Proceedings international conference on
Power :ystems Technology ,P0;CA /0!%<9-, vol ), pp 334(338.
)4. B.A.!. #.C., and ;G, B.B. X0ptimal sling of capacitors placed on a
radial distribution systemQ, ICCC Trans., )<9<, P;A*(3, pp. 84F(854.
)5. /H.!=. H.*. Q. decoupled load flow method for distribution power
networ" algorithms, analysis and convergence studyQ, Clectr Power Cnergy
:yst., )<<), )4 ,4-, pp. )4>()49.
)F. D.:#0!. =.B., and @CC, @.H././. Q*istribution networ" reduction for
voltage stability analysis and load flow calculationsQ, Clectr. Power Cnergy
syst. )<<), )4 ,)-, pp <()4.
)7. *.:, *., !.=I, H.:. and ?0TH.AI, *.P. Q:tability of load flow
techniques for distribution networ"sQ, ICC Proc. /, )<<5, )5), ,5-, pp. 3<)(
)8. *.:, *., ?0TH.AI, *.P., and ?.@.#, .. Q:imple and efficient method
for load flow solution of radial distribution systemsQ, Clectr. Power Cnergy
:yst., )<<F, )8, ,F-, pp.44F(457.
)9. #arco *origo, @uca #aria =ambardella, &.nt /olony :ystem .
/ooperative @earning .pproach to the Traveling :alesman Problem', ICCC
Transactions 0n Cvolutionary /omputation, vol. ), no. ), .pril )<<8
)<. /hing(Tzong :u, /hung(Bu /hang, Di(Pyng /hiou, &*istribution networ"
reconfiguration for loss reduction by ant colony search algorithm', Clectric
Power :ystems Aesearch, #ay 3>>F.
3>. /hing(Tzong :u, /hu(:heng @ee, &!etwor" Aeconfiguration of *istribution
:ystems Gsing Improved #i+ed(Integer Hybrid *ifferential Cvolution',
ICCC transactions on power delivery, Kol. )9, no. 4, Duly 3>>4.
3). #arco *origo, Kittorio #aniezzo, and .lberto /olorni, &.nt :ystem
0ptimization by a /olony of /ooperating .gents', ICCC transactions on
systems, man, and cybernetics(part(B cybernetics, Kol 37, no ), Bebruary
Ta/&e A-1, Line3 &oad and tie s'itc* data o. IEEE-1- node net'or8

end node
end node
2 4
2 4
End node
) ) 5 >.><858> >.)3<<7> 3.>> ).7> >.>
3 5 F >.)>4<79 >.)53<F7 4.>> ).F> ).)
4 5 7 >.))7<75 >.344<39 3.>> >.9> ).3
5 7 8 >.>F)<95 >.>F)<95 ).F> ).3> >.>
F 3 9 >.)53<F7 >.)53<F7 5.>> 3.8> >.>
7 9 < >.)>4<79 >.)53<F7 F.>> 4.>> ).3
8 9 )> >.)53<F7 >.)53<F7 ).>> >.<> >.>
9 < )) >.)53<F7 >.)53<F7 >.7> >.)> >.7
< < )3 >.)>4<79 >.)53<F7 5.F> 3.>> 4.8
)> 4 )4 >.)53<F7 >.)53<F7 ).>> >.<> >.>
)) )4 )5 >.))7<75 >.)FF<F3 ).>> >.8> ).9
)3 )4 )F >.)53<F7 >.)53<F7 ).>> >.<> >.>
)4 )F )7 >.>F)<95 >.>F)<95 3.)> ).>> ).9
Tie s'itc*es data
)5 F )) >.>F)<95 >.>F)<95 ( (
)F )> )5 >.>F)<95 >.>F)<95 ( (
)7 8 )7 >.)FF<F3 >.)FF<F3 ( (
$ase "1A, 1?? $ase B1, 20.??
Ta/&e A-2, Line3 &oad and tie s'itc* data o. 00-node net'or8
end node
end node
2 4
2 4
Rea& )o'er
) ) 3 >.><33 >.>58> )>>.>> 7>.>>
3 3 4 >.5<4> >.3F)) <>.>> 5>.>>
4 4 5 >.477> >.)975 )3>.>> 9>.>>
5 5 F >.49)) >.)<5) 7>.>> 4>.>>
F F 7 >.9)<> >.8>8> 7>.>> 3>.>>
7 7 8 >.)983 >.7)99 3>>.>> )>>.>>
8 8 9 >.8))5 >.34F) 3>>.>> )>>.>>
9 9 < ).>4>> >.85>> 7>.>> 3>.>>
< < )> ).>55> >.85>> 7>.>> 3>.>>
)> )> )) >.)<77 >.>7F> 5F.>> 4>.>>
)) )) )3 >.4855 >.)349 7>.>> 4F.>>
)3 )3 )4 ).579> ).)FF> 7>.>> 4F.>>
)4 )4 )5 >.F5)7 >.8)3< )3>.>> 9>.>>
)5 )5 )F >.F<)> >.F37> 7>.>> )>.>>
)F )F )7 >.8574 >.F5F> 7>.>> 3>.>>
)7 )7 )8 ).39<> ).83)> 7>.>> 3>.>>
)8 )8 )9 >.843> >.F85> <>.>> 5>.>>
)9 3 )< >.)75> >.)F7F <>.>> 5>.>>
)< )< 3> ).F>53 ).4FF5 <>.>> 5>.>>
3> 3> 3) >.5><F >.5895 <>.>> 5>.>>
3) 3) 33 >.8>9< >.<484 <>.>> 5>.>>
33 4 34 >.5F)3 >.4>94 <>.>> F>.>>
34 34 35 >.9<9> >.8><) 53>.>> 3>>.>>
35 35 3F >.9<7> >.8>)) 53>.>> 3>>.>>
3F 7 37 >.3>4> >.)>45 7>.>> 3F.>>
37 37 38 >.3953 >.)558 7>.>> 3F.>>
38 38 39 ).>F<> >.<448 7>.>> 3>.>>
39 39 3< >.9>53 >.8>>7 )3>.>> 8>.>>
3< 3< 4> >.F>8F >.3F9F 3>>.>> 7>>.>>
4> 4> 4) >.<855 >.<74> )F>.>> 8>.>>
4) 4) 43 >.4)>F >.47)< 3)>.>> )>>.>>
43 43 44 >.45)> >.F4>3 7>.>> 5>.>>
Tie-s'itc*es data
44 9 3) 3.>>>> 3.>>>> ( (
45 < )F 3.>>>> 3.>>>> ( (
4F )3 33 3.>>>> 3.>>>> ( (
47 )9 44 >.F>>> >.F>>> ( (
48 3F 3< >.F>>> >.F>>> ( (
$ase "1A, 1?? B1C 12.--
Ta/&e A-0, Line3 &oad and tie s'itc* data o. -=-node radia& distri/ution
end node
2 4
2 4
) ) 3 >.>>>F >.>>)3 >.>> >.>> )8<>7
3 3 4 >.>>>F >.>>)3 >.>> >.>> )8<>7
4 4 5 >.>>)F >.>>47 >.>> >.>> )>448
5 5 F >.>3F) >.>3<5 >.>> >.>> 3F38
F F 7 >.477> >.)975 3.7> 3.3> 773
7 7 8 >.49)) >.)<5) 5>.5> 4>.>> 75<
8 8 9 >.><33 >.>58> 8F.>> F5.>> )4)<
9 9 < >.>5<4 >.>3F) 4>.>> 33.>> )9>4
< < )> >.9)<> >.38>8 39.>> )<.>> 553
)> )> )) >.)983 >.>7)< )5F.>> )>5.>> <3F
)) )) )3 >.8))5 >.34F) )5F.>> )>5.>> 58F
)3 )3 )4 ).>4>> >.45>> 9.>> F.F> 4<F
)4 )4 )5 ).>55> >.45F> 9.>> F.F> 4<3
)5 )5 )F ).>F9> >.45<7 >.>> >.>> 49<
)F )F )7 >.)<77 >.>7F> 5F.F> 4>.>> <>4
)7 )7 )8 >.4855 >.)349 7>.>> 4F.>> 7F5
)8 )8 )9 >.>>58 >.>>)7 7>.>> 4F.>> F95>
)9 )9 )< >.4387 >.)>94 >.>> >.>> 8>>
)< )< 3> >.3)>7 >.>7<7 ).>> >.7> 983
3> 3> 3) >.45)7 >.))3< ))5.>> 9).>> 79F
3) 3) 33 >.>)5> >.>>57 F.4> 4.F> 4495
33 33 34 >.)F<) >.>F37 >.>> >.>> )>>5
34 34 35 >.4574 >.))5F 39.> 3>.>> 79>
35 35 3F >.8599 >.358F >.>> >.>> 574
3F 3F 37 >.4>9< >.)>3) )5.>> )>.>> 83>
37 37 38 >.)843 >.>F83 )5.>> )>.>> <73
38 4 39 >.>>55 >.>)>9 37.>> )9.7> 7>4F
39 39 3< >.>75> >.)F7F 37.>> )9.7> )F94
3< 3< 4> >.4<89 >.)4)F >.>> >.>> 74F
4> 4> 4) >.>8>3 >.>343 >.>> >.>> )F))
4) 4) 43 >.4F)> >.))7> >.>> >.>> 787
43 43 44 >.94<> >.39)7 )5.>> )>.>> 548
44 44 45 ).8>9> >.F757 )<.F> )5.>> 4>7
45 45 4F ).585> >.5984 7.>> 5.>> 44>
4F 4 47 >.>>55 >.>)>9 37.>> )9.FF 7>4F
47 47 48 >.>75> >.)F7F 37.>> )9.FF )F94
48 48 49 >.)>F4 >.)34> >.>> >.>> )345
49 49 4< >.>4>5 >.>4FF 35.>> )8.>> 33<7
4< 4< 5> >.>>)9 >.>>3) 35.>> )8.>> <547
5> 5> 5) >.8394 >.9F>< ).3> ).>> 57<
5) 5) 53 >.4)>> >.4734 >.>> >.>> 8)<
53 53 54 >.>5)> >.>589 7.>> 5.4> )<88
54 54 55 >.>><3 >.>))7 >.>> >.>> 5)85
55 55 5F >.)>9< >.)484 4<.33 37.4> )3)4
5F 5F 57 >.>>>< >.>>)3 4<.33 37.4> )445F
57 5 58 >.>>45 >.>>95 >.>> >.>> 7977
58 58 59 >.>9F) >.3>94 8<.>> F7.5> )483
59 59 5< >.39<9 >.8><) 495.8> 385.F> 855
5< 5< F> >.>933 >.3>)) 495.8> 385.F> )4<7
F> 9 F) >.><39 >.>584 5>.F> 39.4> )4)5
F) F) F3 >.44)< >.)))5 4.7> 3.8> 7<F
F3 < F4 >.)85> >.>997 5.4F 4.F> <7>
F4 F4 F5 >.3>4> >.)>45 37.5> )<.>> 99<
F5 F5 FF >.3953 >.)558 35.5> )8.3> 8F)
FF FF F7 >.39)4 >.)544 >.>> >.>> 8FF
F7 F7 F8 ).F<>> >.F448 >.>> >.>> 4)9
F8 F8 F9 >.8948 >.374> >.>> >.>> 5F3
F9 F9 F< >.4>53 >.)>>7 )>>.>> 83.>> 837
F< F< 7> >.497) >.))83 >.>> >.>> 755
7> 7> 7) >.F>8F >.3F9F )355.>> 999.>> F73
7) 7) 73 >.><85 >.>5<7 43.>> 34.>> )394
73 73 74 >.)5F> >.>849 >.>> >.>> )>F)
74 74 75 >.8)>F >.47)< 338.>> )73.>> 58F
75 75 7F ).>5)> >.F4>3 F<.>> 53.>> 4<3
7F )) 77 >.3>)3 >.>7)) )9.>> )4.>> 9<4
77 77 78 >.>>58 >.>>)5 )9.>> )4.>> F95>
78 )3 79 >.84<5 >.3555 39.>> 3>.>> 577
79 79 7< >.>>58 >.>>)7 39.>> 3>.>> F95>
Tie s'itc* data
7< )) 54 >.F >.F ( ( F77
8> )4 3) >.F >.F ( ( F77
8) )F 57 ).> >.F ( ( 5>>
83 F> F< 3.> ).> ( ( 394
84 38 7F ).> >.F ( ( 5>>
$ase "1A, 1?? $ase B1, 12.--