948

IEEE TRANSACTIONS ON POWER SYSTEMS, VOL. 21, NO. 2, MAY 2006

Minimal Loss Reconfiguration Using Genetic

Algorithms With Restricted Population and
Addressed Operators: Real Application
Jorge Mendoza, Student Member, IEEE, Rodrigo Lpez, Student Member, IEEE, Dario Morales, Enrique Lpez,
Philippe Dessante, and Roger Moraga

AbstractThis paper proposes and evaluates a method that

improves the adaptability and efficiency of genetic algorithms
(GAs) when applied to the minimal loss reconfiguration problem.
This research reduces the searching space (population) when a
new codification strategy and novel genetic operators, called accentuated crossover and directed mutation, are used. This allows
a drastic reduction of the computational time and minimizes
the memory requirements, ensuring a efficiency search when
compared to current GA reconfiguration techniques. The reduced
population is created through the branches that form system
loops. This means that almost all individuals created for the GA
are feasible (radial networks) generating topologies that can only
be limited by the systems operational constraints. The results of
the proposed reconfiguration method are compared with other
techniques, yielding smaller or equal power loss values with less
computational efforts.
Index TermsGenetic algorithms (GAs), losses, minimal loss reconfiguration, optimization methods, power distribution.

NOMENCLATURE

FL

b branch resistance.
b branch complex current.
Current vector of branches and maximum current of
branches.
Vector of node currents.
Incidence matrix.
Node voltage.
Node minimum voltage.
Node maximum voltage.
Radial net branch number.
Node number.
Source number.
Fundamental loop.
Total branch number.

Manuscript received May 25, 2005; revised November 3, 2005. This work
was supported by the National Commission for Investigation, Science and Technology of Chile (CONICYT). Paper no. TPWRS-00318-2005.
J. Mendoza and E. Lpez are with the Department of Electrical Engineering,
University of Concepcin, Concepcin, Chile (e-mail: jorgemendoza@udec.cl;
elopez@udec.cl).
R. Lpez is with the Faculty of Law and Economics, University Paris XI,
Paris, France (e-mail: rlopezg@ieee.org).
D. Morales and P. Dessante are with the Dpartement Electrotechnique et
Systmes dEnergie, Suplec, Paris, France (e-mail: dario.morales@supelec.fr;
philippe.dessante@supelec.fr).
R. Moraga is with the Engineering and Odontology School, Desarrollo University, Concepcin, Chile (e-mail: rmoraga@udd.cl).
Digital Object Identifier 10.1109/TPWRS.2006.873124

I. INTRODUCTION

HE reconfiguration of a distribution network is a process

that alters feeder topological structure, changing the
open/close status of sectionalizers and interruptors in the
system. Under normal operational conditions, the objectives are
avoiding excessive transformer load, conductor overheating,
and minimizing abnormal voltages and at the same time
minimizing the active power losses of the system. The first
publication about the reconfiguration problem was presented
by Merlin and Back [1]. In this paper, the global minimum is
calculated starting from a meshed network. This method was
later modified by Shirmohammadi and Hong in [2], where they
reduced computation time by applying an efficient load flow.
Civanlar and Grainger in [3] derived a formula to estimate
loss reduction using an algorithm called branch interchange.
Other heuristic methods have been published that are principally based on switch interchange, sets of rules to determinate
open/close status of sectionalizers, and linearization of the
objective function using approximated formulas for losses
evaluation as those presented in [4] and [5]. In [6], Glamocanin
used quadratic programming to formulate the reconfiguration
problem as a transfer problem with quadratic costs. Sarfi in [7]
proposed an algorithm based on the division of a distribution
network into a groups of feeders. His algorithm used a rapid
heuristic technique for system division, taking into account the
principal ideas proposed by [3] and [8]. McDermott [10] proposed a constructive heuristic method for the reconfiguration of
minimal losses. Lopez in [11] proposes a minimal loss reconfiguration method applied to large distribution systems based
on the dynamic programming approach, graph compression,
and radial load flow. Finally, the same authors in [12] consider
the variability demand in the reconfiguration process.
In the literature, various methods exist that employ artificial
intelligence, among them, genetic algorithms (GAs). This technique bases its search mechanism on the principles of natural
selection for creating a set of feasible solutions (populations).
Holland in [13] was the pioneer in the use of this technique and
since its inception has been applied to a wide variety of optimization problems. The algorithm structure is based in the generation of a population of individuals that represent the solutions
(generation), and then these are evaluated using an objective
function; the individuals that have the greatest aptitude are then
selected. Finally, a new population is created using crossover

