ICA-ACCA 2018, October 17-19, 2018, Greater Concepción, Chile
Probabilistic Minimal Loss Reconfiguration for
Electric Power Distribution Control
Rodrigo López, Miguel Lopez, Jorge Mendoza, Enrique López, Gastón Lefranc
Abstract— Although it is well-known that electric demand is a
random variable, the reconfiguration theory still approaches this
problem from a deterministic point of view; i.e., most of the
network losses optimization problems solutions are built
primarily for a specific profile of demand. Even if there are many
random behaviors involved in this subject, the main proposal of
this paper is a didactic line of attack for a probabilistic minimal
loss reconfiguration problem, that takes into account the
randomness of load variations of electric distribution systems.
The method is based on the Monte Carlo (MC) technique to
assign a random load level in each node of the system. The
statistical behavior of the loads is modeled using uniform
probability density functions. The model defines a useful
stochastic index for medium and long-term operation planning
reconfiguration. The optimization problem of reconfiguration is
solved using a Genetic Algorithm (GA). Principal contributions
of this paper are: a) a didactic way to understand a complex
electric distribution control theme b) the idea of “expected or
characteristic topologies” controlling the influence of wide
random load variations on the system configuration and c) a
modal topology (in statistical sense) corresponding to the
reconfiguration solution for the average demand values.
Preceding outcomes are very important: 1) from the realistic
modeling point of view, 2) the decision-making strategies and 3) a
simple understanding of the topic.
Keywords— Electric Power Distribution Systems, Probabilistic
Reconfiguration, Minimal Loss Reconfiguration, Monte Carlo
Method, Genetic Algorithms, Modal Topology.
I. INTRODUCTION
R ECONFIGURATION of a power distribution network is a
process of changing the topological structure of feeders.
This is done by altering the open/close status of the
distribution system sectionalizers and switches. Under normal
system operation, the goals of the reconfiguration process are:
a) avoid transformer excessive load, b) prevent conductor
overheating and c) minimize abnormal voltages and c)
simultaneously, minimizing the real losses.
“As the demand for electricity increases day by day,
distribution system becomes complicated and its control
becomes difficult. Several intelligence techniques are used for
feeder reconfiguration to reduce power losses and improve
voltage profile and reliability. With the advancement in the
field of automation, intelligent switchgears are now used in
feeder reconfiguration to enhance accuracy and reliability.
R. López is with Wolfson Solutions SPA. E. López is with the Department
of Electrical Engineering. University of Concepción, Chile (elopez@udec.cl),
M. López, J. Mendoza and G. Lefranc are with the School of Electrical
Engineering, Pontificia Universidad Católica de Valparaíso, Chile
(miguel.lopez@pucv.cl).
c
978-1-5386-5586-3/18/$31.00 2018 IEEE
Nevertheless, it is difficult to select a single method / solution
/ technology that could satisfy the requirement of all
operational aspects, including computational efficiency and
operational constraints. In the case of faulty conditions, the
comprehensive off-line studies can well address the
uncertainties in contingencies and operating conditions, for
this one the knowledge-based heuristics are the most reliable
and efficient approaches. It is preferred to reasonably integrate
some of the solution methods to make use of their merits and
avoid their disadvantages for normal conditions” [22].
Merlin and Back developed one of the first methods used to
solve this problem [1]. In a survey developed by Sarfi, Salama
and Chikani [2], a considerable number of papers were
analyzed. From these contributions, many new methodologies
to face this process of optimization have been developed.
Peponis in [3] develops a model based on the Merlin and
Civanlar approaches, taking into account the influence of load
modeling. Fan formulate the active power losses reduction
problem via a linear modeling [4]. Then the Whole Linear
Programming approach, based on the Simplex Method with a
simple feedback optimization technique is used in [5], Taleski
presents a heuristic loss minimization method founded on the
element-oriented ordering technique, taking into account a
statistical representation of load profile and the sum of energy
for losses evaluation. McDermont in [6] proposes a
constructive heuristic centered on the loss increment
evaluation, there a new node that introduces minimal losses is
added at each step. In [7], E. López et al. recommend a
minimal loss reconfiguration method to be used in large
distribution systems constructed on the Dynamic
Programming Method, Graph Compression and Radial Load
Flow.
In literature, numerous methods use Artificial Intelligence.
Among them, Genetic Algorithms. In [8], an enhanced genetic
algorithm based on fuzzy multi-objective approach to solve a
network reconfiguration problem in a radial distribution
system is presented maximizing the fuzzy satisfaction allows
the operator, simultaneously; it considers the multiple
objectives of the network reconfiguration, i.e., minimal power
loss, voltages and current constraints, as well as the number of
switching actions. In [9], R. López et al. propose a new
method for solving the minimal loss reconfiguration problem
using a GA, Diakoptic Compensation Currents, Graph
Compression, Current Flow and Stochastic Minimum
Extension Tree. On the other hand, Lin in [10] shows the
result of a rule-based expert system with a colored Petri net for
load balancing of distribution systems. In this paper, a set of
heuristic rules based on standard load transfer operational
1
 ICA-ACCA 2018, October 17-19, 2018, Greater Concepción, Chile
