# A Dynamic and Heuristic Phase Balancing Method for LV Feeders

Authors: Samad Taghipour Boroujeni; Mohammad Mardaneh; Zhale Hashemi
Journal: Applied Computational Intelligence and Soft Computing
 (2016)

---

## Abstract

Due to the single-phase loads and their stochastic behavior, the current in the distribution feeders is not balanced. In addition, the single-phase loads are located in different positions along the LV feeders. So the amount of the unbalanced load and its location affect the feeder losses. An unbalanced load causes the feeder losses and the voltage drop. Because of time-varying behavior of the single-phase loads, phase balancing is a dynamic and combinatorial problem. In this research, a heuristic and dynamic solution for the phase balancing of the LV feeders is proposed. In this method, it is supposed that the loads’ tie could be connected to all phases through a three-phase switch. The aim of the proposed method is to make the feeder conditions as balanced as possible. The amount and the location of single-phase loads are considered in the proposed phase balancing method. Since the proposed method needs no communication interface or no remote controller, it is inexpensive, simple, practical, and robust. Applying this method provides a distributed and dynamic phase balancing control. In addition, the feasibility of reducing the used switches is investigated. The ability of the proposed method in the phase balancing of the LV feeders is approved by carrying out some simulations.


---

## Body

## 1. Introduction

Nowadays, fossil fuels, the main source of our world energy, have been diminished day by day. In addition, the environmental pollution and the global warming concerns cause the increase in the importance of energy saving and loss reduction. So a lot of researches have been devoted to enhancing the efficiency of the energy converter machines. The most popular shape of energy, electrical energy, is mainly produced in the power plants, transmitted through the electrical networks, and consumed in the load points. Therefore, the electrical network efficiency has a greater role in the energy saving and loss reduction. Electrical networks include transmission and distribution systems. As the transmission voltage is higher than the distribution voltage, the distribution system losses are greater.The phase balancing results in benefits such as loss reduction, voltage profile improvement, and system reliability enhancement. At LV feeders, single-phase loads make unbalanced conditions and increase losses in the LV feeders. These loads are distributed along the feeder and have different and stochastic behaviors. All of these aspects of the single-phase loads make distribution phase balancing more difficult and complicated. In fact phase balancing is a dynamic combinatorial problem.The distribution load balancing has been considered in many researches. These researches can be divided into two main groups. The first group deals with the network reconfiguration through some switches [1–12]. These methods try to distribute the power demanded by one geographical zone among different feeders equally. In the second group, it is desired to distribute the power of one feeder among its different phases, equally. In addition, against profound and strong researches on load balancing [1–12], there are few papers on phase balancing [13–15]. In [13, 14], medium voltage phase balancing is addressed by choosing the best connection for the transformer nodes.Traditionally, phase balancing is done at periodical intervals, manually, after some field measurements by the utilities [15, 16], which is mentioned here as the Static phase balancing (SPB). Although the SPB is a stable method, due to the stochastic and time-varying characteristics of the single-phase loads, it is not an efficient method in the loss reduction. On the other hand, the dynamic phase balancing (DPB) is a more effective method in the loss reduction. However, the DPB method is an expensive method and enough attention should be paid to its instability [16]. The DPB of the LV feeders is addressed in [15, 16] using a central remote controller and communication system.DPB can be implemented easily in the distribution network equipped with an automated system [15, 16]. Although advances in power electronic devices, microcontroller processors, and communication systems make it easy to apply automation systems in the distribution networks, in many countries it needs a long time to have such systems, completely.Since single-phase loads in LV networks are distributed along the feeder, their location is an important and effective parameter on the feeder losses, as well as their amount. In comparison with an unbalanced load in the first sections of LV feeder, the same unbalanced load in the end points of the considered feeder results in more losses. The impact of single-phase load locations is not considered in [15, 16]. In addition, the proposed methods in [15, 16] need an automated system with fuzzy or neural remote controllers, which make DPB system expensive and complicated.In this research a heuristic and dynamic solution for phase balancing of LV feeders is proposed. In this method, it is supposed that customers’ ties are switchable between different phases through a three-phase switch. The three-phase switches are controlled by some distributed local controllers. These local controllers only need locally measured signals without any information about the other loads and branches which are far from the controller installing point. Therefore, the communication interface can be avoided. The proposed method tries to make the current in each section of the LV feeder as balanced as possible. In the proposed method amount and location of single-phase loads are considered inherently. Although some three-phase switches are used in the proposed method, it is inexpensive, simple, and practical. In some cases it may happen that the benefit of the loss reduction cannot overcome the cost of the installed switches. Therefore, a trade-off between the loss reduction and the number of the used switches should be done. So the Genetic Algorithm is applied to find the optimum number of switches as well as their locations. The proposed method does not need any remote controller and communication interface. So it is a fault tolerant method which provides a distributed and dynamic phase balancing control.Hereafter phase balancing problem is represented in Section2. The proposed algorithm is described in Section 3. In addition, the feasibility of reducing the number of the switches is investigated in Section 4. Simulation results are reported in Section 5. These results show the ability and the efficiency of the proposed method in phase balancing of the LV feeders.