0885-8950/$20.00 2006 IEEE

MENDOZA et al.: MINIMAL LOSS RECONFIGURATION USING GAs

and mutation operators. This allows converging to the best solution [14][16].
The first work that applied GA to the reconfiguration problem
was developed in 1992 by Nara [17]. In spite of the excellent
results, the conclusion of this paper and the study developed
by Sarfi [18] pointed out the need for computers with greater
processing speed. The principal trouble presented in [17] is
related to the binary codification used; it identified the arc
(branch) number that contains the th open switch and identifies
the switch that is normally open in this arc. That codification
type can be very long, and it grows in proportion with the
switch number. Also, an approximated fitness function was
used to represent the system power loss.
Nevertheless, the technological advances in computer hardware allow today the application of these methodologies with
greater benefits and fewer limitations in terms of the problem
dimensions and computational times involved in the population
size, number of generations, and objective function evaluation.
In [23], the GA method is refined, in the reconfiguration
problem, by modifying the string structure and fitness function.
Here, a binary string represents only positions of the open
switches in the distribution network. Consequently, the length
of the string is reduced, depending on the number of open
switches. The fitness function also considers constraints of the
systems. An adaptive mutation process is used to change the
mutation probability.
Lopez in [24] made an important contribution to the reconfiguration process using GA, with excellent results in the
simulation times, when introducing graph compression, current
flows analysis, stochastic minimum extension trees, and diakoptic compensatory currents. All of these techniques are used
to simplify the systems model, allowing the evaluation of the
objective function with less computational efforts. Also, a set
of filters is introduced in order to eliminate the individuals that
transgress the system operational constraints (like over currents
and voltage ranges). However, the computational efforts are
still significant due to the generated random population, where
many do not override the radiality and connectivity filters.
In [26], a GA technique is applied to the multiobjective reconfiguration problem. This work used the Prufer number
codification, to avoid a tedious meshed check algorithm. The
crossover is applied in two points randomly selected. The single
point mutation is applied, and the roulette wheel approach is
used to select the rest of the individuals.
The work presented in [27] is the only one that develops a
method to create a feasible population. This method is based on
the concept called path-to-node. This scheme is based on the
preliminary identification of alternative paths linking each bus
to the substation. This path definition creates radial topologies
for the initial population with excellent results but only using
traditional genetic operators.
As a whole, the great majority of the GA applications to the
reconfiguration problem are done using a binary codification
that represents the location and codifications of the switches in
the system. In real systems, the above may result in string that is
too long, decreasing the efficiency in the search for the optimum.
An attempt to solve this problem has been done by developing
new codification strategies (keeping on with a binary line) and

949

by new ways of improving the convergence through the probability of adaptive mutation
For this reason, in this paper, a GA addressed population generation criteria that avoids nonfeasible individuals from a network structure standpoint is used. This changes drastically the
way of using GA in the reconfiguration process. This is based
on the work of Lin in [20], where the switching indexes of the
network were analyzed, to determine the opening of the control
devices.
II. SOLUTION METHOD
A. Minimal System Power Loss Problem
Reconfiguration is encompassed in problems of planning and
operation of primary distribution systems. The principal objective is to find a radial operating structure that minimizes the
system power loss while satisfying operating constraints. The
mathematical formulation for the minimization power loss reconfiguration problems is presented in the literature in different
ways. In this paper, the problems formulation is presented as in
[12]
minimize

(1)

subject to

(2)
(3)
(4)
(5)

Equation (1) corresponds to the objective function to minimize and represent the total power loss of the system. Equation (2) corresponds to the matrix of nodal load current balances. Equation (3) corresponds to feeder thermal limits and to
the maximum capacity of substations. Equation (4) considers
voltage constraints in each node. Equation (5) describes radiality constraints of the primary distribution system.
Up until now, the approach to the reconfiguration problem
using GA relied on the use of filter and/or mechanisms to create
initial populations in order to avoid the evaluation of nonfeasible
individuals. This paper considers the application of system fundamental loops to make decisions about how to create feasible
individuals and overall how to obtain feasible individuals later
to apply the genetic operators.
B. Reconfiguration Using Fundamental Loops
The proposed methodology creates feasible topologies using
topological analysis. It is made to identify the fundamental
closed loops of the system in order to originate radial topologies.
When analyzing meshed networks, the number of fundamental loops (FLs) is
FL