procedures for the Taipower distribution system are included.
In [11], J. Mendoza et al. propose a method that takes into
account the energy non-supply. This model is constructed on
the shortest path technique to evaluate reliability and a GA is
adopted for determining the near optimal solution. J. Mendoza
et al. in [12] propose and evaluate a method that improves the
adaptability and efficiency of a GA when applied to the
minimal loss reconfiguration problem. Bahadoorsingh et al. in
[13] use GA for solving the reconfiguration problem taking
into account the voltage sag cost in distribution network. In
[14], Enacheanu et al. develop a new strategy to enhance
ability to explore the solution space, based on Graph and
Matroid theories and GA. On the other hand, Zhang et al. in
[15], using an adaptive GA, approach the reconfiguration
problem and capacitors control for minimizing active power
losses in a distribution system.
E. López et al. in [16] apply the minimal loss
reconfiguration method to evaluate online reconfiguration
benefits, considering the time varying nature of loads. The
load profiles used depend on the customer type (residential,
industrial, etc.) while the load diversity and the nodal
correlation is represented by 24-hourly demand. The
conclusion shows that 1) a loss reduction, when the network is
reconfigured hourly, is associated with an important number
of undesirable and dangerous maneuvers and 2) this reduction
may be not relevant, when it is compared with losses obtained
by means of an optimized fixed topology for maximum or
average demand. In [18], a two-stage method for the
distribution system reconfiguration for loss minimization is
presented. The efficiency of the method is due to the use of the
loss sensitivity with respect to the impedances of candidate
branches. The reconfiguration process starts with a power flow
of the system with all its switches closed thus forming a
meshed system. The first major step uses this sensitivity
information. The second step uses branch exchange procedure
to improve the solution. Taylor and Hover in [19] introduce a
new mixed-integer quadratic (quadratically constrained) and a
second-order cone programming models for distribution
system reconfiguration. Results suggest potential near real-
time application, which may indeed become relevant given
large fluctuations of renewable energy sources. An effective
approach based on the Particle Swarm Optimization (PSO)
with integer coded to determine the switch operation schemes
for feeder reconfiguration is proposed in [20]. The proposed
approach, enhanced integer coded particle swarm optimization
(EICPSO), is able to improve the search efficiency for feeder
reconfiguration problems by considering the historical local
optimal solutions when generating new particles. Feeders from
Taiwan Power Company distribution system are used in this
study. By applying EICPSO integrated with Local Optimal
List, the algorithm can escape from local optimal solution.
Kiran et al. in [21] explores previous to 2013 existing popular
methodologies to mitigate the problem. There, research
publications in popular journals, conferences and symposiums
are the main source for collecting data. Popular journals like
IEEE transactions, Elsevier etc., are referred. There, more than
300 publications were studied which are short listed to around
2
50. Redundancy is thoroughly avoided before short-listing the
paper. This paper is useful for the researchers working in this
area. In [22], a review of Distribution Feeder Reconfiguration
(DFR) methods is presented; it includes heuristic and genetic
algorithm approaches. This paper is organized as follows: a)
summarizes briefly the goals of DFR and indicates their
relationship, b) DFR methods are classified and presented, c)
Remarks are stated. Consequently, many different feeder
reconfiguration techniques have been discussed. Their
objectives functions and physical constraints have also been
reported. This article is very convenient for the in-process-
investigators laboring into reconfiguration control of
distribution system. Lei Tang et al. in [23] present a literature
survey on distribution system FRC (feeder reconfiguration).
Among many aspects to be reviewed for a comprehensive
study, this paper focuses on FRC objectives and solution
methods. The problem definition of FRC is first discussed, the
objectives are summarized and various solution methods are
categorized and evaluated. This paper generalizes them into
(1) heuristic methods, (2) conventional programming (note:
Heuristic methods include knowledge-based heuristic
methods, meta-heuristic methods and computational
intelligence). Authors conclude “Any method can solve FRC
independently, and can solve the sub-problems formulated by
decomposing the whole FRC problem in dynamic
programming. It is difficult to pick a single method that could
satisfy the requirement of all operational aspects, including
computational efficiency, model accuracy and complex
operational constraints”. In consequence, this exposé is
exceptionally appropriate for engineers working in
reconfiguration planning and operation of distribution
networks. All previous works are significant contributions to
the deterministic theory of minimal loss reconfiguration.
However, the problem related to the random loads variation
still needs further analysis, since random events may influence
the resultant topologies. Consequently, the present research
recognizes the reconfiguration problem as a stochastic
process. Here, the MC simulation method and a GA
deterministic reconfiguration model are used in order to
structure a mono-objective approach of stochastic
programming. A MC random sort method assigns the load
levels for the deterministic reconfiguration model, and a GA
finds the best solution. The process is repeated for a certain
defined number of times, according to the MC technique. The
deterministic reconfiguration model used in this work is
detailed in [12]. This algorithm, GA-based uses a restricted
and addressed population to find the minimal loss network.
The test networks and the real network presented in [7] are
used to validate the proposed method.
II. PROPOSED SOLUTION
A. Minimal Losses Reconfiguration Problem
The minimization of the active power losses may be
physically done by changing the topology of the distribution
network. The problem can be formulated as follows [16]:
 ICA-ACCA 2018, October 17-19, 2018, Greater Concepción, Chile