## 2. Problem Definition

For the sake of simplicity, loads are modeled as the constant currents in 4-wire, 3-phase distribution systems. Also KCL law is used to obtain branches current instead of the forward-backward load flow method. These assumptions’ consideration does not have effect on the generality of the phase balancing problem. Total loss of a LV feeder is as follows:(1)
P
l
o
s
s
=
∑
x
∈
S
∑
k
=
1
m
r
x
k
·
I
x
k
2
,where S contains phases a, b, and c and the neutral wire, I
(
x
)
(
k
) and r
(
x
)
(
k
) are the current and the resistance of the phase “x” of the branch “k,” respectively, and “m” is number of the feeder branches.In the presented paper, the radial LV feeder is studied as a graph. In the graph theory, the nodes are connected via some branches. Some concepts and definitions of the graph theory which are used in this research are as follows.(i) Branch. A line section which connects two nodes together is defined as the branch. A branch contains at least two-wire branch (1-phase and 1-neutral wire).(ii) Main Node. Main node is the nearest node of the LV feeder to the transformer. It is located at the beginning of the feeder. This node connects LV and MV networks together.(iii) End Node. The end nodes are the deepest nodes in the feeder. From these nodes no branch is initiated.(iv) Node Path. In a radial graph each node can be connected to the main node only in one path, called here the node path. The node path is a sequence of branches or nodes, which connect the considered node to the main node.(v) Upstream and Downstream Nodes. Considering two nodes (A and B) of a branch, the node that is nearer to the main node is the upstream node of the other one. Similarly the latter one is the downstream node of the former. In other words, node A is upstream to node B (or node B is downstream to node A), if the path sequence of node A is a subset of the path sequence of node B. Since the LV feeder graph is considered radial, each node has only one upstream node, except the main node. In addition, except the end nodes that have no downstream node, the other nodes have at least one downstream node.(vi) Node Ranking. The criterion for the ranking is the position of nodes in the node paths. In the other words, the rank of an upstream node is more than the rank of its downstream nodes. In the node ranking, different nodes could have the same rank.(vii) Upstream and Downstream Branches. Each node is connected to other nodes through some branches. For each node, the upstream branch is the branch which connects the considered node to its upstream node (or other nodes with a higher rank). Similarly the downstream branch is defined as the branch which connects the considered node to one of the downstream nodes (or other nodes with lower rank). Since the LV feeder graph is radial, each node has only one upstream branch except the main node that has no upstream branch. In addition, except end nodes that have no downstream branches, other nodes have at least one downstream branch.(viii) Subgraph. A subgraph is a continuous graph whose nodes/branches are subsets of the main graph nodes/branches.(ix) An Example. In order to make the above definitions more clear, an example is presented. Figure 1(a) shows a small radial LV feeder with 12 nodes and 11 branches. Node “a” is the main node and nodes {
g
,
j
,
f
,
l
} are the end nodes. The path of node “k” is {
a
,
b
,
c
,
d
}. The upstream and downstream nodes of node “i” are “d” and “j,” respectively. Branch “c
d” is the upstream branch of node “d” and its downstream branches are {
d
i
,
d
e
,
d
k
}. The nodes ranking are as follows: rank
⁡
(
a
)
=
1, rank
⁡
(
b
)
=
2, rank
⁡
(
c
)
=
rank
⁡
(
g
)
=
3, rank
⁡
(
h
)
=
rank
⁡
(
d
)
=
4, rank
⁡
(
e
)
=
rank
⁡
(
i
)
=
rank
⁡
(
k
)
=
5, and rank
⁡
(
j
)
=
rank
⁡
(
f
)
=
rank
⁡
(
l
)
=
6. Also the path of node “i," shown in Figure 1(b), is a subgraph of the feeder graph of Figure 1(a).Figure 1
(a): The considered 12-node feeder graph. (b) A subgraph of (a).
(a)
(b)