(6)

This (6) also indicates the total number of elements to be

disconnected in a meshed distribution network in order to obtain
the radial topology.

950

IEEE TRANSACTIONS ON POWER SYSTEMS, VOL. 21, NO. 2, MAY 2006

Fig. 2. Individual representation.

Fig. 1. Diagram of a meshed network.

The FLs vectors of a network are defined as an ensemble of

elements that form a closed loop in a circuit that does not contain
any other closed loop. The last one follows the same rules of the
mesh current method applied in the circuit analysis theory. For
Fig. 1, the close loops selected are

1) Codification and Feasible Population: In this paper,

the individuals are represented by a string of whole numbers (chromosome) whose dimension is the total number of
lines to be disconnected from the network. Consequently, the
length of the string is in accordance with the number of the
system loopssee (6). Binary codifications used for the radial
topology shown in Fig. 2 are

Loop
Loop
Loop
In order to create a radial topology, one should select from
the group of fundamental loop vector elements to be disconnected (one for loop). It is important that the vectors elements
are not repeated (or have the same genetic information) in a selected topology. The combination of elements can be generated
with these vectors, creating all possible radial topologies of the
system.
For the system shown in Fig. 1, the total number of feasible
radial topologies, using the proposed method, is 30, while 56
topologies were observed using a random methodology. This is
a great advantage of the proposed method. These considerations
allow the proposed GA to limit the generation of nonfeasible individuals. This also reduces the combinatorial searching space.
C. Genetic Algorithms
GA is a technique based on the Theory of Evolution. It can
be applied to a wide range of engineering problems.
The genetic function principally works at the genotype level,
but they can also function at the phenotype level. The principal
operator is the crossover, and the secondary operator is mutation. The way to select individuals is probabilistically based on
the individual fitness.
The GA methodology structure is as follows:
1) codification of individuals (topologies);
2) generation of a feasible initial population;
3) each individual (solution) evaluated through the fitness
function (system power loss);
4) application of genetic operators;
5) repetition of the third and fourth steps, until reaching the
total number of generations.

The binary codifications for [17], [22], [24], and [25] grows in
proportion with the switch number of the system (furthermore,
when the systems are larger and complex). According to the
codification presented in [23], it clearly reduces the number of
bits used. Nevertheless, if the amount of switch increases, a big
number of bits for the codification may be needed.
In this paper, each position (gene) of the string represents a
randomly selected element of each fundamental loops vector.
proposed method
The main advantage of this codification is based on creating
individuals guided through the fundamental loops vector, allowing to produce radial topologies that, with the nonguided binary codifications, are difficult to achieve
Thus, the individual selection process is done through a probabilistic tournament of uniform distribution [22].
2) Application of Genetic Operators: The great majority of
the GA applications to the reconfiguration problem use the traditional mutation and crossover techniques [17], [21], [22], [24],
[26]. Only in some cases, efforts have been done to do the following:
choose out of traditional crosses the one more suitable for
the reconfiguration problem [19];
develop a process to change the mutation probability [23],
[25].

MENDOZA et al.: MINIMAL LOSS RECONFIGURATION USING GAs

951

Fig. 4. Directed mutation process.

Fig. 3. Accentuated crossover process.

In this paper, new genetic operators are developed, based on

the information that is possible to extract from the fundamental
loops, efficiently guiding the individual reproduction.
The crossover is the principal operator of the GAs. This operator aims at mixing up genetic information coming from two
different individuals (parents), to make a new individual (child).
In the proposed method, the fundamental loops vector was consider as the cross mask. This means that a point of the string is
chosen to interchange genetic information of both parents (as in
the traditional technique) but having in account this cross mask,
so that the genetic information does not repeat. This crossover
type is called accentuated crossover.
If we consider two random parents for the systems showed in
Fig. 1, the methodology to obtain two new children through the
accentuated crossover is show in Fig. 3.
Here, the children number one (Ch1) is nonfeasible because
numbers 5 and 6 are bits that have the same genetic information. (They have familiar lines for the vector loops 2 and 3. This
information was obtained from the fundamental loops vector.)
The mutation operator provides a way to introduce new
information into the knowledge base. This operator randomly
changes one bit in the string, and it is applied with a probability
that has been set in the initialization phase. In this paper, this
operator is applied, taking into account the cross mask to guide
the mutation process, keeping the feasible individuals. This
mutation type was called directed mutation. For example, if
the mutation process indicates to change the Ch2 in the bits 2,
then see Fig. 4 for the result.
At the end of this process, the feasibility of the generated individuals is evaluated using a filter (a remote possibility exists
that a small percentage of individual are not feasible). The individuals, which have passed through the filter, are evaluated
using the power losses function, taking into account the operational constraints. Then, their aptitudes are compared with those
of their parents. Subsequently, the individual with the highest
aptitude is selected. Finally, elitism is used to assure conservation of the best topology. The proposed block diagram of the
methodology is shown in Fig. 5.
In order to determine the total power losses associated to each
topology and to verify the constraints for each feasible system,
a radial load flow algorithm is used for the individual aptitude