Nr
Minimize ¦
b=1
R b ⋅ i b2 (1)
Subject to
[A]T ⋅ i = I (2)
i ≤ i máx (3)
V min ≤ V ≤ V max (4)
M = N-Nf (5)
Objective function is shown in (1), it represents the total
power loss of the system. Nodal load current balances (2),
feeder thermal limits and substations maximum capacity (3),
node voltage (4) and primary distribution system radiality (5)
are the problem constraints.
B. Monte Carlo Technique and Load Probability Distribution
Function
The MC method constitutes a very useful simulation
strategy, based on randomized input data, where analytical
methods proved to be unable to model random behaviors. It is
based on a probability distribution function that models the
random behavior of certain stochastic processes. In this paper
the stochastic behavior of nodal loads is simulated using MC.
The random topology responses of the distribution systems are
studied regarding this MC random input. On the other hand,
the nodal load random variables, in practice, exhibit a small
level of curtosis and a no-categorical asymmetry. However, in
order not to slant the solution, the nodal demand is modeled
through uniform probability distributions. The last one can be
perceived as “a worst possible nodal demand behavior”. This
hypothesis put emphasis on the key results of this article.
Conversely, normally, “a good behavior” would correspond to
a standard Gaussian load pattern [16]. Two parameters are
mandatory in order to model the uniform random behavior of
nodal power: the average (μ) and the standard deviation (σ)
values. The average demand of each load was used as the
expected value of the uniform distribution. An actual or a
practical 10% Pearson variation coefficient can be considered
[16].
Pmin + Pmax ( Pmax − Pmin )
μ= ; σ = (6)
2 12
C. Deterministic GA Reconfiguration Algorithm
Several techniques have been used to solve the
reconfiguration problem, including GA. However, Heuristic
techniques are not capable of ensuring that the global optimum
has been found. Particularly, the GA´s stochastic nature makes
quite difficult or even impossible, to assess that the global
optimum has been reached. However, we have a lot of
empirical evidence of its effectiveness, not only in this article,
but also from many other authors, in which the results of the
GA are found to be better or at least comparable to those of
many other techniques. The GA algorithm adopted in this
paper, for the deterministic reconfiguration, takes into account
the fundamental loops vectors of a network, which are defined
as a set of elements that form a closed-loop in a circuit that
3
does not contain any other closed-loop. In order to create a
radial topology, one should select from the group of
fundamental loop vectors those elements that are to be
disconnected (one per loop) [17]. These considerations allow
limiting the generation of infeasible individuals used in the
GA. The last one reduces the combinatorial search space.
Although this methodology is very efficient, robust and fast to
evaluate the reconfiguration of large distribution systems.
Further details of the method can be found in [12].
D. Implementation of Proposed Approach
The proposed approach to solve the probabilistic minimal
loss reconfiguration is described in the following steps. Figure
1 helps to illustrate the proposed method.
1. The first step of this model consists of calculating the
minimal and maximal nodal power, given their
average and standard deviation parameters, using the
expression defined in (6).
2. By means of a uniform probability distribution for
each node of the system, pick up a node power
demand between the minimal or maximal values
(step 1).
3. Considering the random load profile (step 2), solve the
minimal loss reconfiguration problem using the
algorithms described and store the best topological
solution.
4. Return to the step 2 until a MC stop criterion is
satisfied.
5. The topologies and its distribution frequencies, using a
Pareto histogram, are presented.
Data Input
Random Sort
Demand
(Uniform
Distribution) no
Statistical
Analysis
Final MC
Test yes
Store
Topology
Deterministic
Most
GA Reconfiguration
Frequent
Topologies
Monte Carlo
Techique
Fig. 1. Block diagram of the proposed methodology
III. APPLICATION
In this section, the proposed method is applied to three
systems in order to find their minimal losses radial topologies.
These are: a) Civanlar IEEE test system showed in figure 2; b)
Baran IEEE test system showed in figure 3 and c) Real system
[7]. For each system, their global characteristics are detailed in
Table I. The histograms show their most frequent solutions.
Venn diagrams show the sets of open lines in each topology.
The MC simulation equals to 3000 tests. In order to assure the
 ICA-ACCA 2018, October 17-19, 2018, Greater Concepción, Chile