## 3. The Proposed Heuristic Algorithm

The proposed heuristic method tries to make the phases current in each branch as balanced as possible. This condition should be very close to the optimal phase configuration with the lowest losses. For this purpose, it is supposed that the load of each node can be switched to different phases from a local controller installed on the node. A local controller installed on the node as determine the energizing phase. The input signals of the local controller are the measured load currents of the node as well as phase currents of the downstream branches of the considered node. Algorithm of phase selecting is as follows. This algorithm has to be carried out in the predefined intervals.(1) The phase assigning is carried out step by step, from the lowest ranked node (end nodes) to the highest ranked node (main node). Nodes with the same rank are analyzed in one step.(2) The currents of the downstream branches of one node are measured and obtained from(2)
D
C
x
k
=
∑
j
∈
J
I
L
x
j
,where D
C
(
x
)
(
k
) is the sum of currents in phase “x”in downstream branches of node “k,” I
L
(
x
)
j is the load current of node “j” in phase “x”, x
∈
{
a
,
b
,
c
}, J includes all the nodes which their paths contain node k, and D
C
(
x
)
(
k
) can be obtained from(3)
D
C
x
k
=
U
C
x
k
-
I
L
x
k
,where U
C
(
x
)
(
k
) is the phase “x” current in the upstream branch of node “k”. Obtaining D
C
(
x
)
(
k
) from (3) is easier and more practical than using (2).Note. For the end nodes D
C
(
x
)
(
k
) is considered zero.(3) Based on the obtained value ofD
C
(
x
)
(
k
), the load of node “k” is connected to one of the existing phases at node “k” such that its upstream branch current is made as balanced as possible. In order to find the best phase selection for the load at node “k,” a direct search is applied such that (4) is minimized. Consider (4)
∑
x
∈
a
,
b
,
c
I
a
v
-
D
C
x
k
-
I
L
x
k
,where(5)
I
a
v
=
1
3
·
∑
x
∈
a
,
b
,
c
D
C
x
k
+
I
L
x
k
.The above steps are done until the connecting phase at all nodes are determined. Since single-phase loads are varying in time, repeating the above algorithm in predefined interval is necessary to hold the LV feeder in optimum condition at all times.


## 4. Optimization

As mentioned, installing three-phase switches in all load connections, and controlling them from a remote or local controller, is an expensive method. Here, it is supposed to have fixed ties for some nodes and the other nodes can be switched to different phases. The main goal of this section is to find the minimum number of installed switches and their location. Also other nodes phases have to be determined to achieve the lowest losses. For this purpose a Genetic Algorithm (GA) is applied as the optimization tool. Objective function which is going to be minimized is feeder losses. In order to decrease computation time of GA, especially in feeders with a large number of nodes, the proposed heuristic method is combined with GA and referred to here as Modified Genetic Algorithm (MGA).


### 4.1. GA Description

The flowchart of the used GA is presented in Figure2. This flowchart is carried out for all load conditions. The chromosome in this algorithm is as in Figure 3. The first row of this chromosome is considered for the switchable nodes. It is1 if a three-phase switch is installed in that node, otherwise it is0. The second row shows phase connection of the fixed nodes. For achieving this purpose {
1
,
2
,
3
} indicates the phases {
a
,
b
,
c
}.Figure 2
The flowchart of the used GA.Figure 3
The chromosome structure used in GA.