Fig. 5.

Proposed method block diagram.

Fig. 6.

Civanlar system topology.

evaluation. The model considers a load of constant power at

each node.
III. APPLICATIONS
In this section, the proposed method is applied to three tested
systems. They are called Civanlar [3], Baran [4], and Lopez
[11]. These are shown in Figs. 68, respectively, and the results
are compared with other references. Also, in order to evaluate

952

IEEE TRANSACTIONS ON POWER SYSTEMS, VOL. 21, NO. 2, MAY 2006

TABLE I
SYSTEM PARAMETERS

TABLE II
RESULTS OF RECONFIGURATION FOR THE PROPOSED METHOD

TABLE III
RESULTS OF RECONFIGURATION FOR OTHER REFERENCES

Fig. 7. Baran system topology.

Fig. 8. Lopez system topology.

the computational efforts, the results from a large real system

are shown.
The algorithm was developed in Matlab, and the simulations
were done on a computer with Pentium IV, 1.6 Ghz, 256 MB
RAM. The most important system parameters are shown in
Table I.
The resultant topologies and power losses, of each system,
are shown in Table II for the proposed method. The topologies
found for this methodology concur with those in [24]. The resultant power losses were less than or equal to those found by
the techniques applied in [1][3], [5], [11], [23], [26], and [27]
(see Table III).
The evolution of the best individual to each assigned generation for the proposed method is shown in Figs. 911, for each
system.

Fig. 9. Evolution GA for Civanlar system.

In the Civanlar system, we can see that the algorithm arrives

to a solution after 12 generations. This corresponds to around
half of the assigned generations.

MENDOZA et al.: MINIMAL LOSS RECONFIGURATION USING GAs

953

TABLE IV
RESULTS OF [24]

TABLE V
RESULTS OF THE PROPOSED METHODOLOGY

Fig. 10.

Evolution gas Baran system.

no special techniques (e.g., graph compression, current flows

and stochastic minimum extension trees, and diakoptics compensatory currents) are used. This represents an advantage due
to its simplicity. GAs have exhibited an excellent adaptability
with a considerable reduction of computational efforts. This encourages the use of GA in reconfiguration problems.
IV. CONCLUSION

Fig. 11.

Evolution gas Lopez system.

When analyzing the system of Baran, the solution quickly

arises to the best individual at the 26th generation. This corresponds to 75% of the total. For the Lopez systems, the algorithm
finds the best individual in the 30th generation. This corresponds
to the 60% of the total generation. This is an acceptable value,
and the solution is considered as a good one.
A comparison of the computational efforts, in accordance
to the population size and generations, between the proposed
methodology and the methodology presented in [24] is shown
in Tables IV and V.
Moreover, it is possible to compare the efforts done by the
GA of the method proposed with those of [26], for the Cinvalar
system. In this case, a population of 85 individuals and around
120 generations is needed to reach a topology that presents
major losses. The same goes for the Baran system [27], which
uses a population of 15 individuals and 47 generations to reach
the same topology solution. However, almost 180 evaluations
are required, which is more than the proposed method.
Consequently, the population size and number generations
are drastically reduced when using the proposed methodology.
For this reason, the computational times decrease, even when

