# Improved Multiobjective Harmony Search Algorithm with Application to Placement and Sizing of Distributed Generation

Authors: Wanxing Sheng; Ke-yan Liu; Yunhua Li; Yuan Liu; Xiaoli Meng
Journal: Mathematical Problems in Engineering
 (2014)

---

## Abstract

To solve the comprehensive multiobjective optimization problem, this study proposes an improved metaheuristic searching algorithm with combination of harmony search and the fast nondominated sorting approach. This is a kind of the novel intelligent optimization algorithm for multiobjective harmony search (MOHS). The detailed description and the algorithm formulating are discussed. Taking the optimal placement and sizing issue of distributed generation (DG) in distributed power system as one example, the solving procedure of the proposed method is given. Simulation result on modified IEEE 33-bus test system and comparison with NSGA-II algorithm has proved that the proposed MOHS can get promising results for engineering application.


---

## Body

## 1. Introduction

Multiobjective optimization is concerned with mathematical optimization problems involving more than one objective to be optimized simultaneously, and usually these objectives are in conflict with each other. Optimal decisions need to be taken in the presence of tradeoffs between two or more conflicting objectives. It has been applied in many fields of engineering. In [1], a steepest descent method was proposed in the scheduling of a mobile sensor's coverage time among a set of points of interest for optimal tradeoff among different performance goals with regard to the distributions of per point of interest coverage times and exposure times, the entropy and energy efficiency of sensor movement. In [2], in order to solve the optimization problem to minimize energy consumption and reduce total completion time of a single machine, a multiobjective genetic algorithm is proposed to obtain an approximate set of nondominated alternatives. And several rules and heuristics are utilized to increase the speed of the proposed algorithm.There are two approaches in solving the multiobjective optimization problem:(
1
) finding optimal solution by using a weighted sum approach; (
2
) finding optimal solution based on Pareto-optimal front. The first approach aims to solve the multiobjective problem through using the weighting factors to transform the multiple objectives into one objective. In this approach, how to define the weighting factors among the multiple objectives is a difficult problem. And the weighting factors need to be tuned to comprehensively express the optimization relation among the multiple objectives, such as the work carried out in [3–6].The second approach aims to optimize all objective functions simultaneously based on nondominated solutions. In general, a Pareto front which is composed with all candidate solutions for the multiobjective optimization will be achieved at the end of the second approach. And the solution got by the first approach would be one of the nondominated solutions found by the second approach. In [7], in order to avoid the difficulty to assign fitness to individuals in evolutionary algorithm, a novel coevolutionary technique named multiple populations for multiple objectives was proposed. It solved multiple objective problems by letting each population correspond with only one objective. In addition, it also used an external shared archive for different populations to exchange search information and by using two novel designs to enhance the performance.Harmony search (HS) [8] is a metaheuristic algorithm inspired by the improvisation process of musician. In the HS algorithm, each musician which represents decision variable plays a note, namely, generates a value, to obtain the best harmony which means global optimum. The standard HS performs well in finding optimum but it encounters problems when facing multiobjective optimization problem. The main drawback of standard HS is that it generates only one solution at the end of search, and the optimization solution critically depends on the selected weights for each cost function. A multiobjective harmony search (MOHS) algorithm for optimal power flow was investigated in [9]. Fast elitist nondominated sorting and crowding distance had been used to find and manage the Pareto optimal front. In [10], a version of MOHS was introduced to solve the two-dimensional optimization problem. However, in that algorithm, when a new harmony is generated, the harmony memory had to be reordered to determine whether the new generated harmony replaces an existing one or not. It takes a huge amount of time as there are dozens of new harmonies generated in each iteration. In order to deal with above problem, an improved MOHS was proposed to combine the standard HS with the fast nondominated approach to find the Pareto-optimal front of feasible solutions in this paper. And the best compromised solution can be extracted from Pareto-optimal front through a method based on the fuzzy theory.In this paper, the proposed MOHS is utilized to solve the multiobjective optimization problem for the integration of distributed generation (DG). DG can effectively improve the stability, power quality, and energy efficiency in addition to the environment protection [11]. Taking full benefit of DG units in distribution power system will depend on the detail position and capacity of DG units in the system, the DG placement and sizing become an optimal planning problem to solve in power utility. In addition, along with the strict demands of distribution power system operation safely, the optimal placement and sizing of DG problem no longer only focus on the single objective such as minimum power loss or investment cost consideration, but it also takes other objectives like voltage quality and operation stability into consideration [12]. In recent literatures, the DG allocation is optimized to minimize power loss of the system, enhance reliability, and improve voltage profile with a novel approach based on dynamic programming in [13]. Time varying load was also applied and cost/benefit forms were used in the optimization to reach pragmatic results. In [14], a new optimization problem was proposed to determine the maximum DG penetration level with the consideration of harmonic and protection coordination limits. In this paper, three objectives as minimum power loss, minimum voltage deviation, and maximal voltage stability margin are taken into account for the optimal placement and sizing of DG.The rest of the paper is organized as follows. Section2 presents the detailed procedure of the proposed MOHS algorithm. The application of MOHS for optimal placement and sizing of DG is formed in Section 3. Numerical optimization results and comparisons with NSGA-II are provided in Section 4 in IEEE 33-bus test case using the proposed MOHS algorithm. Section 5 summarizes the main contributions and conclusions.


## 2. Formulation of Multiobjective Optimization Problem

In a general formulation, a multiobjective optimization problem withm objectives and n controlling variables can be described as follows:
(1)
min
⁡
y
=
F
(
x
)
=
(
f
1
(
x
)
,
f
2
(
x
)
,
…
,
f
m
(
x
)
)
T
,
s
s
.
t
.
s
g
i
(
x
)
≤
0
,
i
=
1,2
,
…
,
q
,
s
.
t
.
s
s
h
j
(
x
)
=
0
,
j
=
1,2
,
…
,
p
,
where x
=
(
x
1
,
x
2
,
…
,
x
n
)
∈
X
⊂
R
n is the n-dimension decision vector, X is the n-dimension decision space, and y
=
(
y
1
,
y
2
,
…
,
y
m
)
∈
Y
⊂
R
m is the m-dimension objective vector. F
(
x
) is the mapping function from the decision space to objective space. g
i
(
x
)
≤
0 is the ith inequality constraint and h
j
(
x
)
=
0 is the jth inequality constraint. q and p are the number of inequality and equality constraints, respectively.In order to solve the multiobjective optimization problem using the proposed MOHS algorithm, several definitions should be clarified as follows.Definition 1.
A solutionx
1 is said to dominate x
2 (denoted by x
1
≺
x
2) if and only if
(2)
∀
i
∈
{
1,2
,
…
,
m
}
:
f
i
(
x
1
)
≤
f
i
(
x
2
)
∧
∃
j
∈
{
1,2
,
…
,
m
}
:
f
j
(
x
1
)
<
f
j
(
x
2
)
.Definition 2.
ForS
=
{
x
i
,
i
=
1
,
…
,
n
}, solution x is said to be a nondominated solution (Pareto solution) of set S if x
∈
S, and there is no solution x
′
∈
S for which x
′ dominates x.Definition 3.
Assume that setP contains all nondominated solutions of S; then P
F
=
{
v
∣
v
=
[
f
1
(
x
)
,
f
2
(
x
)
,
…
,
f
m
(
x
)
]
T
,
x
∈
P
} is a Pareto front of set S.