### 4.2. MGA Description

In comparison with GA, the search space is modified in MGA. This results in a shorter computation time and a better convergence in MGA. The flowchart of the used MGA is shown in Figure4. The considered chromosome in MGA is as in Figure 5. Similar to the first row of the considered chromosome in GA, switchable nodes are modeled with1 and the other nodes are0.Figure 4
The flowchart of the used MGA.Figure 5
The chromosome structure used in MGA.In the MGA, the GA operators such as the crossover and the mutation are used to generate new offspring. In addition, the proposed heuristic method is used to determine the connecting phase at all nodes. In order to determine phase connection of the nodes with the fixed ties, average daily value of load current at these nodes is considered in the proposed heuristic method.


## 4.1. GA Description

The flowchart of the used GA is presented in Figure2. This flowchart is carried out for all load conditions. The chromosome in this algorithm is as in Figure 3. The first row of this chromosome is considered for the switchable nodes. It is1 if a three-phase switch is installed in that node, otherwise it is0. The second row shows phase connection of the fixed nodes. For achieving this purpose {
1
,
2
,
3
} indicates the phases {
a
,
b
,
c
}.Figure 2
The flowchart of the used GA.Figure 3
The chromosome structure used in GA.


## 4.2. MGA Description

In comparison with GA, the search space is modified in MGA. This results in a shorter computation time and a better convergence in MGA. The flowchart of the used MGA is shown in Figure4. The considered chromosome in MGA is as in Figure 5. Similar to the first row of the considered chromosome in GA, switchable nodes are modeled with1 and the other nodes are0.Figure 4
The flowchart of the used MGA.Figure 5
The chromosome structure used in MGA.In the MGA, the GA operators such as the crossover and the mutation are used to generate new offspring. In addition, the proposed heuristic method is used to determine the connecting phase at all nodes. In order to determine phase connection of the nodes with the fixed ties, average daily value of load current at these nodes is considered in the proposed heuristic method.


## 5. Simulation Results and Comparison