In this paper, a new methodology for minimal loss reconfiguration using GA is presented. This technique is based on
the construction of an initial population of feasible individuals
using the system loops and applying specialized genetic operators of accentuated cross and directed mutation. This reduces
the searching space, analyzing only feasible radial topologies.
The proposed method changes drastically the way of using
GA in the reconfiguration process, allowing the optimal reconfiguration of large distribution systems, with less computational
efforts (minimizing the required memory and CPU time), using
a simple code, and overall improvement of the searching ability.
When a small number of switching elements is considered,
the proposed methodology uses a smaller searching space (eliminating from the fundamental loops vector those lines that do
not have switching elements), simplifying the problem resolution and reducing (even more) the CPU time involved.
Consequently, this paper proposes a formal and robust
strategy for approaching the large minimal loss reconfiguration problems using GA. Better solutions than those attained
through other techniques, such as GA or traditional algorithms,
are found.
REFERENCES
[1] A. Merlin and G. Back, Search for minimum-loss operational spanning
tree configuration for an urban power distribution system, in Proc. Fifth
Power System Conf. (PSCC), Cambridge, U.K., 1975, pp. 118.
[2] D. Shirmohammadi and H. W. Hong, Reconfiguration of electric distribution networks for resistive line losses reduction, IEEE Trans. Power
Del., vol. 4, no. 2, pp. 14921498, Apr. 1989.
[3] S. Civanlar, J. Grainger, H. Yin, and S. Lee, Distribution feeder reconfiguration for loss reduction, IEEE Trans. Power Del., vol. 3, no. 3, pp.
12171223, Jul. 1988.
[4] M. E. Baran and F. Wu, Network reconfiguration in distribution system
for loss reduction and load balancing, IEEE Trans. Power Del., vol. 4,
no. 2, pp. 14011407, Apr. 1989.
[5] S. Goswami and S. Basu, A new for the reconfiguration of distribution
feeders for loss minimization, IEEE Trans. Power Del., vol. 7, no. 3,
pp. 14841491, Jul. 1992.

954

IEEE TRANSACTIONS ON POWER SYSTEMS, VOL. 21, NO. 2, MAY 2006

[6] V. Glamocanin, Optimal loss reduction of distribution networks, IEEE

Trans. Power Syst., vol. 5, no. 3, pp. 774781, Aug. 1990.
[7] R. Srfi, M. Salama, and Y. Chikhani, Distribution system reconfiguration for loss reduction: An algorithm based on network partitioning
theory, IEEE Trans. Power Syst., vol. 11, no. 1, pp. 504510, Feb. 1996.
[8] J. Fan, L. Zhang, and J. McDonald, Distribution network reconfiguration: Single loop optimization, IEEE Trans. Power Syst., vol. 11, no. 3,
pp. 16431647, Aug. 1996.
[9] R. Taleski and D. Rajicic, Distribution networks reconfiguration for
energy loss reduction, IEEE Trans. Power Syst., vol. 12, no. 1, pp.
398406, Feb. 1997.
[10] T. McDermott, I. Drezga, and R. Broadwatwer, A heuristic nonlinear
constructive method for distribution system reconfiguration, IEEE
Trans. Power Syst., vol. 14, no. 2, pp. 478483, May 1999.
[11] E. Lpez, H. Opazo, L. Garcia, and M. Poloujadoff, Minimal loss reconfiguration based on dynamic programming approach: Application to
real systems, Power Compon. Syst., vol. 30, no. 7, pp. 693704, Jul.
2002.
[12] E. Lopez, H. Opazo, L. Garcia, and P. Bastard, Online reconfiguration
considering variability demand: Applications to real networks, IEEE
Trans. Power Syst., vol. 19, no. 1, pp. 549553, Feb. 2004.
[13] J. H. Holland, Adaptive in Nature and Artificial Systems. Ann Arbor,
MI: Univ. Michigan Press, 1975.
[14] D. Goldberg, Genetic Algorithms in Search, Optimization and Machine
Learning. Reading, MA: Addison-Wesley, 1989.
Data Structures
[15] Z. Michalewicz, Genetic Algorithms
Evolution Programs. New York: Springer-Verlag, 1992.
[16] M. Mitchell, An Introduction to Genetic Algorithms. Cambridge, MA:
MIT Press, 1998.
[17] K. Nara, A. Shiose, M. Kitagawa, and T. Ishihara, Implementation of
genetic algorithm for distribution systems loss minimum re-configuration, IEEE Trans. Power Syst., vol. 7, no. 3, pp. 10441051, Aug. 1992.
[18] R. Sarfi, M. Salama, and A. Chikhani, A survey of the state of the art
in distribution system reconfiguration for system loss reduction, Elect.
Power Syst. Res., vol. 31, pp. 6170, 1994.
[19] G. Levitin, S. Mazal-Tov, and D. Elmakis, Genetic algorithm for open
loop distribution system design, Elect. Power Syst. Res., vol. 32, pp.
8187, 1995.
[20] W.-M. Lin and H.-C. Chin, A new approach for distribution feeder reconfiguration for loss reduction and service restoration, IEEE Trans.
Power Del., vol. 13, no. 3, pp. 870875, Jul. 1998.
[21] A. Augugliaro, L. Dusonchet, and E. Riva Sanseverino, Service restoration in compensated distribution networks using a hybrid genetic algorithm, Elect. Power Syst. Res., vol. 46, pp. 5966, 1998.
[22] Y. Hsiao, Enhancement of restoration service in distribution systems
using a combination Fuzzy-GA method, IEEE Trans. Power Syst., vol.
15, no. 4, pp. 13941400, Nov. 2000.
[23] J. Z. Zhu, Optimal reconfiguration of electrical distribution network
using the refined genetic algorithm, Elect. Power Syst. Res., vol. 62,
pp. 3742, 2002.
[24] R. Lpez, E. Lpez, R. Moraga, and H. Opazo, Contributions a la reconfiguration des rseaux de distribution primaire a travers des arbres
stochastiques dextension minimale, des courants diakoptiques et des
Algorithmes gntiques, in Proc. EF2003 SUPELEC, Paris, France,
2003.
[25] D. Shin, J. Kim, T. Kim, J. Choo, and C. Singh, Optimal service
restoration and reconfiguration of network using Genetic-Tabu algorithm, Elect. Power Syst. Res., vol. 71, pp. 145152, 2004.
[26] Y.-Y. Hong and S.-Y. Ho, Determination of network configuration
considering multiobjective in distribution systems using genetic algorithms, IEEE Trans. Power Syst., vol. 20, no. 2, pp. 10621069, May
2005.
[27] E. Romero, A. Gomez, J. Riquelme, and F. LLorens, Path-based distribution network modeling: Application to reconfiguration for loss reduction, IEEE Trans. Power Syst., vol. 20, no. 2, pp. 556564, May 2005.
[28] C. A. Coello, G. B. Lamont, and D. A. Van Veldhuizen, Evolutionary
Algorithms for Solving Multi-Objective Problems. Norwell, MA:
Kluwer, 2002.
[29] C. A. Coello, A Comprehensive Survey of Evolutionary-Based Multiobjective Optimization Techniques, Knowledge and Information Systems,
vol. 1, no. 3, pp. 269308, Aug. 1999.