## 3. Proposed MOHS Algorithm

### 3.1. Overview of HS

The standard HS algorithm is based on the natural musical process which searches for perfect state of harmony. Its steps include parameters initialization, initializing the harmony memory (HM), and iterations of improvising a new harmony from the harmony memory and updating harmony memory. The HS algorithm does not require initial values for the decision variables and uses a stochastic random search. In general, the HS algorithm works as follows [8, 10].Step 1.
Define the objective function and decision variables. Input the system parameters and the boundaries of the decision variables.
The HS algorithm parameters are specified in this step. They are the harmony memory size (HMS) or the number of solution vectors in harmony memory, the harmony memory considering rate (HMCR), the distance bandwidth (bw), the pitch adjusting rate (PAR), and the number of improvisations (K) or stopping criterion, where K is the same as the total number of function evaluations.Step 2.
Initialize the harmony memory (HM). The harmony memory is a memory location where all the solution vectors (sets of decision variables) are stored. The initial harmony memory is randomly generated.Step 3.
Improvise a new harmony from the harmony memory. Generating a new harmonyx
new is called improvisation, which is based on 3 rules: memory consideration, pitch adjustment, and random selection. First of all, a uniform random number r is generated in the range [
0
,
1
]. If r is less than the HMCR, the decision variable x
i
new is generated by the memory consideration; otherwise, x
i
new is obtained by a random selection. Then, each decision variable will undergo a pitch adjustment with a probability of PAR if it is produced by the memory consideration. The pitch adjustment rule is given as follows:
(3)
x
i
new
=
x
i
new
+
r
×
bw
,
x
new
=
(
x
1
new
,
x
2
new
,
…
,
x
N
new
)
.Step 4.
Update harmony memory. After generating a new harmony vectorx
new, the harmony memory will be updated. If the fitness of the improvised harmony vector is better than that of the worst harmony, the worst harmony in the HM will be replaced with x
new and become a new member of the HM.Step 5.
Repeat Steps3 and 4 until the stopping criterion (maximum number of improvisations, K) is met.


### 3.2. MOHS Algorithm