optimal or best solutions, the number of individuals of the studying 392 radial topologies. Each one must be submitted to
population and the number of generations, used in each system all wide random load variations. With the proposed method
simulation, has been over dimensioned. only 4 topologies deserve further analysis.

1
2000
L1 L2 L3
1800

2 3 4 1600
1400
L4 L8

Frequency
1200
L5 L10 1000
5 6 9 11 L13
800
L17 L9 L18 600
L 11 L 14 400
L6 12 10 15 14
200
L 12 L15 0
1 2 3 4 5 6 7 8 9 …and
7 13 16 Topologies more

L7 L16 Fig. 4. Civanlar system histogram

L 19
8 17
II
Fig. 2. Civanlar system topology IV
7
1
11 18
I

L1 10 19
L 18 L24
19 2 24 25
17
L19 L2 L 23 III

13
L12
12
L 35
22 20 3
L 22
23 L37
Fig. 5. Open lines Venn diagrams for the 4 Civanlar system most
recurrent topologies
L11 L21 L20 L3

L28
11 21 4 28 29 B. Baran System
L 13 L10 L33 L4 L 27 L29 Results obtained for this system are shown in figure 6,
L9 L8
where the modal topology is shown. This configuration is
10 9 8 5 27 30
repeated in 35% of cases and coincides with topology obtained
L 34 L7 L5 L 26 L30 in [12]. Other non-modal recurrent topologies are (topologies
L 14 L6 L 25 2, 3 and 4).
14 15 7 6 26 31

1200
L 15 L31
1000
L16 L 17 L 36 L32
16 17 18 33 32
800
Frequency

Fig. 3. Baran system topology

600

TABLE I 400
SYSTEM GLOBAL CHARACTERISTICS
200
Systems Nodes Lines Population Generations
Civanlar 17 19 25 30 0
1 2 3 4 5 6 7 8 9 10 ...and
Baran 33 37 40 60
Topologies more
Real 25 35 40 70
Fig. 6. Baran system histogram

A. Civanlar System
I
The Civanlar system histogram is showed in figure 4. After II 31
9
3000 MC iterations, the most frequent (modal, in statistical 37
7
sense) topology have an occurrence probability of 63% 32 III
14
(topology I). It is important to point out that this topology is 28
the same one obtained when the average values of loads were IV
10
used [12]. Venn diagram (figure 5) shows the lines that must
be disconnected. Lines 10, 11 and 19 are open in this solution. Fig. 7. Open lines Venn diagrams for the 4 Baran system most
recurrent topologies
An exhaustive search of all possible networks would involve