Jorge Mendoza (S03) was born in Concepcin,

Chile. He received the D.E.E degree in 2001 and the
M.Sc. degree in electrical engineering in 2003 from
the University of Concepcin, Concepcin, Chile,
where he is working toward the Ph.D. degree in
electrical engineering. He holds a scholarship from
CONICYT for his Ph.D. studies.
His main research interests are optimization, numerical modeling, reliability, and quality of electrical
systems.

Rodrigo Lpez (S05) was born in Concepcin,

Chile. He received the D.E.E degree in 2003 and
the M.Sc. degree in electrical engineering in 2004
from the University of Concepcin, Concepcin,
Chile. He is working toward the Ph.D. degree from
the University of Paris XI and lcole Suprieure
dlectricit Suplec, Paris, France.
His interest areas are planning, optimization, control, power quality, and numerical modeling of electrical systems.

Dario Morales was born in Los Angeles, Chile. He

received the Electrical Engineer degree in 2001 from
the University of Concepcin, Concepcin, Chile. He
is working toward the Ph.D. degree at the University of Paris XI and lcole Suprieure dlectricitSuplec, Paris, France.
His areas of interest are numerical modeling of
power systems and renewable energy applications.

Enrique Lpez was born in Lota, Chile. He received the Electrical Engineer degree in 1974 from
Universidad Tcnica del Estado, Estado, Chile, and
the Ph.D. degree in 1983 from Institut National Politechnique de Grenoble (INPG), Grenoble, France.
Currently, he is an Associate Professor in the
Electrical Engineering Department, Universidad
de Concepcin. His interest areas are planning,
optimization, control, reliability, and quality of
electrical systems.

Philippe Dessante was born in Clichy, France. He

received the Ph.D. degree in 2000 from the University
of Versailles, Saint-Quentin, France.
He is currently a Professor at the Ecole Suprieure
dElectricit-Suplec, Paris, France. His main field
of research is about simulation and optimization in
power systems.

Roger Moraga was born in Santiago, Chile. He

received the Electrical Engineering degree in 2004
from the University of Concepcin, Concepcin,
Chile.
He is currently a Professor at Desarrollo University, Concepcin, Chile. His interest areas are planning, optimization, control, power quality, and numerical modeling of electrical systems.