In order to solve the comprehensive multiobjective optimization problem, the fast nondominated sorting approach described in NSGA-II [15] is employed in HS. In the proposed MOHS, an archive [16] is maintained which contains the representation of nondominated harmonies. The details of proposed MOHS algorithm for optimal placement and sizing of DG are described as follows.Step 1 (initialize parameters).
Initializing parameters includes harmony memory size (HMS), archive size (AS), and harmony memory considering rate (HMCR).Step 2 (initialize harmonies in HM).
Initialize the HM randomly within the boundaries of independent variables, and the initialized HM can be described as follows:(4)
HM
=
[
x
1
1
x
2
1
⋯
x
n
1
x
1
2
x
2
2
⋯
x
n
2
⋮
⋮
⋯
⋮
x
1
HMS
x
2
HMS
⋯
x
n
HMS
]
.
The first row in HM composes the first harmony, and so on and so forth for the rest of rows in HM.Step 3 (generate the archive).
(
1
) Calculate the power flow of distribution power system according to pitches of each harmony in HM, and compute each objective function value.
(
2
) Rank the harmonies in HM through fast nondominated sorting approach, and then the nondominated harmonies with rank 1 are moved to archive; harmonies with other ranks remain in HM.Step 4 (generate new harmonies).
(
1
) Select a harmony X
N
d randomly from the archive and another harmony X
d randomly from the HM.
(
2
) A new harmony is generated from X
N
d and X
d as follows:
(5)
x
i
New
=
x
i
N
d
+
rand
(
-
1,1
)
x
i
N
e
w
=
×
(
x
i
N
d
-
x
i
d
)
if
rand
(
0,1
)
<
HMRC
x
i
New
=
x
i
min
⁡
+
rand
(
0,1
)
x
i
N
e
w
=
×
(
x
i
max
⁡
-
x
i
min
⁡
)
if
rand
(
0,1
)
≥
HMRC
000000000000000000000000
i
=
1,2
,
3
,
…
,
N
H
,
where x
i
New is the ith pitch in the new harmony, x
i
N
d is the ith pitch in X
N
d, x
i
d is the ith pitch in X
d, x
i
max
⁡ and x
i
min
⁡ are the upper and lower boundaries of ith pitch, and N
H is the number of pitches in a harmony. If a new pitch is beyond the boundary, it will be set as the boundary value. (1)
Repeat Steps4
(
1
) and 4
(
2
) for HMS times.
(2)
Calculate the power flow of distribution power system according to pitches of each new generated harmony, and compute each objective function value.Step 5 (update the archive and HM).
Combine the current archive, HM and new generated harmonies together, and then sort the gathered harmonies using fast nondominated sorting approach. The harmonies with rank 1 are moved to archive. If the number of harmonies with rank 1 is larger than AS, for the sake of diversity preservation, the crowded-comparison operator [15] is introduced to select the better harmonies to constitute archive. Then harmonies with other ranks remain in HM. If the number of harmonies in HM is less than HMS, in order to keep diversity of HM, the rest of HMS is filled with appropriate number of randomly generated harmonies.Step 6 (check for the stopping criterion).
If the maximum number of iterations is met, turn to Step7; otherwise, turn to Step 4.Step 7 (obtain the best compromised solution).
The harmonies in archive compose the Pareto-optimal front of feasible solutions. The best compromise solution is extracted from archive based on the fuzzy theory [17]. The details can be described as follows.(1)
Search through all solutions; theF
i
min
⁡ and F
i
max
⁡ corresponding to ith objective function can be found.
(2)
The membership function valueτ
i
k of ith objective function F
i for the solution k is defined as
(6)
τ
i
k
=
{
1
F
i
≤
F
i
min
⁡
F
i
max
⁡
-
F
i
F
i
max
⁡
-
F
i
min
⁡
F
i
min
⁡
<
F
i
<
F
i
max
⁡
0
F
i
≥
F
i
max
⁡
,
where F
i
max
⁡ and F
i
min
⁡ are the maximum and minimum of ith objective function among all nondominated solutions, respectively. The above equation provides a measure of the degree of satisfaction for each objective function for a particular solution.
(3)
The corresponding membership functionτ
k for each solution k in Pareto solution set is calculated as follows:
(7)
τ
k
=
∑
i
=
1
N
obj
τ
i
k
∑
k
=
1
M
∑
i
=
1
N
obj
τ
i
k
,
where M is the number of Pareto solutions and N
obj is the number of optimization objectives.
(4)
The best compromised solution is the one achieving the maximum ofτ
k.The overall procedures of the proposed MOHS algorithm are illustrated in Figure 1.Figure 1
Flow chart of the proposed MOHS algorithm.


## 3.1. Overview of HS

The standard HS algorithm is based on the natural musical process which searches for perfect state of harmony. Its steps include parameters initialization, initializing the harmony memory (HM), and iterations of improvising a new harmony from the harmony memory and updating harmony memory. The HS algorithm does not require initial values for the decision variables and uses a stochastic random search. In general, the HS algorithm works as follows [8, 10].Step 1.
Define the objective function and decision variables. Input the system parameters and the boundaries of the decision variables.
The HS algorithm parameters are specified in this step. They are the harmony memory size (HMS) or the number of solution vectors in harmony memory, the harmony memory considering rate (HMCR), the distance bandwidth (bw), the pitch adjusting rate (PAR), and the number of improvisations (K) or stopping criterion, where K is the same as the total number of function evaluations.Step 2.
Initialize the harmony memory (HM). The harmony memory is a memory location where all the solution vectors (sets of decision variables) are stored. The initial harmony memory is randomly generated.Step 3.
Improvise a new harmony from the harmony memory. Generating a new harmonyx
new is called improvisation, which is based on 3 rules: memory consideration, pitch adjustment, and random selection. First of all, a uniform random number r is generated in the range [
0
,
1
]. If r is less than the HMCR, the decision variable x
i
new is generated by the memory consideration; otherwise, x
i
new is obtained by a random selection. Then, each decision variable will undergo a pitch adjustment with a probability of PAR if it is produced by the memory consideration. The pitch adjustment rule is given as follows:
(3)
x
i
new
=
x
i
new
+
r
×
bw
,
x
new
=
(
x
1
new
,
x
2
new
,
…
,
x
N
new
)
.Step 4.
Update harmony memory. After generating a new harmony vectorx
new, the harmony memory will be updated. If the fitness of the improvised harmony vector is better than that of the worst harmony, the worst harmony in the HM will be replaced with x
new and become a new member of the HM.Step 5.
Repeat Steps3 and 4 until the stopping criterion (maximum number of improvisations, K) is met.


## 3.2. MOHS Algorithm

In order to solve the comprehensive multiobjective optimization problem, the fast nondominated sorting approach described in NSGA-II [15] is employed in HS. In the proposed MOHS, an archive [16] is maintained which contains the representation of nondominated harmonies. The details of proposed MOHS algorithm for optimal placement and sizing of DG are described as follows.Step 1 (initialize parameters).
Initializing parameters includes harmony memory size (HMS), archive size (AS), and harmony memory considering rate (HMCR).Step 2 (initialize harmonies in HM).
Initialize the HM randomly within the boundaries of independent variables, and the initialized HM can be described as follows:(4)
HM
=
[
x
1
1
x
2
1
⋯
x
n
1
x
1
2
x
2
2
⋯
x
n
2
⋮
⋮
⋯
⋮
x
1
HMS
x
2
HMS
⋯
x
n
HMS
]
.
The first row in HM composes the first harmony, and so on and so forth for the rest of rows in HM.Step 3 (generate the archive).
(
1
) Calculate the power flow of distribution power system according to pitches of each harmony in HM, and compute each objective function value.
(
2
) Rank the harmonies in HM through fast nondominated sorting approach, and then the nondominated harmonies with rank 1 are moved to archive; harmonies with other ranks remain in HM.Step 4 (generate new harmonies).
(
1
) Select a harmony X
N
d randomly from the archive and another harmony X
d randomly from the HM.
(
2
) A new harmony is generated from X
N
d and X
d as follows:
(5)
x
i
New
=
x
i
N
d
+
rand
(
-
1,1
)
x
i
N
e
w
=
×
(
x
i
N
d
-
x
i
d
)
if
rand
(
0,1
)
<
HMRC
x
i
New
=
x
i
min
⁡
+
rand
(
0,1
)
x
i
N
e
w
=
×
(
x
i
max
⁡
-
x
i
min
⁡
)
if
rand
(
0,1
)
≥
HMRC
000000000000000000000000
i
=
1,2
,
3
,
…
,
N
H
,
where x
i
New is the ith pitch in the new harmony, x
i
N
d is the ith pitch in X
N
d, x
i
d is the ith pitch in X
d, x
i
max
⁡ and x
i
min
⁡ are the upper and lower boundaries of ith pitch, and N
H is the number of pitches in a harmony. If a new pitch is beyond the boundary, it will be set as the boundary value. (1)
Repeat Steps4
(
1
) and 4
(
2
) for HMS times.
(2)
Calculate the power flow of distribution power system according to pitches of each new generated harmony, and compute each objective function value.Step 5 (update the archive and HM).
Combine the current archive, HM and new generated harmonies together, and then sort the gathered harmonies using fast nondominated sorting approach. The harmonies with rank 1 are moved to archive. If the number of harmonies with rank 1 is larger than AS, for the sake of diversity preservation, the crowded-comparison operator [15] is introduced to select the better harmonies to constitute archive. Then harmonies with other ranks remain in HM. If the number of harmonies in HM is less than HMS, in order to keep diversity of HM, the rest of HMS is filled with appropriate number of randomly generated harmonies.Step 6 (check for the stopping criterion).
If the maximum number of iterations is met, turn to Step7; otherwise, turn to Step 4.Step 7 (obtain the best compromised solution).
The harmonies in archive compose the Pareto-optimal front of feasible solutions. The best compromise solution is extracted from archive based on the fuzzy theory [17]. The details can be described as follows.(1)
Search through all solutions; theF
i
min
⁡ and F
i
max
⁡ corresponding to ith objective function can be found.
(2)
The membership function valueτ
i
k of ith objective function F
i for the solution k is defined as
(6)
τ
i
k
=
{
1
F
i
≤
F
i
min
⁡
F
i
max
⁡
-
F
i
F
i
max
⁡
-
F
i
min
⁡
F
i
min
⁡
<
F
i
<
F
i
max
⁡
0
F
i
≥
F
i
max
⁡
,
where F
i
max
⁡ and F
i
min
⁡ are the maximum and minimum of ith objective function among all nondominated solutions, respectively. The above equation provides a measure of the degree of satisfaction for each objective function for a particular solution.
(3)
The corresponding membership functionτ
k for each solution k in Pareto solution set is calculated as follows:
(7)
τ
k
=
∑
i
=
1
N
obj
τ
i
k
∑
k
=
1
M
∑
i
=
1
N
obj
τ
i
k
,
where M is the number of Pareto solutions and N
obj is the number of optimization objectives.
(4)
The best compromised solution is the one achieving the maximum ofτ
k.The overall procedures of the proposed MOHS algorithm are illustrated in Figure 1.Figure 1
Flow chart of the proposed MOHS algorithm.


## 4. Practical Example

### 4.1. Problem Formulation for Optimal Placement and Sizing of DG

#### 4.1.1. Objective Functions

The integration of DG brings benefits to distribution power system on many aspects such as power quality improvement and line loss reduction. In order to reflect the influence of DG integration to economic performance, power quality, and operation stability, in this paper, minimum power loss, minimum voltage deviation, and maximal voltage stability margin are taken into consideration as objectives for optimal placement and sizing of DG.Minimization of Power Loss. The first objective is to minimize system line losses after DG injection into distribution network. This objective can be expressed by the following function as
(8)
F
1
(
x
)
=
∑
(
i
,
j
)
∈
B
g
i
j
(
V
i
2
+
V
j
2
-
2
V
i
V
j
cos
⁡
θ
i
j
)
,
where B is the set of branches of network, and (
i
,
j
)
∈
B means (
i
,
j
) are two buses of a branch. V
i and V
j are voltage magnitudes of bus i and j. g
i
j is the conductance between bus i and j. θ
i
j is the phase angle difference between nodal phase angles θ
i and θ
j.Minimization of Voltage Deviation. The second objective is to minimize the voltage deviation between nodal voltage and specified voltage magnitude
(9)
F
2
(
x
)
=
∑
i
=
0
n
(
V
i
-
V
i
spec
V
i
max
⁡
-
V
i
min
⁡
)
2
,
where V
i is the voltage magnitude at ith bus and V
i
spec is the specified voltage magnitude. V
i
max
⁡ and V
i
min
⁡ are the upper limit and lower limit at ith bus, respectively.Maximization of Voltage Stability Margin. The third objective is to maximize steady-state voltage stability margin. A fast indicator of voltage stability, L-index, is chosen as the indicator for voltage stability index. L-index was presented by Kessel and Glavitsch [18] and developed by Jasmon and Lee [19]. The L-index of branch i
j can be expressed as follows:
(10)
L
i
j
=
4
[
(
P
j
X
i
j
-
Q
j
R
i
j
)
2
+
(
P
j
R
i
j
+
Q
j
X
i
j
)
V
i
2
]
V
i
4
.The branch voltage will not be stable if the value ofL
i
j is close to 1, so the most instable branch in voltage stability perspective can be expressed as
(11)
L
=
max
⁡
⁡
(
L
i
j
)
,
(
i
,
j
)
∈
B
,
where L is the system voltage stability indicator. The steady-state voltage stability margin maximization can be further expressed as
(12)
max
⁡
⁡
(
1
-
L
)
⟹
min
⁡
⁡
F
3
(
x
)
=
min
⁡
⁡
L
.


#### 4.1.2. Constraints

The variables in distribution power system with DG integration should satisfy the equality constraints of power flow and the inequality constraints include voltage limits of load bus and thermal limits of branch. In addition, the integration of DG is under constraints including DG output limits and penetration constraints of distribution power system.Power flow equations describe the relationships among status variables in distribution power system operation. They are used as equality constraints as follows:(13)
P
DG
i
-
P
d
i
=
V
i
∑
j
=
1
N
V
j
(
G
i
j
cos
⁡
⁡
θ
i
j
+
B
i
j
sin
⁡
θ
i
j
)
,
Q
DG
i
-
Q
d
i
=
V
i
∑
j
=
1
N
V
j
(
G
i
j
sin
⁡
θ
i
j
-
B
i
j
cos
⁡
⁡
θ
i
j
)
,
where P
DG
i and Q
DG
i are active and reactive generation outputs, whereas P
d
i and Q
d
i are active and reactive loads at bus i, respectively, G
i
j and B
i
j are real and imaginary parts of nodal admittance matrix, respectively, and N is the number of buses.The inequality constraints can be described as follows:(i)
load bus voltage constraints:(14)
V
i
min
⁡
≤
V
i
≤
V
i
max
⁡
;
(ii)
thermal limits:(15)
|
S
i
j
|
=
|
V
i
2
G
i
j
-
V
i
V
j
(
G
i
j
cos
⁡
θ
i
j
+
B
i
j
sin
θ
i
j
)
|
≤
S
i
j
max
⁡
;
(iii)
generation output limits:(16)
P
DG
i
min
⁡
≤
P
DG
i
≤
P
DG
i
max
⁡
,
Q
DG
i
min
⁡
≤
Q
DG
i
≤
Q
DG
i
max
⁡
;
(iv)
DG penetration constraint:(17)
∑
i
=
1
n
P
DG
i
≤
0.25
S
max
⁡
,
(
i
∈
Φ
S
)
,where P
DG
i is the DG access capacity at bus i and S
max
⁡ is the maximum load capacity of distribution network.


#### 4.1.3. Overview Formulation

Aggregating objectives and constraints, the problem can be formed as a nonlinear programming problem as follows:(18)
min
⁡
[
F
1
(
x
)
,
F
2
(
x
)
,
F
3
(
x
)
]
s
s
.
t
.
2
h
i
(
x
)
=
i
=
1,2
,
…
,
n
eq
s
.
t
.
s
2
g
i
(
x
)
≤
0
i
=
1,2
,
…
,
n
ineq
,
where x is the vector of independent variables, n
eq is the number of equality constraints, and n
ineq is the number of inequality constraints. It is assumed that the DG has a prespecified power factor; and then there will be two control variables per DG installed, which can be shown as
(19)
x
T
=
[
Lo
c
D
G
1
,
P
D
G
1
,
…
,
Lo
c
D
G
N
DG
,
P
D
G
N
_
DG
]
,
where Lo
c
DG indicates the location of DG integration, P
DG indicates the active power output of DG, and N
_
DG is the maximal allowable injection number of DG.


### 4.2. Experiment Setting

To demonstrate the effectiveness of the proposed algorithm MOHS, the DG planning in the IEEE 33-bus test system is utilized as an example. The single line diagram of IEEE 33-bus system is shown in Figure2, and its penetration rate is set as 25%. Parameters used in MOHS are set as MHS
=
100, AS
=
200, and HMCR
=
0.9. According to the experiments we have made, for the vast majority of distribution power system, the MOHS can obtain the Pareto solution set within 100 iterations. Without loss of generality, the maximum number of iteration in MOHS is set as 100.Figure 2
The Pareto solution set of MOHS for IEEE 33-bus system.


### 4.3. Optimization Results

At the last round of iteration in MOHS, the harmonies in archive compose the Pareto solution set of the optimization problem, which is shown in Figure2. As displayed in Figure 2, each blue point represents a candidate solution in Pareto solution set. It shows that the MOHS has good global searching capability and the candidate solutions have uniform distribution. In addition, in order to demonstrate the advantages of MOHS to HS, the optimization results obtained by HS at different weights of objectives are also displayed in Figure 2. The red, brown, and green points represent the optimization solutions for cases A, B, and C which have massive differences among the three objective weights listed in Table 1, respectively. It shows that the three points are among the Pareto solution set of MOHS. It means that the candidate solutions of MOHS contain the optimized solutions in these three circumstances.Table 1
Optimization objective weights configuration.
Case
Optimization objective weights
1st
2nd
3rd
A
0.8
0.1
0.1
B
0.1
0.8
0.1
C
0.1
0.1
0.8The optimization solution will be obtained by HS only if the weight for each objective is prespecified. And when the preference of decision maker is changed, the previously obtained solution is useless and the whole process of HS algorithm must be repeated again to get a new solution. For MOHS, when the weights of objectives are changed, the final solution can be extracted from the Pareto solution set using different weights, without necessity to obtain the Pareto solution set again. Compared with HS, the proposed MOHS has great convenience and rapidity for variable weight multiobjective optimization problem.The best compromised solution and corresponding multiobjective function values of IEEE-33 system with and without DG units are illustrated in Table2. As shown in Table 2, DG units are integrated to distribution power system at buses 17 and 32, namely, the end of each main feeder, with the size of 0.5137 MW and 0.4248 MW, respectively. Compared with the case without DG, the integrated scheme has significant decrease in the three objective function values, which reduce 49.9%, 29.2%, and 68.1% respectively. The effectiveness of solution obtained by MOHS can be demonstrated from the optimization results.Table 2
Result of IEEE 33-bus test system.
DG planning scheme
Multiobjective function values
Position
Capacity (MW)
Power loss (MW)
Voltage stability index
Voltage deviation
17
0.5137
0.1016
0.0528
3.7405
32
0.4248
Without DG units
0.2027
0.0746
11.7102


### 4.4. Algorithms Comparison

To demonstrate the global searching capability and convergence speed, the proposed MOHS is compared with the classic multiobjective evolution algorithm NSGA-II. Evaluation of multiobjective optimization algorithm is much complex than the single objective one; herein theC metric [20] and outer solution [16] are utilized to illustrate the difference of optimization searching performance between MOHS and NSGA-II.


#### 4.4.1.C Metric

Definition 4.
LetX
′ and X
′
′ be two Pareto sets, the function C represents the coverage extent of the ordered pair (
X
′
,
X
′
′
) in the interval [
0
,
1
]:
(20)
C
(
X
′
,
X
′′
)
=
|
{
a
′′
∈
X
′′
;
∃
a
′
∈
X
′
:
a
′
≺
a
′′
}
|
|
X
′′
|
.The valueC
(
X
′
,
X
′
′
)
=
1 means that all solutions in X
′
′ are dominated by solutions in X
′. The opposite condition, C
(
X
′
,
X
′
′
)
=
0, represents the situation that none of solutions in X
′
′ are covered by the set X
′. Note that both C
(
X
′
,
X
′
′
) and C
(
X
′
′
,
X
′
) have to be considered, since C
(
X
′
,
X
′
′
) is not necessarily equal to 1
-
C
(
X
′
′
,
X
′
).Box-plot is a common tool to display distribution of statistical results, which is employed here to visualize theC metric results of MOHS and NSGA-II. Each algorithm runs 30 times, respectively, and the C metric results are demonstrated in Figure 3. As shown in Figure 3, the left box represents how many solutions of MOHS are dominated by solutions of NSGA-II, the right box represents how many solutions of NSGA-II are dominated by solutions of MOHS. The C (NSGA-II, MOEA) has much lower distribution than the C (MOEA, NSGA-II); namely, the solution set of MOEA has much better nondominated performance compared with NSGA-II. It shows that the proposed MOHS performs even better in finding the approximate Pareto-optimal front of feasible solutions.Figure 3
Box-plot ofC metric.


#### 4.4.2. Outer Solution Evolutionary Process

Outer solution is defined as the solution which has the minimum value for certain objective in Pareto-optimal front. It can be described as(21)
s
l
(
k
)
=
{
x
i
∣
∀
x
j
∈
X
(
k
)
:
f
l
(
x
i
)
≤
f
l
(
x
j
)
}
,
where s
l
(
k
) is the outer solution corresponding to lth objective at the kth iteration, X
(
k
) is the solution set at the kth iteration, and f
l
(
x
i
) is the lth objective function value of solution x
i. The speed of optimization searching can be illustrated through analyzing the evolutionary process of outer solution.The evolutionary process of outer solution for power loss is shown in Figure4. The outer solutions for power loss converge to the same value after 15 iterations according to MOHS and NSGA-II. It means that the two algorithms achieve the approximate optimum after several iterations. However, MOHS shows better searching speed as it rapidly converges to optimum less than 10 iterations. The evolutionary process of outer solution for the other two objectives has the similar performance with power loss. Through demonstrating the evolutionary process of outer solution, it is proved that the MOHS has a better performance in searching rapidity.Figure 4
Evolutionary process of outer solution for power loss.


## 4.1. Problem Formulation for Optimal Placement and Sizing of DG

### 4.1.1. Objective Functions

The integration of DG brings benefits to distribution power system on many aspects such as power quality improvement and line loss reduction. In order to reflect the influence of DG integration to economic performance, power quality, and operation stability, in this paper, minimum power loss, minimum voltage deviation, and maximal voltage stability margin are taken into consideration as objectives for optimal placement and sizing of DG.Minimization of Power Loss. The first objective is to minimize system line losses after DG injection into distribution network. This objective can be expressed by the following function as
(8)
F
1
(
x
)
=
∑
(
i
,
j
)
∈
B
g
i
j
(
V
i
2
+
V
j
2
-
2
V
i
V
j
cos
⁡
θ
i
j
)
,
where B is the set of branches of network, and (
i
,
j
)
∈
B means (
i
,
j
) are two buses of a branch. V
i and V
j are voltage magnitudes of bus i and j. g
i
j is the conductance between bus i and j. θ
i
j is the phase angle difference between nodal phase angles θ
i and θ
j.Minimization of Voltage Deviation. The second objective is to minimize the voltage deviation between nodal voltage and specified voltage magnitude
(9)
F
2
(
x
)
=
∑
i
=
0
n
(
V
i
-
V
i
spec
V
i
max
⁡
-
V
i
min
⁡
)
2
,
where V
i is the voltage magnitude at ith bus and V
i
spec is the specified voltage magnitude. V
i
max
⁡ and V
i
min
⁡ are the upper limit and lower limit at ith bus, respectively.Maximization of Voltage Stability Margin. The third objective is to maximize steady-state voltage stability margin. A fast indicator of voltage stability, L-index, is chosen as the indicator for voltage stability index. L-index was presented by Kessel and Glavitsch [18] and developed by Jasmon and Lee [19]. The L-index of branch i
j can be expressed as follows:
(10)
L
i
j
=
4
[
(
P
j
X
i
j
-
Q
j
R
i
j
)
2
+
(
P
j
R
i
j
+
Q
j
X
i
j
)
V
i
2
]
V
i
4
.The branch voltage will not be stable if the value ofL
i
j is close to 1, so the most instable branch in voltage stability perspective can be expressed as
(11)
L
=
max
⁡
⁡
(
L
i
j
)
,
(
i
,
j
)
∈
B
,
where L is the system voltage stability indicator. The steady-state voltage stability margin maximization can be further expressed as
(12)
max
⁡
⁡
(
1
-
L
)
⟹
min
⁡
⁡
F
3
(
x
)
=
min
⁡
⁡
L
.


### 4.1.2. Constraints

The variables in distribution power system with DG integration should satisfy the equality constraints of power flow and the inequality constraints include voltage limits of load bus and thermal limits of branch. In addition, the integration of DG is under constraints including DG output limits and penetration constraints of distribution power system.Power flow equations describe the relationships among status variables in distribution power system operation. They are used as equality constraints as follows:(13)
P
DG
i
-
P
d
i
=
V
i
∑
j
=
1
N
V
j
(
G
i
j
cos
⁡
⁡
θ
i
j
+
B
i
j
sin
⁡
θ
i
j
)
,
Q
DG
i
-
Q
d
i
=
V
i
∑
j
=
1
N
V
j
(
G
i
j
sin
⁡
θ
i
j
-
B
i
j
cos
⁡
⁡
θ
i
j
)
,
where P
DG
i and Q
DG
i are active and reactive generation outputs, whereas P
d
i and Q
d
i are active and reactive loads at bus i, respectively, G
i
j and B
i
j are real and imaginary parts of nodal admittance matrix, respectively, and N is the number of buses.The inequality constraints can be described as follows:(i)
load bus voltage constraints:(14)
V
i
min
⁡
≤
V
i
≤
V
i
max
⁡
;
(ii)
thermal limits:(15)
|
S
i
j
|
=
|
V
i
2
G
i
j
-
V
i
V
j
(
G
i
j
cos
⁡
θ
i
j
+
B
i
j
sin
θ
i
j
)
|
≤
S
i
j
max
⁡
;
(iii)
generation output limits:(16)
P
DG
i
min
⁡
≤
P
DG
i
≤
P
DG
i
max
⁡
,
Q
DG
i
min
⁡
≤
Q
DG
i
≤
Q
DG
i
max
⁡
;
(iv)
DG penetration constraint:(17)
∑
i
=
1
n
P
DG
i
≤
0.25
S
max
⁡
,
(
i
∈
Φ
S
)
,where P
DG
i is the DG access capacity at bus i and S
max
⁡ is the maximum load capacity of distribution network.


### 4.1.3. Overview Formulation

Aggregating objectives and constraints, the problem can be formed as a nonlinear programming problem as follows:(18)
min
⁡
[
F
1
(
x
)
,
F
2
(
x
)
,
F
3
(
x
)
]
s
s
.
t
.
2
h
i
(
x
)
=
i
=
1,2
,
…
,
n
eq
s
.
t
.
s
2
g
i
(
x
)
≤
0
i
=
1,2
,
…
,
n
ineq
,
where x is the vector of independent variables, n
eq is the number of equality constraints, and n
ineq is the number of inequality constraints. It is assumed that the DG has a prespecified power factor; and then there will be two control variables per DG installed, which can be shown as
(19)
x
T
=
[
Lo
c
D
G
1
,
P
D
G
1
,
…
,
Lo
c
D
G
N
DG
,
P
D
G
N
_
DG
]
,
where Lo
c
DG indicates the location of DG integration, P
DG indicates the active power output of DG, and N
_
DG is the maximal allowable injection number of DG.


## 4.1.1. Objective Functions

The integration of DG brings benefits to distribution power system on many aspects such as power quality improvement and line loss reduction. In order to reflect the influence of DG integration to economic performance, power quality, and operation stability, in this paper, minimum power loss, minimum voltage deviation, and maximal voltage stability margin are taken into consideration as objectives for optimal placement and sizing of DG.Minimization of Power Loss. The first objective is to minimize system line losses after DG injection into distribution network. This objective can be expressed by the following function as
(8)
F
1
(
x
)
=
∑
(
i
,
j
)
∈
B
g
i
j
(
V
i
2
+
V
j
2
-
2
V
i
V
j
cos
⁡
θ
i
j
)
,
where B is the set of branches of network, and (
i
,
j
)
∈
B means (
i
,
j
) are two buses of a branch. V
i and V
j are voltage magnitudes of bus i and j. g
i
j is the conductance between bus i and j. θ
i
j is the phase angle difference between nodal phase angles θ
i and θ
j.Minimization of Voltage Deviation. The second objective is to minimize the voltage deviation between nodal voltage and specified voltage magnitude
(9)
F
2
(
x
)
=
∑
i
=
0
n
(
V
i
-
V
i
spec
V
i
max
⁡
-
V
i
min
⁡
)
2
,
where V
i is the voltage magnitude at ith bus and V
i
spec is the specified voltage magnitude. V
i
max
⁡ and V
i
min
⁡ are the upper limit and lower limit at ith bus, respectively.Maximization of Voltage Stability Margin. The third objective is to maximize steady-state voltage stability margin. A fast indicator of voltage stability, L-index, is chosen as the indicator for voltage stability index. L-index was presented by Kessel and Glavitsch [18] and developed by Jasmon and Lee [19]. The L-index of branch i
j can be expressed as follows:
(10)
L
i
j
=
4
[
(
P
j
X
i
j
-
Q
j
R
i
j
)
2
+
(
P
j
R
i
j
+
Q
j
X
i
j
)
V
i
2
]
V
i
4
.The branch voltage will not be stable if the value ofL
i
j is close to 1, so the most instable branch in voltage stability perspective can be expressed as
(11)
L
=
max
⁡
⁡
(
L
i
j
)
,
(
i
,
j
)
∈
B
,
where L is the system voltage stability indicator. The steady-state voltage stability margin maximization can be further expressed as
(12)
max
⁡
⁡
(
1
-
L
)
⟹
min
⁡
⁡
F
3
(
x
)
=
min
⁡
⁡
L
.


## 4.1.2. Constraints

The variables in distribution power system with DG integration should satisfy the equality constraints of power flow and the inequality constraints include voltage limits of load bus and thermal limits of branch. In addition, the integration of DG is under constraints including DG output limits and penetration constraints of distribution power system.Power flow equations describe the relationships among status variables in distribution power system operation. They are used as equality constraints as follows:(13)
P
DG
i
-
P
d
i
=
V
i
∑
j
=
1
N
V
j
(
G
i
j
cos
⁡
⁡
θ
i
j
+
B
i
j
sin
⁡
θ
i
j
)
,
Q
DG
i
-
Q
d
i
=
V
i
∑
j
=
1
N
V
j
(
G
i
j
sin
⁡
θ
i
j
-
B
i
j
cos
⁡
⁡
θ
i
j
)
,
where P
DG
i and Q
DG
i are active and reactive generation outputs, whereas P
d
i and Q
d
i are active and reactive loads at bus i, respectively, G
i
j and B
i
j are real and imaginary parts of nodal admittance matrix, respectively, and N is the number of buses.The inequality constraints can be described as follows:(i)
load bus voltage constraints:(14)
V
i
min
⁡
≤
V
i
≤
V
i
max
⁡
;
(ii)
thermal limits:(15)
|
S
i
j
|
=
|
V
i
2
G
i
j
-
V
i
V
j
(
G
i
j
cos
⁡
θ
i
j
+
B
i
j
sin
θ
i
j
)
|
≤
S
i
j
max
⁡
;
(iii)
generation output limits:(16)
P
DG
i
min
⁡
≤
P
DG
i
≤
P
DG
i
max
⁡
,
Q
DG
i
min
⁡
≤
Q
DG
i
≤
Q
DG
i
max
⁡
;
(iv)
DG penetration constraint:(17)
∑
i
=
1
n
P
DG
i
≤
0.25
S
max
⁡
,
(
i
∈
Φ
S
)
,where P
DG
i is the DG access capacity at bus i and S
max
⁡ is the maximum load capacity of distribution network.


## 4.1.3. Overview Formulation

Aggregating objectives and constraints, the problem can be formed as a nonlinear programming problem as follows:(18)
min
⁡
[
F
1
(
x
)
,
F
2
(
x
)
,
F
3
(
x
)
]
s
s
.
t
.
2
h
i
(
x
)
=
i
=
1,2
,
…
,
n
eq
s
.
t
.
s
2
g
i
(
x
)
≤
0
i
=
1,2
,
…
,
n
ineq
,
where x is the vector of independent variables, n
eq is the number of equality constraints, and n
ineq is the number of inequality constraints. It is assumed that the DG has a prespecified power factor; and then there will be two control variables per DG installed, which can be shown as
(19)
x
T
=
[
Lo
c
D
G
1
,
P
D
G
1
,
…
,
Lo
c
D
G
N
DG
,
P
D
G
N
_
DG
]
,
where Lo
c
DG indicates the location of DG integration, P
DG indicates the active power output of DG, and N
_
DG is the maximal allowable injection number of DG.


## 4.2. Experiment Setting

To demonstrate the effectiveness of the proposed algorithm MOHS, the DG planning in the IEEE 33-bus test system is utilized as an example. The single line diagram of IEEE 33-bus system is shown in Figure2, and its penetration rate is set as 25%. Parameters used in MOHS are set as MHS
=
100, AS
=
200, and HMCR
=
0.9. According to the experiments we have made, for the vast majority of distribution power system, the MOHS can obtain the Pareto solution set within 100 iterations. Without loss of generality, the maximum number of iteration in MOHS is set as 100.Figure 2
The Pareto solution set of MOHS for IEEE 33-bus system.


## 4.3. Optimization Results

At the last round of iteration in MOHS, the harmonies in archive compose the Pareto solution set of the optimization problem, which is shown in Figure2. As displayed in Figure 2, each blue point represents a candidate solution in Pareto solution set. It shows that the MOHS has good global searching capability and the candidate solutions have uniform distribution. In addition, in order to demonstrate the advantages of MOHS to HS, the optimization results obtained by HS at different weights of objectives are also displayed in Figure 2. The red, brown, and green points represent the optimization solutions for cases A, B, and C which have massive differences among the three objective weights listed in Table 1, respectively. It shows that the three points are among the Pareto solution set of MOHS. It means that the candidate solutions of MOHS contain the optimized solutions in these three circumstances.Table 1
Optimization objective weights configuration.
Case
Optimization objective weights
1st
2nd
3rd
A
0.8
0.1
0.1
B
0.1
0.8
0.1
C
0.1
0.1
0.8The optimization solution will be obtained by HS only if the weight for each objective is prespecified. And when the preference of decision maker is changed, the previously obtained solution is useless and the whole process of HS algorithm must be repeated again to get a new solution. For MOHS, when the weights of objectives are changed, the final solution can be extracted from the Pareto solution set using different weights, without necessity to obtain the Pareto solution set again. Compared with HS, the proposed MOHS has great convenience and rapidity for variable weight multiobjective optimization problem.The best compromised solution and corresponding multiobjective function values of IEEE-33 system with and without DG units are illustrated in Table2. As shown in Table 2, DG units are integrated to distribution power system at buses 17 and 32, namely, the end of each main feeder, with the size of 0.5137 MW and 0.4248 MW, respectively. Compared with the case without DG, the integrated scheme has significant decrease in the three objective function values, which reduce 49.9%, 29.2%, and 68.1% respectively. The effectiveness of solution obtained by MOHS can be demonstrated from the optimization results.Table 2
Result of IEEE 33-bus test system.
DG planning scheme
Multiobjective function values
Position
Capacity (MW)
Power loss (MW)
Voltage stability index
Voltage deviation
17
0.5137
0.1016
0.0528
3.7405
32
0.4248
Without DG units
0.2027
0.0746
11.7102


## 4.4. Algorithms Comparison

To demonstrate the global searching capability and convergence speed, the proposed MOHS is compared with the classic multiobjective evolution algorithm NSGA-II. Evaluation of multiobjective optimization algorithm is much complex than the single objective one; herein theC metric [20] and outer solution [16] are utilized to illustrate the difference of optimization searching performance between MOHS and NSGA-II.


### 4.4.1.C Metric

Definition 4.
LetX
′ and X
′
′ be two Pareto sets, the function C represents the coverage extent of the ordered pair (
X
′
,
X
′
′
) in the interval [
0
,
1
]:
(20)
C
(
X
′
,
X
′′
)
=
|
{
a
′′
∈
X
′′
;
∃
a
′
∈
X
′
:
a
′
≺
a
′′
}
|
|
X
′′
|
.The valueC
(
X
′
,
X
′
′
)
=
1 means that all solutions in X
′
′ are dominated by solutions in X
′. The opposite condition, C
(
X
′
,
X
′
′
)
=
0, represents the situation that none of solutions in X
′
′ are covered by the set X
′. Note that both C
(
X
′
,
X
′
′
) and C
(
X
′
′
,
X
′
) have to be considered, since C
(
X
′
,
X
′
′
) is not necessarily equal to 1
-
C
(
X
′
′
,
X
′
).Box-plot is a common tool to display distribution of statistical results, which is employed here to visualize theC metric results of MOHS and NSGA-II. Each algorithm runs 30 times, respectively, and the C metric results are demonstrated in Figure 3. As shown in Figure 3, the left box represents how many solutions of MOHS are dominated by solutions of NSGA-II, the right box represents how many solutions of NSGA-II are dominated by solutions of MOHS. The C (NSGA-II, MOEA) has much lower distribution than the C (MOEA, NSGA-II); namely, the solution set of MOEA has much better nondominated performance compared with NSGA-II. It shows that the proposed MOHS performs even better in finding the approximate Pareto-optimal front of feasible solutions.Figure 3
Box-plot ofC metric.


### 4.4.2. Outer Solution Evolutionary Process

Outer solution is defined as the solution which has the minimum value for certain objective in Pareto-optimal front. It can be described as(21)
s
l
(
k
)
=
{
x
i
∣
∀
x
j
∈
X
(
k
)
:
f
l
(
x
i
)
≤
f
l
(
x
j
)
}
,
where s
l
(
k
) is the outer solution corresponding to lth objective at the kth iteration, X
(
k
) is the solution set at the kth iteration, and f
l
(
x
i
) is the lth objective function value of solution x
i. The speed of optimization searching can be illustrated through analyzing the evolutionary process of outer solution.The evolutionary process of outer solution for power loss is shown in Figure4. The outer solutions for power loss converge to the same value after 15 iterations according to MOHS and NSGA-II. It means that the two algorithms achieve the approximate optimum after several iterations. However, MOHS shows better searching speed as it rapidly converges to optimum less than 10 iterations. The evolutionary process of outer solution for the other two objectives has the similar performance with power loss. Through demonstrating the evolutionary process of outer solution, it is proved that the MOHS has a better performance in searching rapidity.Figure 4
Evolutionary process of outer solution for power loss.


## 4.4.1.C Metric

Definition 4.
LetX
′ and X
′
′ be two Pareto sets, the function C represents the coverage extent of the ordered pair (
X
′
,
X
′
′
) in the interval [
0
,
1
]:
(20)
C
(
X
′
,
X
′′
)
=
|
{
a
′′
∈
X
′′
;
∃
a
′
∈
X
′
:
a
′
≺
a
′′
}
|
|
X
′′
|
.The valueC
(
X
′
,
X
′
′
)
=
1 means that all solutions in X
′
′ are dominated by solutions in X
′. The opposite condition, C
(
X
′
,
X
′
′
)
=
0, represents the situation that none of solutions in X
′
′ are covered by the set X
′. Note that both C
(
X
′
,
X
′
′
) and C
(
X
′
′
,
X
′
) have to be considered, since C
(
X
′
,
X
′
′
) is not necessarily equal to 1
-
C
(
X
′
′
,
X
′
).Box-plot is a common tool to display distribution of statistical results, which is employed here to visualize theC metric results of MOHS and NSGA-II. Each algorithm runs 30 times, respectively, and the C metric results are demonstrated in Figure 3. As shown in Figure 3, the left box represents how many solutions of MOHS are dominated by solutions of NSGA-II, the right box represents how many solutions of NSGA-II are dominated by solutions of MOHS. The C (NSGA-II, MOEA) has much lower distribution than the C (MOEA, NSGA-II); namely, the solution set of MOEA has much better nondominated performance compared with NSGA-II. It shows that the proposed MOHS performs even better in finding the approximate Pareto-optimal front of feasible solutions.Figure 3
Box-plot ofC metric.


## 4.4.2. Outer Solution Evolutionary Process

Outer solution is defined as the solution which has the minimum value for certain objective in Pareto-optimal front. It can be described as(21)
s
l
(
k
)
=
{
x
i
∣
∀
x
j
∈
X
(
k
)
:
f
l
(
x
i
)
≤
f
l
(
x
j
)
}
,
where s
l
(
k
) is the outer solution corresponding to lth objective at the kth iteration, X
(
k
) is the solution set at the kth iteration, and f
l
(
x
i
) is the lth objective function value of solution x
i. The speed of optimization searching can be illustrated through analyzing the evolutionary process of outer solution.The evolutionary process of outer solution for power loss is shown in Figure4. The outer solutions for power loss converge to the same value after 15 iterations according to MOHS and NSGA-II. It means that the two algorithms achieve the approximate optimum after several iterations. However, MOHS shows better searching speed as it rapidly converges to optimum less than 10 iterations. The evolutionary process of outer solution for the other two objectives has the similar performance with power loss. Through demonstrating the evolutionary process of outer solution, it is proved that the MOHS has a better performance in searching rapidity.Figure 4
Evolutionary process of outer solution for power loss.


## 5. Conclusions

A novel intelligent searching algorithm, MOHS, is proposed with the combination of fast nondominated sorting in this paper. And the proposed MOHS is applied in the optimal placement and sizing of DG units in distribution power system. With consideration of minimal power loss, minimal voltage deviation, and maximal system voltage stability margin, the mathematical model of DG placement and sizing in power system can be formed as multiobjective optimization problem. IEEE 33-bus test system has been tested with the optimal DG integration planning using the proposed MOHS method. Through the metric comparison with NSGA-II, the MOHS can be demonstrated to have better performance.



---

*Source: 871540-2014-04-10.xml*