4
 ICA-ACCA 2018, October 17-19, 2018, Greater Concepción, Chile

The definitive topology must be properly selected regarding
the secondary objectives. Open lines Venn diagrams for the 4
Baran system most recurrent topologies are shown in figure 7.
Topology 1 represents the solution for average demand of the
system. The lines 7 – 9 – 14 – 32 and 37 should be open.
can be noticed that a reduced group of topologies are optimal
or near optimal for a wide range of load values, i.e., only one
modal topology appears. The result of this probabilistic
approach is in concordance with the conclusion of [16],
regarding the on-line network reconfiguration.

TABLE II
C. Real System TOPOLOGIES FOR σ-VARIATIONS
This application is a real network. This typical primary Topology Open lines 10% 20% 30% 40%
1 10 – 11 – 19 1891 1597 1419 1132
power distribution system taking into consideration the load 2 7 – 10 – 11 679 568 430 413
uncertainty factors. The Real system histogram is showed in 3 10 – 17 – 19 94 58 57 106
4 11 – 18 – 19 59 43 57 63
Fig. 8. Results are similar to the previous cases. Topology 1 is 5 10 – 11 – 16 58 42 36 43
repeated 1779 times. His probability is more than 60%. Once 6 7 – 10 – 17 26 26 43 33
OTHERS 215 697 998 1258
again, the modal reconfiguration solution coincides with the
topology for average demand obtained in [12]. Lines 9 – 22 –
25 – 27 – 28 – 29 – 30 – 31- 32 – 33 and 35 must be open.
2000
Open lines Venn diagrams for the 3 Real system most
1800
recurrent topologies are shown in figure 9.
1600
10% 20%
1400
30% 40%
2000 Frequency 1200
1000
1800
1600 800
1400 600
Frequency

1200 400
1000 200
800 0
600 1 2 3 4 5 6 …and
400 Topologies more
200
0
Fig. 10. Civanlar system σ-histogram
1 2 3 4 5 6 7 8 …and
Topologies more
400
Fig. 8. Real system histogram 350
Total Topologies

300
250
22 200
33 II 150
100
I 25 9 35
50
30 31 12 0
32 27 29 10% 20% 30% 40%
Pearson's coeficient
28 14
34 Fig. 11. Civanlar system σ-total topologies bar plot
III

Fig. 9. Open lines Venn diagrams for the 3 Real system most
recurrent topologies
D. Standard Deviation Sensibility Analysis
This section analyze the effect produced by the variation of
the standard deviation (σ) on the results. For this, Civanlar
system is studied using the Pearson’s coefficients of 10, 20, 30
y 40%. The σ-histogram for the 6 most recurrent topologies in
Civanlar system are shown in figure 10.
Table II shows the open lines of these 6 topologies, their
number of repetitions and their Pearson’s coefficients. The
E. Topology Quality
It is important to point out that in every Monte Carlo test
the system load profile is different. Nevertheless, two or more
different profile of load can have the same topological
solution. Thus, it is not adequate compare the net losses values
in order to evaluate the quality of each topology. This section
develops an index to compare the performance of each
topology. Consequently, an Average Loss Coefficient (ALC)
can be calculated as follows:
NFk

¦ §¨© ·
Lk
frequency of each topology decreases while the Pearson’s S k ¸¹ (7)
coefficients increases. However, the 4 most frequent ALC k = 1
× 100%
topologies do not change. NFk
On the other hand, as it can be seen figure 11, new low For the first six topologies, of Civanlar system, the ALC index
frequency topologies appears when σ value increase. In spite is calculated. Results are shown in figure 12. It can be seen
of the high variation of the loads, standard deviation (40%), it that “Topology 1” has the lowest value of average losses. This

5
 ICA-ACCA 2018, October 17-19, 2018, Greater Concepción, Chile
