before switch’s triggered to simplify the analysis. So
this work performed a more realistic reliability
analysis, using this index as objective function of the
MGA.
2.5 Load Importance
Generally, the electric utilities need to prioritize the
service to some consumers due to its special
characteristics, such as: critical loads, big power
consumers, loads with high continuity demanded,
etc. The proposed algorithm has defined a new
variable called load importance (LI), which defines
the importance for the electric utility of each
consumer connected to the feeder. It establishes a
ranking between 0 and 1 (inclusive) for consumers
defined by the electric utility
In order to give preference to the switches
installation in sections situated before and after
priority loads is defined the priority index as
follows:
tot
Ns
i
i
LI
SLI
SPRIORI
=
=
1
)(
)(
(5)
where, LI
tot
is the sum of all LI defined to the feeder;
LI
i
(S) is the sum of LI of all consumers not
interrupted by a fault in section i after service
restoration performed with the operation of switches
installed according S; and PRIORI(S) is the priority
index considering the set S of section switches and
tie switches installed.
This index is used as object function in MGA in
order to evaluate the load importance. Most of the
paper in this field, e. g. Assis et. al. (2012) Falaghi,
Haghifam and Singh (2009) Tippachon and
Rerkpreedapong (2009), Golestani and Tadayon,
(2011) and Ziari et. al., (2009), don’t include this
evaluation on it solution.
3 SOLUTION
In order to find an optimal allocation of switching
devices in distribution networks based on load
priority, reliability, costs, and considering the
simultaneous allocation of MCS and RCS, a multi-
objective algorithm is proposed. MGA is used in the
solution. The simultaneous allocation of MCS and
RCS is considered to calculate reliability index and
costs. Load importance is defined by electric utility.
A weight function based on reliability index, costs
and load importance is used as object function.
3.1 Microgenetic Algorithms
Genetic algorithms are simple, robust, flexible, and
able to find the global optimal solution. They are
especially useful in finding solution to problems for
which other optimization techniques encounter
difficulties (Goldberg, 1989). A basic genetic
algorithm is constituted by a random creation of an
initial population and a cycle of three stages,
namely:
1. evaluation of each chromosome;
2. chromosomes selection for reproduction;
3. genetic manipulation to create a new population,
which includes crossover and mutation.
Each time, this cycle is completed, it is said that a
generation has occurred.
The disadvantage of genetic algorithms is the
high processing time associated. That is due to their
evolutionary concept, based on random processes
that make the algorithm quite slow. However,
different methods for reducing processing time have
already been proposed, such as more appropriate
choice of solution coding and reduction of search
space using the specialist knowledge. One
alternative method known as microgenetic
algorithms, whose processing time is considerably
smaller, is shown in (Delfanti et. al., 2000;
Chakravarty, Mittra and William, 2001).
According to Souza, Alves and Ferreira (2004), most
of the genetic algorithms produce poor results when
populations are small, because insufficient
information is processed about the problem and, as a
consequence, premature convergence to a local
optimum occurs. Population size generally varies
from 30 to 300 individuals. In contrast, microgenetic
algorithms explore the possibility to work with small
populations (from five to 20 individuals usually) in
order to reduce the processing time. From a genetic
point of view, it is known that frequent
reproductions inside a small population may
disseminate hereditary diseases rarely found in large
populations. Therefore, small populations can act as
natural laboratories where desirable genetic
characteristics quickly can emerge. In microgenetic
algorithms, mutations are unnecessary because after
a certain number of generations, the best
chromosome is maintained and the rest are
substituted by randomly generated ones. On the
other hand, it requires adoption of some preventive
strategy against loss of diversity in population.
Basically, two mechanisms are used to prevent
loss of diversity in population (Ongsakul and
Tippayachai, 2002). First, the individuals are