In this section the simulation results are used to investigate capability of the proposed heuristic method in phase balancing. For this purpose real measured data reported in [15] for 15-node and 45-node radial feeders are used. These data are represented in Tables 1 and 2. Configuration of the 15-node feeder is as in Figure 6. 45-node feeder configuration is the same as 15-node feeder (all the nodes are located in one line). In Table 1, 15-node feeder loads current is reported for three different conditions. Branches spans are not reported in [15]. The aim of [15] has been only to reach balanced currents in the main node branches of the feeder. Loads are connected to different phases through a three-phase switch. Static phase balancing (SPB) is carried out as second column in this table [15]. Of course branches spans (and their impedances) have a great impact on feeder losses. Last columns of Tables 1 and 2 show the considered branches spans.Table 1
The considered 15-node feeder loads and branches data.
Node
SPB
Load data 1 (A)
Load data 2 (A)
Load data 3 (A)
Branches data
First node
End node
Length (m)
1
1
94.06
40.16
1.51
1
2
20
2
2
22.88
92.61
73.93
2
3
25
3
3
60.07
90.77
44.06
3
4
15
4
1
48.11
40.61
92.24
4
5
25
5
2
88.23
88.47
46.13
5
6
25
6
3
75.44
5.73
41.44
6
7
20
7
1
45.19
34.93
83.77
7
8
15
8
2
1.83
80.5
51.99
8
9
20
9
3
81.31
0.97
20.06
9
10
15
10
1
60.92
13.75
66.54
10
11
25
11
2
78.4
20.07
82.97
11
12
20
12
3
91.25
19.67
1.94
12
13
20
13
1
73.08
59.77
67.44
13
14
25
14
2
17.45
26.94
37.56
14
15
15
15
3
44.02
19.68
82.34
r
=
0.5 Ω/kmTable 2
The considered 45-node feeder loads and branches data.
Node
Load (A)
Switches state
Branches data
SPB
NN [15]
HE [15]
FHM
First node
End node
Length (m)
1
40.16
1
1
1
2
1
2
20
2
92.61
2
2
1
3
2
3
25
3
90.77
3
3
2
1
3
4
15
4
40.61
1
1
3
1
4
5
25
5
88.47
2
3
3
2
5
6
25
6
5.73
3
1
1
2
6
7
20
7
34.93
1
3
3
1
7
8
15
8
80.5
2
1
2
3
8
9
20
9
0.97
3
2
2
3
9
10
15
10
13.75
1
1
1
1
10
11
25
11
20.07
2
3
2
3
11
12
20
12
19.67
3
2
2
1
12
13
20
13
59.77
1
3
1
2
13
14
25
14
26.94
2
2
3
3
14
15
15
15
19.68
3
2
3
3
15
16
20
16
1.51
1
1
1
3
16
17
20
17
73.93
2
2
2
1
17
18
25
18
44.06
3
3
3
3
18
19
15
19
92.24
1
1
2
2
19
20
25
20
46.13
2
1
1
3
20
21
25
21
41.44
3
2
2
2
21
22
20
22
83.77
1
3
3
1
22
23
15
23
51.99
2
1
1
3
23
24
20
24
20.06
3
3
2
3
24
25
15
25
66.54
1
2
3
1
25
26
25
26
82.97
2
2
1
2
26
27
20
27
1.94
3
3
3
2
27
28
20
28
67.44
1
1
3
3
28
29
25
29
37.56
2
1
2
3
29
30
15
30
82.34
3
1
1
2
30
31
20
31
94.06
1
1
1
1
31
32
20
32
22.88
2
2
2
2
32
33
25
33
60.07
3
1
1
3
33
34
15
34
48.11
1
3
3
2
34
35
25
35
88.23
2
1
3
1
35
36
25
36
75.44
3
1
3
3
36
37
20
37
45.19
1
2
2
1
37
38
15
38
1.83
2
3
3
1
38
39
20
39
81.31
3
2
3
2
39
40
15
40
60.92
1
1
1
3
40
41
25
41
78.4
2
3
2
1
41
42
20
42
91.25
3
2
1
2
42
43
20
43
73.08
1
2
2
3
43
44
25
44
17.45
2
2
2
2
44
45
15
45
44.02
3
1
1
1
r
=
0.2 Ω/kmFigure 6
The considered 15-node feeder configuration.Table3 shows the obtained switches states from different methods for phase balancing in different conditions. In this table NN and HE are the proposed neural network and heuristic methods in [15], respectively. HM refers to the proposed heuristic method in this paper. In Table 4 the 15-node feeder losses and its first branch (node “1” to node “2”) phase currents are reported. It is obvious that HE [15] is more effective than NN [15]. The best cases are in bold font in Table 4. Average feeder losses over different conditions for different phase balancing, SPB, NN [15], HE [15], and HM are 10.8 kW, 14 kW, 10.8 kW, and 9.44 kW, respectively. Although HE [15] can balance the first branch current better than HM for conditions 2 and 3, its loss is more than that which HM has. The reason is that the unbalanced load position is effective on the feeder losses as well as its value. This fact is not considered in [15, 16]. Table 5 shows the obtained results for phase balancing of 45-node feeder with different methods. Switching table of these methods for 45-node feeder is reported in columns 2–5 of Table 2.Table 3
Switching table of 15-node feeder for different methods of phase balancing.
Node
Condition 1
Condition 2
Condition 3
NN [15]
HE [15]
HM
NN [15]
HE [15]
HM
NN [15]
HE [15]
HM
1
1
1
1
1
1
3
1
1
1
2
2
2
2
2
1
1
2
2
2
3
1
1
3
3
2
2
3
3
1
4
3
3
2
1
3
1
1
2
3
5
1
3
1
3
3
3
1
1
1
6
1
3
3
1
1
3
2
2
3
7
2
2
1
3
3
1
3
3
2
8
3
3
1
1
2
2
1
1
1
9
2
3
2
2
2
2
3
2
1
10
1
1
3
1
1
1
2
3
3
11
3
2
1
3
2
2
2
1
2
12
2
1
2
2
2
1
3
3
2
13
2
2
3
3
1
3
1
3
3
14
2
2
2
2
3
2
1
2
2
15
1
1
1
2
3
1
1
1
1Table 4
Different phase balancing results for 15-node feeder.
I
a (A)
I
b (A)
I
c (A)
Δ
I
m
a
x (A)
Total feeder loss (kW)
Condition 1
SPB
321.36
208.79
352.09
143.30
14.44
NN [15]
422.74
331.16
128.34
294.4
18.05
HE [15]
350.32
237
249.92
113.32
14.07
HM
351.73
261
269.51
90.73
12.33
Condition 2
SPB
189.22
308.59
136.82
171.77
5.98
NN [15]
180.75
159.87
294.01
134.14
6.43
HE [15]
212.02
211.98
210.63
1.39
5.26
HM
221.25
219.25
194.3
27.12
4.83
Condition 3
SPB
311.50
292.58
189.84
121.66
12
NN [15]
379.21
264.88
149.83
229.38
17.55
HE [15]
264.94
265.23
263.75
1.48
12.99
HM
244.58
280.17
267.66
34.08
11.16Table 5
Different phase balancing results for 45-node feeder.
SPB
NN [15]
HE [15]
HM
I
a (A)
822.08
982.7
827.28
775.7
I
b (A)
809.96
755.91
714.21
756.06
I
c (A)
678.75
572.18
769.3
779.03
Δ
I
m
a
x (A)
143.33
410.52
113.07
3.33
Total feeder loss (kW)
118.4
150
119
114.26