is significant to be considered during the decision making. In
order to assess the ALC performance, is important to know the
resultant standard deviation for each ALC average value.
Table III shows the standard deviations for each for studied
topology. They are very small. Therefore, the ALC index is
representative of each topology.
2.25
2.20
2.15
2.10
LS %
2.05
2.00
1.95
1.90
1.85
1.80
1 2 3 4 5 6
Topologies
Fig. 12. Civanlar system ALC bar plot
TABLE III
STANDARD DEVIATION OF ALC INDEX
Topology 1 2 3 4 5 6
Standard Deviation (%) 0.07 0.08 0.07 0.04 0.06 0.06
IV. CONCLUSION
In this paper, a didactic method to perform a minimal loss
reconfiguration taking into account the randomness of load
variations is proposed. The Monte Carlo simulation method
was used to deal with random load variations. As a result, the
method needs to resolve MC reconfiguration problems, using
a Genetic Algorithms-based technique, Diakoptic and Graph
Compression (these two latest theories are detailed in [9]).
The main contributions of this paper are: a) the proposed
method allows to identify a very reduced group of optimal
and/or efficient topologies, for a wide range of load values.
This compact set of topologies, reduce drastically the number
of possibilities to choose the best topology, b) a modal
topology is founded. This one minimizes the system losses, for
the range of values of the stochastic load. The modal solution
can be obtained via a classic program of deterministic
reconfiguration, using the average values of the load, c) an
average loss index has been suggested in order to choose the
best topology among the modal and the recurrent ones, d) a
very didactic way, based on feeder reconfiguration, as a
challenge for the electric distribution automation, is done, e)
all the concepts evoked here, can be extended to more
complex stages. For instance, the randomness of primary
sources of energy, availability, security, reliability of
equipment and multiple objectives (i.e., solar irradiation, wind
speed, time for failure, rate of azar, Pareto analysis, etc.).
REFERENCES
[1] A. Merlin and G. Back, “Search for Minimum-Loss Operational
Spanning Tree Configuration for an Urban Power Distribution System”,
Proc. of the 5th Power System Conference (PSCC). Cambridge, pp. 1-18,
1975.
6
[2] R. Sarfi, M. Salama and A. Chikhani, “A survey of the state of the art in
distribution system reconfiguration for system loss reduction.” Electric
Power Systems Research 31. pp 61-70, 1994.
[3] G. Peponis, M. Papadopoulos and N. Hatziargyriou, “Optimal Operation
of Distribution Networks”. IEEE Transactions on Power Systems. Vol.
11, Nº 1, pp. 59-67, Feb. 1996.
[4] J. Fan, L. Zhang and J. McDonald, “Distribution Network
reconfiguration: Single Loop Optimization”, IEEE Transactions on
Power Systems. Vol. 11. Nº 3, pp. 1643-1647, 1996.
[5] R. Taleski and D. Rajicic “Distribution Networks Reconfiguration for
Energy Loss Reduction,” IEEE Trans. on Power Systems. Vol. 12, N°1,
pp. 398-406, Feb. 1997.
[6] T. McDermott, I. Drezga and R. Broadwatwer “A Heuristic Nonlinear
Constructive Method for Distribution System Reconfiguration.” IEEE
Transactions on Power Systems. Vol. 14, Nº 2, pp. 478-483, May 1999.
[7] E. López, Opazo H, Garcia L., and M. Poloujadoff, “Minimal Loss
Reconfiguration Based on Dynamic Programming Approach:
Application to real Systems”. Electric Power Components and Systems.
Vol. 30, Nº 7, pp. 693-704, July 2002.
[8] Y.C. Huang, “Enhanced Genetic Algorithm-based Fuzzy Multi-objective
Approach to Distribution Network Reconfiguration”, IEE Proc.
Generation, Transmission and Distribution, 149 (5), pp. 615-620, 2002.
[9] R. López, E. López, R. Moraga and H. Opazo, “Contributions a la
Reconfiguration des Réseaux de Distribution Primaire à travers des
Arbres Stochastiques d’Extension Minimale, des Courants Diakoptiques
et des Algorithmes Génétiques”, EF2003, SUPELEC, Paris, 2003.
[10] C. Lin, “Distribution network reconfiguration for load balancing with a
coloured Petri net algorithm” IEE Proc. Generation, Transmission and
Distribution, 150 (3), pp. 317 – 324, 2003.
[11] J. Mendoza, R. López, D. Morales, E. López and M. Meunier, “Un
Modèle de Reconfiguration pour la Minimisation de l’Energie Non
Fournie Utilisant des Algorithmes Génétiques”, EF2005 LEG/ENSIEG
Grenoble, 2005.
[12] J. Mendoza, R. López, D. Morales, E. López, Ph. Dessante and R.
Moraga, “Minimal Loss Reconfiguration Using Genetic Algorithms with
Restricted Population and Addressed Operators: Real Application”,
IEEE Transactions on Power Systems, Vol. 21, Nº 2, pp. 59-67, May
2006.
[13] S. Bahadoorsingh, J. Milanovié, Y. Zhang, C. Gupta, J. Dragovié,
“Minimization of Voltage Sag Cost by Optimal Reconfiguration of
Distribution Network Using Genetic Algorithms” IEEE Transactions on
Power Delivery, Vol. 22, Nº 4, pp. 2271-2278, Oct. 2007.
[14] B. Enacheanu, B. Raison, R. Caire, O. Devaux, W. Bienia, N. HadjSaid,
“Radial Network Reconfiguration Using Generic Algothm Based on the
Matroid Theory”, IEEE Transactions on Power System, Vol. 23, Nº 1,
pp. 186-195, Feb. 2008.
[15] D. Zhang, Z. Fu, L. Zhang, “Joint Optimization for Power Loss
Reduction in Distribution Systems”, IEEE Transactions on Power
System, Vol. 23, Nº 1, pp. 161-169, Feb. 2008.
[16] E. López, H. Opazo, L. Garcia, and P. Bastard “On-Line
Reconfiguration Considering Variability Demand: Application to Real
Network”, IEEE Transactions on Power Systems. Vol. 50, Nº 7, pp. 59-
67, Feb. 2004.
[17] W-M. Lin, H-C. Chin, “A New Approach for Distribution Feeder
Reconfiguration for Loss Reduction and Service Restoration”, IEEE
Transactions on Power Delivery. Vol. 13, Nº 3, pp. 870-875, Jul. 1998.
[18] G. K. V. Raju and P. R. Bijwe, "An Efficient Algorithm for Minimum
Loss Reconfiguration of Distribution System Based on Sensitivity and
Heuristics," in IEEE Transactions on Power Systems, vol. 23, no. 3, pp.
1280-1287, Aug. 2008.
[19] J. A. Taylor and F. S. Hover, "Convex Models of Distribution System
Reconfiguration," in IEEE Transactions on Power Systems, vol. 27, no.
3, pp. 1407-1413, Aug. 2012.
[20] W. Wu and M. Tsai, "Application of Enhanced Integer Coded Particle
Swarm Optimization for Distribution System Feeder Reconfiguration,"
in IEEE Transactions on Power Systems, vol. 26, no. 3, pp. 1591-1599,
Aug. 2011.
[21] K. Kiran Kumar, N. Venkata Ramana, S. Kamakshaiah, Nishanth P M;
“State of Art for Network Reconfiguration. Methodologies of
Distribution System”, Journal of Theoretical and Applied Information
Technology, Vol. 57, No.1, November 2013.
[22] K.K.S.V.V. Prakasa Rao, V.C. Reddy Veera, “A Review on Distribution
Feeder Reconfiguration Methods”, International Journal of Advance
Research, IJARIIT, Ideas and Innovations in Technology, Page 192,
Volume 3, Issue 2, Available online at: www.ijariit.com, 2017.
 ICA-ACCA 2018, October 17-19, 2018, Greater Concepción, Chile

[23] L. Tang, F. Yang and J. Ma, “A Survey on Distribution System Feeder

Reconfiguration: Objectives and Solutions”, in IEEE Innovative Smart
Grid Technologies – Asia (ISGT Asia) pp 62 – 67, 2014.

APPENDIX
NOMENCLATURE
Variable Theme
Rb “b” branch resistance
ib “b” branch complex current
imax Branches maximum highest current
A Incidence matrix
V Node voltage
Vmin Minimum voltage value
Vmax Maximum voltage value
M Branch number
N Node number
Nf Source number
μ Expected value of node power
σ Standard deviation of node power
Pmin, Pmax Minimum and maximum values of node power
ALCk Power-Loss index for topology “k”
Lk Total Active power losses of the “k-th” topology
Sk Total demand value of the “k-th” topology
NFk Frequency of the “k-th” topology