### 5.1. Optimization Results

The feasibility of decreasing the number of the used three-phase switches and providing an inexpensive phase balancing system is investigated with GA and MGA. Obtained results of feeder losses for different number of used switches are reported in Figure7. The obtained results from GA and MGA are very close to each other, while MGA is much faster than GA. Mean computation time for GA and MGA is 1.35 seconds and 98 seconds, respectively.Figure 7
Average feeder loss versus number of installed switches in 15-node feeder over different condition of Table1.Another important aspect is that the 15-node feeder average losses are 9.44 kW when three-phase switches are installed in all 15 nodes, while based on Figure7 decreasing switches does not increase feeder losses too much. Selecting the best number of three-phase switches depends on energy cost for utilities.


## 5.1. Optimization Results

The feasibility of decreasing the number of the used three-phase switches and providing an inexpensive phase balancing system is investigated with GA and MGA. Obtained results of feeder losses for different number of used switches are reported in Figure7. The obtained results from GA and MGA are very close to each other, while MGA is much faster than GA. Mean computation time for GA and MGA is 1.35 seconds and 98 seconds, respectively.Figure 7
Average feeder loss versus number of installed switches in 15-node feeder over different condition of Table1.Another important aspect is that the 15-node feeder average losses are 9.44 kW when three-phase switches are installed in all 15 nodes, while based on Figure7 decreasing switches does not increase feeder losses too much. Selecting the best number of three-phase switches depends on energy cost for utilities.


## 6. Conclusion

In this paper a heuristic method is proposed for phase balancing of LV feeders. It applies three-phase switches in some nodes. These switches are controlled locally without any information about the other branches and loads current or the other switches status. These reduce the cost of the phase balancing system due to removing central remote controller and related communication systems. The ability of the proposed method is compared with other phase balancing methods. In comparison with the other dynamic phase balancing methods [14, 15], the location of the unbalanced load is considered in the proposed heuristic method. Simulation results in Table 4 and Figure 7 show merit of the proposed method over the previous ones. Also possibility of using the proposed method in the optimization of the feeder losses with a few number of three-phase switches is investigated. It is shown that using the proposed method decreases computation time of GA convergence considerably. This fact is important especially in the feeders with a lot of nodes.



---

*Source: 6928080-2016-05-31.xml*