# A Comparison of Selected Modifications of the Particle Swarm Optimization Algorithm

Authors: Michala Jakubcová; Petr Máca; Pavel Pech
Journal: Journal of Applied Mathematics
 (2014)

---

## Abstract

We compare 27 modifications of the original particle swarm optimization (PSO) algorithm. The analysis evaluated nine basic PSO types, which differ according to the swarm evolution as controlled by various inertia weights and constriction factor. Each of the basic PSO modifications was analyzed using three different distributed strategies. In the first strategy, the entire swarm population is considered as one unit (OC-PSO), the second strategy periodically partitions the population into equally large complexes according to the particle’s functional value (SCE-PSO), and the final strategy periodically splits the swarm population into complexes using random permutation (SCERand-PSO). All variants are tested using 11 benchmark functions that were prepared for the special session on real-parameter optimization of CEC 2005. It was found that the best modification of the PSO algorithm is a variant with adaptive inertia weight. The best distribution strategy is SCE-PSO, which gives better results than do OC-PSO and SCERand-PSO for seven functions. The sphere function showed no significant difference between SCE-PSO and SCERand-PSO. It follows that a shuffling mechanism improves the optimization process.


---

## Body

## 1. Introduction

Particle swarm optimization (PSO) is a stochastic, metaheuristic computational technique for searching the optimal regions from multidimensional space. It is an optimization method inspired by social behaviour of organisms and was established by Kennedy and Eberhart in 1995 [1]. The technique is based on iterative work with a population. PSO is an evolutionary computation (EC) method within the group of techniques known as swarm intelligence (SI) [2, 3]. PSO mimics the movement of flock of birds or school of fish using simple rules for adjusting the particle location, which is adjusted by means of its velocity information.PSO’s main benefits are that there are few parameters to adjust and the method is easy to implement. Another advantage of PSO over derivative based local search methods is that there is no need for the gradient information during the iterative search when solving complicated optimization problems [4–6].While it has been successfully applied to solve many tests and real-life optimization problems [7–9], the PSO method often suffers from premature convergence and, as a result, from the optimization process’s finding a merely local optimum. In order to achieve better algorithm performance, the original PSO algorithm has been modified by adding the parameter inertia weight or constriction factor [10–13].Another important strategy for improving EC algorithms relies on division of the original population into subswarms or complexes which simultaneously search across the parametric space and exchange information according to some prescribed rule. Periodic shuffling is a typical example [9, 14, 15].In order to explore the interaction of modifications in particle velocities together with the different types of distributed PSO versions, this paper analyzes 27 different PSO variants. Nine modifications of the PSO algorithm, in which the original particle velocities are altered using different approaches for setting the inertia weights and constriction factor [13], are combined with three strategies for swarm distribution. The population is either considered as one unit (OC-PSO) or the swarm is divided into several complexes either according to the functional value (SCE-PSO) [14] or randomly (SCERand-PSO).The remainder of this paper is organized as follows. Section2 describes the particle swarm optimization method. The original equations and modifications of PSO algorithm are included. Section 3 describes different strategies for distribution of PSO. The experiment and obtained results are compared in Section 4. Conclusions are discussed in Section 5.


## 2. Particle Swarm Optimization

Particle swarm optimization is a global optimization method applied to find the optimal solutionX
o
p
t of objective function f. The sought optimum is most generally a minimum value. There exists a population of particles i
=
1
,
…
,
S, where S is the total number of individuals. All particles search through the problem space of dimension d
=
1
,
…
,
Dim, where Dim is the total number of dimensions. Each particle stores information about its position and velocity. The vector of the i
th particle’s position is X
i
=
(
x
1
i
,
x
2
i
,
…
,
x
Dim
i
) and the vector of the i
th particle’s velocity is V
i
=
(
v
1
i
,
v
2
i
,
…
,
v
Dim
i
). Each particle maintains a memory of its previous best position which is represented as P
i
=
(
p
1
i
,
p
2
i
,
…
,
p
Dim
i
). The best position among all particles from the swarm is represented as G
=
(
g
1
,
g
1
,
…
,
g
Dim
). Equations (1) and (2) are the original PSO equations for computing a new velocity and new position. Consider
(1)
v
d
i
(
t
+
1
)
=
v
d
i
(
t
)
+
c
1
·
r
1
·
(
p
d
i
(
t
)
-
x
d
i
(
t
)
)
+
c
2
·
r
2
·
(
g
d
(
t
)
-
x
d
i
(
t
)
)
,
(2)
x
d
i
(
t
+
1
)
=
x
d
i
(
t
)
+
v
d
i
(
t
+
1
)
for all i
∈
1
…
S, d
∈
1
…
Dim, where t is a time step, c
1 and c
2 are acceleration constants predefined by the user, and r
1 and r
2 are random numbers uniformly distributed in [
0,1
]. The component with P
i in (1) is known as the cognition part and it tells us about the individual experience of the particle. The component with G is called the social part and it represents the cooperation among particles within the swarm [16].The simplified original PSO algorithm is shown in Algorithm1. Initialization of a particle’s position is randomly distributed in the range of [
x
min
⁡
,
x
max
⁡
] as shown in
(3)
X
=
x
min
⁡
+
(
x
max
⁡
-
x
min
⁡
)
·
rand
(
)
,
where rand
(
) is a random number uniformly distributed in [0,1], while x
min
⁡ and x
max
⁡ are boundaries of the search space and their values depend on the benchmark function [17]. In this paper, initialization of particles is through Latin hypercube sampling (LHS).Algorithm 1:Original PSO algorithm.
(1)    initialize the position and velocity of all particles
(2)repeat
(3)for  each particle i
=
1  to  S  do
(4)if  (
f
(
X
i
)
<
f
(
P
i
)
)  then
(5)P
i
=
X
i
(6)end if
(7)G
=
min
⁡
{
P
0
,
P
1
,
…
,
P
S
}
(8)for  each dimension d
=
1  to  Dim  do
(9)v
d
i
=
v
d
i
+
c
1
·
r
1
·
(
p
d
i
-
x
d
i
)
+
c
2
·
r
2
·
(
g
d
-
x
d
i
)
(10)x
d
i
=
x
d
i
+
v
d
i
(11)end for
(12)end for
(13)until termination criteria is metA particle’s initial velocity could be randomly distributed in the range of[
-
v
max
⁡
,
v
max
⁡
] or, alternatively, the velocities could be initialized to 0, since the starting positions are already randomized [18]. In initial experiments, the value of v
max
⁡ was set to 100 000, and in subsequent experiments and applications it was found that a better approach is to limit v
max
⁡ to x
max
⁡ [19]. Other authors [20, 21] have set the value of maximum velocity as v
max
⁡
=
k
·
x
max
⁡, where 0.1
<
k
<
1. A larger value of v
max
⁡ facilitates global exploration, whereas a smaller value of v
max
⁡ encourages local exploitation [22]. In this paper, v
max
⁡
=
x
max
⁡ was applied for initial particle velocity.


### 2.1. Modifications of the PSO Algorithm

The original PSO equation was modified to improve the ability for optimization. The first group of modifications consists in incorporating the parameter ofinertia weight
w and the second in using the parameter ofconstriction factor
K. In the present study, nine variants of PSO algorithm were used and tested (Table 1), including eight modifications using w and one modification with K.Table 1
Summary of PSO modifications.
Label
Equation
AdaptW
w
=
(
w
max
⁡
-
w
min
⁡
)
·
P
s
+
w
min
⁡
ChaoticRandW
w
(
iter
)
=
0.5
·
rand
(
)
+
0.5
·
z
ChaoticW
w
(
iter
)
=
(
w
max
⁡
-
w
min
⁡
)
·
iter
max
⁡
-
iter
iter
max
⁡
=
+
w
min
⁡
·
z
ConstantW
w
=
c
ConstrFactor
K
=
2
|
2
-
φ
-
φ
2
-
4
·
φ
|
LinTimeVaryingW
w
(
iter
)
=
iter
max
⁡
-
iter
iter
max
⁡
·
(
w
max
⁡
-
w
min
⁡
)
=
w
(
iter
)
+
w
min
⁡
NonlinTimeConstW
w
(
iter
)
=
w
ini
·
u
iter
NonlinTimeW
w
(
iter
)
=
(
2
iter
)
0.3
RandomW
w
=
0.5
+
rand
(
)
2The use of the inertia weight parameter (4) was developed by Shi and Eberhart [11] and it has provided for improved performance:
(4)
v
d
i
=
w
·
v
d
i
+
c
1
·
r
1
·
(
p
d
i
-
x
d
i
)
+
c
2
·
r
2
·
(
g
d
-
x
d
i
)
.There are many methods of computing the inertia weight value. Nickabadi et al. [13] divided those techniques into three classes which are applied in this paper: (1) constant and random inertia weight, (2) time varying inertia weight strategies, and (3) adaptive inertia weight. They compared all modifications employing benchmark functions and proposed a PSO algorithm using adaptive inertia weight.The constant (“ConstantW”) and random (“RandomW”) inertia weights are used, where no input information is required. Bansal et al. [23] discussed their work with Shi and Eberhart [10] and set the constant inertia weight to be equal to 0.7. Gimmler et al. [24] proposed using constant inertia weight for hybrid particle swarm optimization. The best constant w was 0.2. We set the constant inertia weight for the “ConstantW” modification to 0.7 for this study, because our experiment is more similar to that of Bansal et al. [23]. Eberhart and Shi [25] had proposed random inertia weight, where w is a variable with uniform distribution within [0.5,1].Time varying inertia weight is defined as a function of time or number of iterations and this method may be linear or nonlinear. In linear decreasingw (“LinTimeVaryingW”) developed by Shi and Eberhart [11], inertia weight decreases linearly from w
max
⁡
=
0.9 to w
min
⁡
=
0.4. This method of determining the inertia weight value is very common [26, 27]. Eberhart and Shi [19] compared linearly decreasing w with constriction factor and found that better performance was achieved when constriction factor was used. The chaotic model (“ChaoticW”) and chaotic random model (“ChaoticRandW”) of inertia weight were proposed by Feng et al. [28], where z
=
4
·
z
·
(
1
-
z
) and the initial value of z is uniformly distributed in [
0,1
]. Two modifications of nonlinear time varying inertia weight are used. In the “NonlinTimeW” and the “NonlinTimeConstW”, where parameter u is set to 1.0002, w
ini is the initial value for inertia weight uniformly distributed in [
0,1
] and iter is the actual number of functional evaluations [13].One modification of adaptive inertia weight proposed by Nickabadi et al. [13] is used (“AdaptW”), because it had demonstrated the best performance in the original paper. The w value is adapted based on one feedback parameter. The value S shows the success of particles and is defined as in (5) and P
s is the success percentage of the swarm and it is computed as in (6), where n is the size of the population. The range of inertia weights [
w
min
⁡
,
w
max
⁡
] is [
0,1
]. Consider
(5)
S
(
i
,
t
)
=
{
1
if
fit
(
p
d
i
(
t
)
)
<
fit
(
p
d
i
(
t
-
1
)
)
,
0
if
fit
(
p
d
i
(
t
)
)
=
fit
(
p
d
i
(
t
-
1
)
)
,
(6)
P
s
(
t
)
=
∑
i
=
1
n
S
(
i
,
t
)
n
.Beyond variants using inertia weight, the next modification of the original PSO algorithm consists in incorporating the parameter of constriction factor ((7) and (8)). This strategy was first used by Clerc [29] and it increases convergence of the algorithm. We have named the method “ConstrFactor.” Another approach to constriction factor is that of Bui et al. [12]. They proposed a time-dependent strategy, where they used nonlinear decay rules to adapt K. Their results are not better than those obtained when using the setting in accordance with Clerc [29], and we therefore calculate the K value using
(7)
v
d
i
=
K
·
(
v
d
i
+
c
1
·
r
1
·
(
p
d
i
-
x
d
i
)
iiiiiiiiiii
+
c
2
·
r
2
·
(
g
d
-
x
d
i
)
)
,
(8)
K
=
2
|
2
-
φ
-
φ
2
-
4
·
φ
|
,
where φ
=
c
1
+
c
2 and φ
>
4.


## 2.1. Modifications of the PSO Algorithm

The original PSO equation was modified to improve the ability for optimization. The first group of modifications consists in incorporating the parameter ofinertia weight
w and the second in using the parameter ofconstriction factor
K. In the present study, nine variants of PSO algorithm were used and tested (Table 1), including eight modifications using w and one modification with K.Table 1
Summary of PSO modifications.
Label
Equation
AdaptW
w
=
(
w
max
⁡
-
w
min
⁡
)
·
P
s
+
w
min
⁡
ChaoticRandW
w
(
iter
)
=
0.5
·
rand
(
)
+
0.5
·
z
ChaoticW
w
(
iter
)
=
(
w
max
⁡
-
w
min
⁡
)
·
iter
max
⁡
-
iter
iter
max
⁡
=
+
w
min
⁡
·
z
ConstantW
w
=
c
ConstrFactor
K
=
2
|
2
-
φ
-
φ
2
-
4
·
φ
|
LinTimeVaryingW
w
(
iter
)
=
iter
max
⁡
-
iter
iter
max
⁡
·
(
w
max
⁡
-
w
min
⁡
)
=
w
(
iter
)
+
w
min
⁡
NonlinTimeConstW
w
(
iter
)
=
w
ini
·
u
iter
NonlinTimeW
w
(
iter
)
=
(
2
iter
)
0.3
RandomW
w
=
0.5
+
rand
(
)
2The use of the inertia weight parameter (4) was developed by Shi and Eberhart [11] and it has provided for improved performance:
(4)
v
d
i
=
w
·
v
d
i
+
c
1
·
r
1
·
(
p
d
i
-
x
d
i
)
+
c
2
·
r
2
·
(
g
d
-
x
d
i
)
.There are many methods of computing the inertia weight value. Nickabadi et al. [13] divided those techniques into three classes which are applied in this paper: (1) constant and random inertia weight, (2) time varying inertia weight strategies, and (3) adaptive inertia weight. They compared all modifications employing benchmark functions and proposed a PSO algorithm using adaptive inertia weight.The constant (“ConstantW”) and random (“RandomW”) inertia weights are used, where no input information is required. Bansal et al. [23] discussed their work with Shi and Eberhart [10] and set the constant inertia weight to be equal to 0.7. Gimmler et al. [24] proposed using constant inertia weight for hybrid particle swarm optimization. The best constant w was 0.2. We set the constant inertia weight for the “ConstantW” modification to 0.7 for this study, because our experiment is more similar to that of Bansal et al. [23]. Eberhart and Shi [25] had proposed random inertia weight, where w is a variable with uniform distribution within [0.5,1].Time varying inertia weight is defined as a function of time or number of iterations and this method may be linear or nonlinear. In linear decreasingw (“LinTimeVaryingW”) developed by Shi and Eberhart [11], inertia weight decreases linearly from w
max
⁡
=
0.9 to w
min
⁡
=
0.4. This method of determining the inertia weight value is very common [26, 27]. Eberhart and Shi [19] compared linearly decreasing w with constriction factor and found that better performance was achieved when constriction factor was used. The chaotic model (“ChaoticW”) and chaotic random model (“ChaoticRandW”) of inertia weight were proposed by Feng et al. [28], where z
=
4
·
z
·
(
1
-
z
) and the initial value of z is uniformly distributed in [
0,1
]. Two modifications of nonlinear time varying inertia weight are used. In the “NonlinTimeW” and the “NonlinTimeConstW”, where parameter u is set to 1.0002, w
ini is the initial value for inertia weight uniformly distributed in [
0,1
] and iter is the actual number of functional evaluations [13].One modification of adaptive inertia weight proposed by Nickabadi et al. [13] is used (“AdaptW”), because it had demonstrated the best performance in the original paper. The w value is adapted based on one feedback parameter. The value S shows the success of particles and is defined as in (5) and P
s is the success percentage of the swarm and it is computed as in (6), where n is the size of the population. The range of inertia weights [
w
min
⁡
,
w
max
⁡
] is [
0,1
]. Consider
(5)
S
(
i
,
t
)
=
{
1
if
fit
(
p
d
i
(
t
)
)
<
fit
(
p
d
i
(
t
-
1
)
)
,
0
if
fit
(
p
d
i
(
t
)
)
=
fit
(
p
d
i
(
t
-
1
)
)
,
(6)
P
s
(
t
)
=
∑
i
=
1
n
S
(
i
,
t
)
n
.Beyond variants using inertia weight, the next modification of the original PSO algorithm consists in incorporating the parameter of constriction factor ((7) and (8)). This strategy was first used by Clerc [29] and it increases convergence of the algorithm. We have named the method “ConstrFactor.” Another approach to constriction factor is that of Bui et al. [12]. They proposed a time-dependent strategy, where they used nonlinear decay rules to adapt K. Their results are not better than those obtained when using the setting in accordance with Clerc [29], and we therefore calculate the K value using
(7)
v
d
i
=
K
·
(
v
d
i
+
c
1
·
r
1
·
(
p
d
i
-
x
d
i
)
iiiiiiiiiii
+
c
2
·
r
2
·
(
g
d
-
x
d
i
)
)
,
(8)
K
=
2
|
2
-
φ
-
φ
2
-
4
·
φ
|
,
where φ
=
c
1
+
c
2 and φ
>
4.


## 3. Distribution of PSO

All nine modifications are used with three strategies of swarm distribution (SD). We observed changes in behaviour of the population for each modification and strategy. The first distributed strategy considered the whole population as one unit and we called it OC-PSO. In the next SD, the population was divided into several complexes according to the particle’s functional value (SCE-PSO) or through random permutation (SCERand-PSO).


### 3.1. One Complex Strategy (OC-PSO)

In the OC-PSO method, the entire population is considered as a single unit. All particles participate in the PSO algorithm and share information about the best position achieved so far.


### 3.2. Shuffled Complex Evolution (SCE-PSO)

During the optimization process a premature convergence to a local optimum could appear instead of the global optimum. Many researchers in this field are devoted avoiding this premature convergence [30–32]. To address this, Duan et al. [14] proposed shuffled complex evolution (SCE). Yan et al. [33] combined SCE with the particle swarm optimization algorithm (SCE-PSO).The SCE-PSO method is described simply below and is shown in Algorithm2. After the first initialization, the entire population is divided into subswarms according to the functional values of the individuals. All particles are sorted in increasing order and then each i
th complex receives the parent individuals X
i
,
X
i
+
N
C
,
X
i
+
2
N
C
,
…, where N
C is the number of complexes [14, 34]. The PSO algorithm is applied at each complex. After running a predefined number of iterations in all complexes, all particles return to the swarm and the shuffling and redistribution of complexes according to the functional value are again made. This is repeated until the termination criteria are satisfied.Algorithm 2:Algorithm SCE-PSO.
RequireS, NC, N_comp, max_eval, fitness_lim
(1)    initialize populationX
(2)while  (number_eval ≤ max_eval) |
| (fitness_best ≥ fitness_lim)  do
(3)E
← sorted X in increasing order according to the functional value
(4)for  i
=
1  to  NC  do
(5)A
i
← divided E into NC complexes
(6)                 run PSO
(7)for  j
=
1  to  N_comp  do
(8)if  (
f
(
X
j
)
<
f
(
P
j
)
)  then
(9)P
j
=
X
j
(10)end if
(11)if  (
f
(
X
j
)
<
f
(
G
)
)  then
(12)G
=
X
j
(13)end if
(14)end for
(15)end for
(16)end whileThe shuffling mechanism preserves the population diversity and helps to prevent premature convergence. For this study, the shuffling was performed after the running of a predefined number of generations in each complex [34]. Another approach allows the shuffling to occur randomly with some associated probability [35].In the original SCE-PSO method [33], only a predefined number of particles from each complex are chosen to participate in the PSO algorithm. In this paper, the number of participating individuals is equal to the number of particles in the complex. This means that all particles from the complex are inputs to the PSO algorithm.


### 3.3. Random Shuffled Complex Evolution (SCERand-PSO)

Random shuffled complex evolution differs from SCE-PSO in that the entire population is divided into complexes according to random permutation. There is no sorting by functional value. The algorithm for computing random permutation is according to Durstenfeld [36].Algorithm2 is applied for the SCERand-PSO, except that at line 3 the following substitution is made: E
← sorted X according to random permutation.


## 3.1. One Complex Strategy (OC-PSO)

In the OC-PSO method, the entire population is considered as a single unit. All particles participate in the PSO algorithm and share information about the best position achieved so far.


## 3.2. Shuffled Complex Evolution (SCE-PSO)

During the optimization process a premature convergence to a local optimum could appear instead of the global optimum. Many researchers in this field are devoted avoiding this premature convergence [30–32]. To address this, Duan et al. [14] proposed shuffled complex evolution (SCE). Yan et al. [33] combined SCE with the particle swarm optimization algorithm (SCE-PSO).The SCE-PSO method is described simply below and is shown in Algorithm2. After the first initialization, the entire population is divided into subswarms according to the functional values of the individuals. All particles are sorted in increasing order and then each i
th complex receives the parent individuals X
i
,
X
i
+
N
C
,
X
i
+
2
N
C
,
…, where N
C is the number of complexes [14, 34]. The PSO algorithm is applied at each complex. After running a predefined number of iterations in all complexes, all particles return to the swarm and the shuffling and redistribution of complexes according to the functional value are again made. This is repeated until the termination criteria are satisfied.Algorithm 2:Algorithm SCE-PSO.
RequireS, NC, N_comp, max_eval, fitness_lim
(1)    initialize populationX
(2)while  (number_eval ≤ max_eval) |
| (fitness_best ≥ fitness_lim)  do
(3)E
← sorted X in increasing order according to the functional value
(4)for  i
=
1  to  NC  do
(5)A
i
← divided E into NC complexes
(6)                 run PSO
(7)for  j
=
1  to  N_comp  do
(8)if  (
f
(
X
j
)
<
f
(
P
j
)
)  then
(9)P
j
=
X
j
(10)end if
(11)if  (
f
(
X
j
)
<
f
(
G
)
)  then
(12)G
=
X
j
(13)end if
(14)end for
(15)end for
(16)end whileThe shuffling mechanism preserves the population diversity and helps to prevent premature convergence. For this study, the shuffling was performed after the running of a predefined number of generations in each complex [34]. Another approach allows the shuffling to occur randomly with some associated probability [35].In the original SCE-PSO method [33], only a predefined number of particles from each complex are chosen to participate in the PSO algorithm. In this paper, the number of participating individuals is equal to the number of particles in the complex. This means that all particles from the complex are inputs to the PSO algorithm.


## 3.3. Random Shuffled Complex Evolution (SCERand-PSO)

Random shuffled complex evolution differs from SCE-PSO in that the entire population is divided into complexes according to random permutation. There is no sorting by functional value. The algorithm for computing random permutation is according to Durstenfeld [36].Algorithm2 is applied for the SCERand-PSO, except that at line 3 the following substitution is made: E
← sorted X according to random permutation.


## 4. Experiment and Results

### 4.1. Experimental Setup

After running several tests with different parameter settings, the following setup was found to be the best.The position of individuals is initialized randomly between lower and upper bounds of the search space through Latin hypercube sampling (LHS). The range of the problem space depends on the benchmark function (Table2). LHS is a type of stratified Monte Carlo sampling first described by McKay et al. in 1979 for the analysis of output from a computer code [37]. The range, which is in PSO optimization defined by lower and upper bounds of the search space, is portioned into n intervals of equal probability 1
/
n. The n value is in PSO which is equal to the population size. LHS then randomly selects one value from each interval [38]. Due to this selection, particles are uniformly distributed in the search space.Table 2
Summary of benchmark functions.
Function
Range
f
(
X
o
p
t
)
Sphere
f
1
(
x
)
=
∑
i
=
1
d
z
i
2
[−100, 100]
d
−450
Schwefel 1.2
f
2
(
x
)
=
∑
i
=
1
d
‍
(
∑
j
=
1
i
‍
z
j
)
2
[−100, 100]
d
−450
Elliptic rotated
f
3
(
x
)
=
∑
i
=
1
d
‍
(
(
1
0
6
)
(
i
-
1
)
/
(
d
-
1
)
z
i
2
)
[−100, 100]
d
−450
Schwefel 1.2 noise
f
4
(
x
)
=
(
∑
i
=
1
d
‍
(
∑
j
=
1
i
‍
z
j
)
2
)
·
(
1
+
0.4
|
N
(
0,1
)
|
)
[−100, 100]
d
−450
Schwefel 2.6
f
5
(
x
)
=
max
⁡
{
|
A
i
x
-
B
i
|
}
[−100, 100]
d
−310
Rosenbrock
f
6
(
x
)
=
∑
i
=
1
d
-
1
‍
(
100
(
z
i
2
-
z
i
+
1
)
2
+
(
z
i
-
1
)
2
)
[−100, 100]
d
390
Griewank rotated
f
7
(
x
)
=
∑
i
=
1
d
‍
z
i
2
4000
-
∏
i
=
1
d
‍
cos
⁡
(
z
i
i
)
+
1
[0, 600]
d
−180
Ackley rotated
f
8
(
x
)
=
-
20
exp
⁡
(
-
0.2
1
d
∑
i
=
1
d
‍
z
i
2
)
-
exp
⁡
(
1
d
∑
i
=
1
d
‍
cos
⁡
(
2
π
z
i
)
)
+
20
+
e
[−32, 32]
d
−140
Rastrigin
f
9
(
x
)
=
∑
i
=
1
d
‍
(
z
i
2
-
10
cos
⁡
(
2
π
z
i
)
+
10
)
[−5, 5]
d
−330
Rastrigin rotated
f
10
(
x
)
=
∑
i
=
1
d
‍
(
z
i
2
-
10
cos
⁡
(
2
π
z
i
)
+
10
)
[−5, 5]
d
−330
Weierstrass rotated
f
11
(
x
)
=
∑
i
=
1
d
‍
[
∑
k
=
0
20
‍
(
0
.
5
k
cos
⁡
(
2
π
3
k
(
z
i
+
0.5
)
)
)
]
-
d
∑
k
=
0
20
‍
(
0
.
5
k
cos
⁡
(
2
π
3
k
·
0.5
)
)
[−0.5, 0.5]
d
90In accordance with Eberhart and Shi [19], the maximum value of velocity is set to x
max
⁡. The value of acceleration constants c
1 and c
2 in variants with inertia weight is set to 2. In modifications with constriction factor, the K value is set to 0.729 and c
1
=
c
2
=
1.49445 [19].In accordance with Eberhart and Shi [39], the population size is set to 25. In the OC-PSO method, all particles are solved together. In the SCE-PSO and SCERand-PSO methods, individuals are uniformly divided into 6 complexes, where each complex contains 25 particles. The number of shuffling is set to 5. The maximum number of function evaluations is 10
000
·
Dim and the dimension of the solution is set to 30. For analyzing the results, the total number of optimization runs is set to 25. Each run stops when the maximum number of evaluations is achieved.


### 4.2. Benchmark Problems

For comparison purposes, 11 benchmark functions prepared for the special session on real-parameter optimization of CEC 2005 [40] were used. All functions have shifted global optima, and some of them are rotated or with noise. The benchmark functions are summarized in Table 2. The aim is to find the minimum of all functions.The optimization problem is constrained except for functionf
7. Particles move only in restricted space and cannot cross the boundaries. This means that each position of particle i is bounded by lower and upper limits [41]. In the PSO algorithm, it is reflected such that the particles must lie within the range [
x
min
⁡
,
x
max
⁡
]. If a new particle position is outside the boundaries, that particle retains the position of its parent. In function f
7, the global optimum is situated outside the range [40] and therefore the optimization problem is unconstrained and particles can cross the boundaries.There exist two versions of the PSO algorithm:global andlocal. In the global variant, the neighborhood consists of all particles of the swarm. In the local variant, each particle is assigned to a neighborhood consisting of a predefined number of particles [41, 42]. For the OC-PSO method, the global variant is used. For the SCE-PSO and SCERand-PSO, the local variant is used and particles share the information about their best positions only with other particles from a given complex.


### 4.3. Results and Discussion

The nonparametric Wilcoxon test was used for statistical comparison. Inputs to those calculations were the best fitness values achieved for all modifications. The null hypothesisH
0 of the Wilcoxon test is that the differences between algorithms have a median of zero. The H
0 is rejected if the P value is less than 0.05 [43, 44]. Algorithms were written in C++ and computations of P value and graphs were made in the program R.Table3 reflects the best modification and distributed strategy for each function. In the table, the minimum, 25% quartile, median, 75% quartile, maximum, mean, and standard deviation are indicated. All 25-program runs of each modification and strategy were compared in each numbered evaluation. The values in Table 3 reflect the best fitness achieved and report other statistical indices belonging to the same numbered evaluation. As can be seen, strategy SCE-PSO produced the best solution in seven functions. Strategy SCERand-PSO produced the best solution in two functions (f
9
,
f
10) and in one function (f
5) the best solution was from strategy OC-PSO. For function f
1, there was no significant difference between strategy SCE-PSO and SCERand-PSO.Table 3
Statistical indices of the best solutions of11 benchmark functions.
Function
Modification
SDa
min
25%
median
75%
max
mean
std
f
1
AdaptW
2
0.00E + 00
5.68E − 14
1.14E − 13
1.71E − 13
2.27E − 13
1.02E − 13
6.14E − 14
AdaptW
3
0.00E + 00
5.68E − 14
1.14E − 13
1.14E − 13
5.59E − 05
4.74E − 06
1.53E − 05
f
2
AdaptW
2
5.68E − 14
2.27E − 13
3.98E − 13
6.82E − 13
1.53E − 12
5.16E − 13
4.33E − 13
f
3
AdaptW
2
4.17E + 05
7.08E + 05
1.02E + 06
1.57E + 06
2.30E + 06
1.15E + 06
5.78E + 05
f
4
NonlinTimeConstW
2
7.09E − 02
7.56E − 01
2.21E + 00
4.38E + 00
1.94E + 03
1.20E + 02
4.27E + 02
f
5
NonlinTimeConstW
1
1.31E + 03
2.78E + 03
3.21E + 03
4.57E + 03
6.14E + 03
3.66E + 03
1.26E + 03
f
6
AdaptW
2
1.71E − 03
3.83E + 00
4.06E + 00
7.47E + 00
1.80E + 01
5.76E + 00
4.87E + 00
f
7
NonlinTimeConstW
2
2.84E − 14
9.86E − 03
1.23E − 02
2.22E − 02
6.87E − 02
1.70E − 02
1.73E − 02
f
8
AdaptW
2
2.06E + 01
2.14E + 01
2.16E + 01
2.18E + 01
2.20E + 01
2.15E + 01
3.89E − 01
f
9
ChaoticW
3
2.89E + 01
6.78E + 01
8.51E + 01
1.12E + 02
6.07E + 02
1.21E + 02
1.27E + 02
f
10
ChaoticRandW
3
7.87E + 01
1.63E + 02
4.22E + 02
4.85E + 02
6.56E + 02
3.44E + 02
1.88E + 02
LinTimeVaryingW
3
8.38E + 01
2.03E + 02
4.02E + 02
4.81E + 02
5.71E + 02
3.54E + 02
1.54E + 02
f
11
LinTimeVaryingW
2
2.66E + 01
3.12E + 01
3.25E + 01
3.52E + 01
4.78E + 01
3.38E + 01
4.97E + 00
aSD = swar distribution, where 1 is for OC-PSO, 2 is for SCE-PSO, and 3 is for SCERand-PSO.Upon closer examination and as seen in Table4, “AdaptW” and “NonlinTimeConstW” are the best modifications for unimodal functions (f
1
–
f
5). The poorest variants are “ConstantW” and “ConstrFactor.” The best PSO modification for multimodal functions (f
6
–
f
11) is “AdaptW” and the poorest is “ConstantW.”Table 4
Estimation of the best and poorest modifications.
f
1
Best
Poorest
OC-PSO
AdaptW, ChaoticRandW, ChaoticW, NonlinTimeConstW
ConstantW
SCE-PSO
AdaptW
ConstantW
SCERand-PSO
AdaptW, NonlinTimeConstW
ConstantW
f
2
Best
Poorest
OC-PSO
AdaptW, LinTimeVaryingW
ConstrFactor
SCE-PSO
AdaptW
ConstrFactor
SCERand-PSO
AdaptW
ConstrFactor
f
3
Best
Poorest
OC-PSO
LinTimeVaryingW
ConstantW
SCE-PSO
AdaptW, NonlinTimeW
ConstantW
SCERand-PSO
AdaptW, NonlinTimeW
ConstantW, RandomW
f
4
Best
Poorest
OC-PSO
ChaoticRandW, LinTimeVaryingW
ConstrFactor
SCE-PSO
NonlinTimeConstW
ConstrFactor
SCERand-PSO
NonlinTimeConstW
ConstrFactor
f
5
Best
Poorest
OC-PSO
ChaoticRandW, NonlinTimeConstW
ConstantW
SCE-PSO
ChaoticRandW, ChaoticW, NonlinTimeConstW
ConstantW
SCERand-PSO
ChaoticRandW, ChaoticW, LinTimeVaryingW, NonlinTimeConstW
ConstantW
f
6
Best
Poorest
OC-PSO
ChaoticRandW, NonlinTimeConstW
ConstantW
SCE-PSO
AdaptW
ConstantW
SCERand-PSO
AdaptW
ConstantW
f
7
Best
Poorest
OC-PSO
NonlinTimeConstW
ConstantW, RandomW
SCE-PSO
NonlinTimeConstW
ConstantW, ConstrFactor
SCERand-PSO
AdaptW, NonlinTimeW
ConstantW, ConstrFactor, LinTimeVarying
f
8
Best
Poorest
OC-PSO
AdaptW
ConstrFactor
SCE-PSO
AdaptW
LinTimeVarying
SCERand-PSO
AdaptW
ConstantW, ConstrFactor, LinTimeVaryingW, NonlinTimeConstW
f
9
Best
Poorest
OC-PSO
ChaoticW
ConstantW, ConstrFactor, RandomW
SCE-PSO
ChaoticW
ConstantW, ConstrFactor
SCERand-PSO
ChaoticW
ConstantW
f
10
Best
Poorest
OC-PSO
ChaoticRandW
ConstantW
SCE-PSO
ChaoticW
ConstantW
SCERand-PSO
ChaoticRandW, ChaoticW, LinTimeVaryingW
ConstantW
f
11
Best
Poorest
OC-PSO
AdaptW, LinTimevaryingW, NonlinTimeConstW, NonlinTimeW
ConstantW, ConstrFactor
SCE-PSO
LinTimevaryingW
ConstantW, ConstrFactor, RandomW
SCERand-PSO
AdaptW
ConstantW, ConstrFactor, RandomWFor rotated functions (f
3
,
f
7
,
f
8
,
f
10
,
f
11) the best modification of the PSO algorithm appears to be “AdaptW” and the poorest is “CostantW.” For functions where there is no transformation matrix to rotate them, “AdaptW” is the best variant and the poorest variants are “ConstantW” and “ConstrFactor.”It is clear that the best modification of the particle swarm optimization algorithm for the selected benchmark functions is “AdaptW,” that is, adaptive inertia weight. The variant called “NonlinTimeConstW” also produced good results. On the other hand, the poorest modifications appear to be “ConstantW” and “ConstrFactor.”The convergence to the global optimum using particle swarm optimization is good, but only in three of the eleven benchmark functions is the obtained error value less than1
0
-
8. In spite of this, the shuffling mechanism improves the optimization. Strategies SCE-PSO and SCERand-PSO are better than OC-PSO in ten functions.The global minimum was achieved in three benchmark functions,f
1, f
2, and f
7, and our results are comparable with those of Hansen [45] who compares eleven optimization algorithms on twelve functions. The particle swarm optimization algorithm achieved the global minimum in functions f
1, f
2, f
3, f
6, and f
7. Our results using SCE-PSO are better than those of the optimization algorithms BLX-MA and DE and are as good as those from CoEVO as reported by Hansen [45].Bui et al. [12] achieved the global optimum in two unimodal functions f
1 and f
2 using the PSO method APSO1 and in three unimodal functions f
1, f
2, and f
4 using the DPSO method. APSO is PSO algorithm with adaptive constriction factor and in DPSO the bound of the velocity is adapted. None of their algorithms converge to the global minimum in multimodal functions [12]. In this regard, our results are better.Nickabadi et al. [13] compare six inertia weight adjusting methods on 15 test problems with dimension set to 30. If we look only at functions solved for this paper, Nickabadi et al. [13] achieved the global optimum in functions f
1, f
2, and f
8. They obtained the best results using the adaptive inertia weight, which they had proposed (modification “AdaptW” in this paper). Their results are comparable with those achieved in the present study. The difference being that our functions have shifted the global optimum, whereas Nickabadi et al. [13] did not.Figure1 presents the convergence graphs for each function while utilizing the best modification of the PSO algorithm. The x-axis indicates the number of function evaluations and the y-axis the logarithmic value of the best fitness, which is the difference between the searched and the best achieved functional value. A decline with the number of evaluations is clearly visible for all functions, thus indicating the approach to the global optimum.Convergence graphs for best fitness of the best modifications and strategy of PSO for functionsf
1
–
f
11 according to Table 3.
(a)
(b)
(c)
(d)
(e)
(f)
(g)
(h)
(i)
(j)
(k)


## 4.1. Experimental Setup

After running several tests with different parameter settings, the following setup was found to be the best.The position of individuals is initialized randomly between lower and upper bounds of the search space through Latin hypercube sampling (LHS). The range of the problem space depends on the benchmark function (Table2). LHS is a type of stratified Monte Carlo sampling first described by McKay et al. in 1979 for the analysis of output from a computer code [37]. The range, which is in PSO optimization defined by lower and upper bounds of the search space, is portioned into n intervals of equal probability 1
/
n. The n value is in PSO which is equal to the population size. LHS then randomly selects one value from each interval [38]. Due to this selection, particles are uniformly distributed in the search space.Table 2
Summary of benchmark functions.
Function
Range
f
(
X
o
p
t
)
Sphere
f
1
(
x
)
=
∑
i
=
1
d
z
i
2
[−100, 100]
d
−450
Schwefel 1.2
f
2
(
x
)
=
∑
i
=
1
d
‍
(
∑
j
=
1
i
‍
z
j
)
2
[−100, 100]
d
−450
Elliptic rotated
f
3
(
x
)
=
∑
i
=
1
d
‍
(
(
1
0
6
)
(
i
-
1
)
/
(
d
-
1
)
z
i
2
)
[−100, 100]
d
−450
Schwefel 1.2 noise
f
4
(
x
)
=
(
∑
i
=
1
d
‍
(
∑
j
=
1
i
‍
z
j
)
2
)
·
(
1
+
0.4
|
N
(
0,1
)
|
)
[−100, 100]
d
−450
Schwefel 2.6
f
5
(
x
)
=
max
⁡
{
|
A
i
x
-
B
i
|
}
[−100, 100]
d
−310
Rosenbrock
f
6
(
x
)
=
∑
i
=
1
d
-
1
‍
(
100
(
z
i
2
-
z
i
+
1
)
2
+
(
z
i
-
1
)
2
)
[−100, 100]
d
390
Griewank rotated
f
7
(
x
)
=
∑
i
=
1
d
‍
z
i
2
4000
-
∏
i
=
1
d
‍
cos
⁡
(
z
i
i
)
+
1
[0, 600]
d
−180
Ackley rotated
f
8
(
x
)
=
-
20
exp
⁡
(
-
0.2
1
d
∑
i
=
1
d
‍
z
i
2
)
-
exp
⁡
(
1
d
∑
i
=
1
d
‍
cos
⁡
(
2
π
z
i
)
)
+
20
+
e
[−32, 32]
d
−140
Rastrigin
f
9
(
x
)
=
∑
i
=
1
d
‍
(
z
i
2
-
10
cos
⁡
(
2
π
z
i
)
+
10
)
[−5, 5]
d
−330
Rastrigin rotated
f
10
(
x
)
=
∑
i
=
1
d
‍
(
z
i
2
-
10
cos
⁡
(
2
π
z
i
)
+
10
)
[−5, 5]
d
−330
Weierstrass rotated
f
11
(
x
)
=
∑
i
=
1
d
‍
[
∑
k
=
0
20
‍
(
0
.
5
k
cos
⁡
(
2
π
3
k
(
z
i
+
0.5
)
)
)
]
-
d
∑
k
=
0
20
‍
(
0
.
5
k
cos
⁡
(
2
π
3
k
·
0.5
)
)
[−0.5, 0.5]
d
90In accordance with Eberhart and Shi [19], the maximum value of velocity is set to x
max
⁡. The value of acceleration constants c
1 and c
2 in variants with inertia weight is set to 2. In modifications with constriction factor, the K value is set to 0.729 and c
1
=
c
2
=
1.49445 [19].In accordance with Eberhart and Shi [39], the population size is set to 25. In the OC-PSO method, all particles are solved together. In the SCE-PSO and SCERand-PSO methods, individuals are uniformly divided into 6 complexes, where each complex contains 25 particles. The number of shuffling is set to 5. The maximum number of function evaluations is 10
000
·
Dim and the dimension of the solution is set to 30. For analyzing the results, the total number of optimization runs is set to 25. Each run stops when the maximum number of evaluations is achieved.


## 4.2. Benchmark Problems

For comparison purposes, 11 benchmark functions prepared for the special session on real-parameter optimization of CEC 2005 [40] were used. All functions have shifted global optima, and some of them are rotated or with noise. The benchmark functions are summarized in Table 2. The aim is to find the minimum of all functions.The optimization problem is constrained except for functionf
7. Particles move only in restricted space and cannot cross the boundaries. This means that each position of particle i is bounded by lower and upper limits [41]. In the PSO algorithm, it is reflected such that the particles must lie within the range [
x
min
⁡
,
x
max
⁡
]. If a new particle position is outside the boundaries, that particle retains the position of its parent. In function f
7, the global optimum is situated outside the range [40] and therefore the optimization problem is unconstrained and particles can cross the boundaries.There exist two versions of the PSO algorithm:global andlocal. In the global variant, the neighborhood consists of all particles of the swarm. In the local variant, each particle is assigned to a neighborhood consisting of a predefined number of particles [41, 42]. For the OC-PSO method, the global variant is used. For the SCE-PSO and SCERand-PSO, the local variant is used and particles share the information about their best positions only with other particles from a given complex.


## 4.3. Results and Discussion

The nonparametric Wilcoxon test was used for statistical comparison. Inputs to those calculations were the best fitness values achieved for all modifications. The null hypothesisH
0 of the Wilcoxon test is that the differences between algorithms have a median of zero. The H
0 is rejected if the P value is less than 0.05 [43, 44]. Algorithms were written in C++ and computations of P value and graphs were made in the program R.Table3 reflects the best modification and distributed strategy for each function. In the table, the minimum, 25% quartile, median, 75% quartile, maximum, mean, and standard deviation are indicated. All 25-program runs of each modification and strategy were compared in each numbered evaluation. The values in Table 3 reflect the best fitness achieved and report other statistical indices belonging to the same numbered evaluation. As can be seen, strategy SCE-PSO produced the best solution in seven functions. Strategy SCERand-PSO produced the best solution in two functions (f
9
,
f
10) and in one function (f
5) the best solution was from strategy OC-PSO. For function f
1, there was no significant difference between strategy SCE-PSO and SCERand-PSO.Table 3
Statistical indices of the best solutions of11 benchmark functions.
Function
Modification
SDa
min
25%
median
75%
max
mean
std
f
1
AdaptW
2
0.00E + 00
5.68E − 14
1.14E − 13
1.71E − 13
2.27E − 13
1.02E − 13
6.14E − 14
AdaptW
3
0.00E + 00
5.68E − 14
1.14E − 13
1.14E − 13
5.59E − 05
4.74E − 06
1.53E − 05
f
2
AdaptW
2
5.68E − 14
2.27E − 13
3.98E − 13
6.82E − 13
1.53E − 12
5.16E − 13
4.33E − 13
f
3
AdaptW
2
4.17E + 05
7.08E + 05
1.02E + 06
1.57E + 06
2.30E + 06
1.15E + 06
5.78E + 05
f
4
NonlinTimeConstW
2
7.09E − 02
7.56E − 01
2.21E + 00
4.38E + 00
1.94E + 03
1.20E + 02
4.27E + 02
f
5
NonlinTimeConstW
1
1.31E + 03
2.78E + 03
3.21E + 03
4.57E + 03
6.14E + 03
3.66E + 03
1.26E + 03
f
6
AdaptW
2
1.71E − 03
3.83E + 00
4.06E + 00
7.47E + 00
1.80E + 01
5.76E + 00
4.87E + 00
f
7
NonlinTimeConstW
2
2.84E − 14
9.86E − 03
1.23E − 02
2.22E − 02
6.87E − 02
1.70E − 02
1.73E − 02
f
8
AdaptW
2
2.06E + 01
2.14E + 01
2.16E + 01
2.18E + 01
2.20E + 01
2.15E + 01
3.89E − 01
f
9
ChaoticW
3
2.89E + 01
6.78E + 01
8.51E + 01
1.12E + 02
6.07E + 02
1.21E + 02
1.27E + 02
f
10
ChaoticRandW
3
7.87E + 01
1.63E + 02
4.22E + 02
4.85E + 02
6.56E + 02
3.44E + 02
1.88E + 02
LinTimeVaryingW
3
8.38E + 01
2.03E + 02
4.02E + 02
4.81E + 02
5.71E + 02
3.54E + 02
1.54E + 02
f
11
LinTimeVaryingW
2
2.66E + 01
3.12E + 01
3.25E + 01
3.52E + 01
4.78E + 01
3.38E + 01
4.97E + 00
aSD = swar distribution, where 1 is for OC-PSO, 2 is for SCE-PSO, and 3 is for SCERand-PSO.Upon closer examination and as seen in Table4, “AdaptW” and “NonlinTimeConstW” are the best modifications for unimodal functions (f
1
–
f
5). The poorest variants are “ConstantW” and “ConstrFactor.” The best PSO modification for multimodal functions (f
6
–
f
11) is “AdaptW” and the poorest is “ConstantW.”Table 4
Estimation of the best and poorest modifications.
f
1
Best
Poorest
OC-PSO
AdaptW, ChaoticRandW, ChaoticW, NonlinTimeConstW
ConstantW
SCE-PSO
AdaptW
ConstantW
SCERand-PSO
AdaptW, NonlinTimeConstW
ConstantW
f
2
Best
Poorest
OC-PSO
AdaptW, LinTimeVaryingW
ConstrFactor
SCE-PSO
AdaptW
ConstrFactor
SCERand-PSO
AdaptW
ConstrFactor
f
3
Best
Poorest
OC-PSO
LinTimeVaryingW
ConstantW
SCE-PSO
AdaptW, NonlinTimeW
ConstantW
SCERand-PSO
AdaptW, NonlinTimeW
ConstantW, RandomW
f
4
Best
Poorest
OC-PSO
ChaoticRandW, LinTimeVaryingW
ConstrFactor
SCE-PSO
NonlinTimeConstW
ConstrFactor
SCERand-PSO
NonlinTimeConstW
ConstrFactor
f
5
Best
Poorest
OC-PSO
ChaoticRandW, NonlinTimeConstW
ConstantW
SCE-PSO
ChaoticRandW, ChaoticW, NonlinTimeConstW
ConstantW
SCERand-PSO
ChaoticRandW, ChaoticW, LinTimeVaryingW, NonlinTimeConstW
ConstantW
f
6
Best
Poorest
OC-PSO
ChaoticRandW, NonlinTimeConstW
ConstantW
SCE-PSO
AdaptW
ConstantW
SCERand-PSO
AdaptW
ConstantW
f
7
Best
Poorest
OC-PSO
NonlinTimeConstW
ConstantW, RandomW
SCE-PSO
NonlinTimeConstW
ConstantW, ConstrFactor
SCERand-PSO
AdaptW, NonlinTimeW
ConstantW, ConstrFactor, LinTimeVarying
f
8
Best
Poorest
OC-PSO
AdaptW
ConstrFactor
SCE-PSO
AdaptW
LinTimeVarying
SCERand-PSO
AdaptW
ConstantW, ConstrFactor, LinTimeVaryingW, NonlinTimeConstW
f
9
Best
Poorest
OC-PSO
ChaoticW
ConstantW, ConstrFactor, RandomW
SCE-PSO
ChaoticW
ConstantW, ConstrFactor
SCERand-PSO
ChaoticW
ConstantW
f
10
Best
Poorest
OC-PSO
ChaoticRandW
ConstantW
SCE-PSO
ChaoticW
ConstantW
SCERand-PSO
ChaoticRandW, ChaoticW, LinTimeVaryingW
ConstantW
f
11
Best
Poorest
OC-PSO
AdaptW, LinTimevaryingW, NonlinTimeConstW, NonlinTimeW
ConstantW, ConstrFactor
SCE-PSO
LinTimevaryingW
ConstantW, ConstrFactor, RandomW
SCERand-PSO
AdaptW
ConstantW, ConstrFactor, RandomWFor rotated functions (f
3
,
f
7
,
f
8
,
f
10
,
f
11) the best modification of the PSO algorithm appears to be “AdaptW” and the poorest is “CostantW.” For functions where there is no transformation matrix to rotate them, “AdaptW” is the best variant and the poorest variants are “ConstantW” and “ConstrFactor.”It is clear that the best modification of the particle swarm optimization algorithm for the selected benchmark functions is “AdaptW,” that is, adaptive inertia weight. The variant called “NonlinTimeConstW” also produced good results. On the other hand, the poorest modifications appear to be “ConstantW” and “ConstrFactor.”The convergence to the global optimum using particle swarm optimization is good, but only in three of the eleven benchmark functions is the obtained error value less than1
0
-
8. In spite of this, the shuffling mechanism improves the optimization. Strategies SCE-PSO and SCERand-PSO are better than OC-PSO in ten functions.The global minimum was achieved in three benchmark functions,f
1, f
2, and f
7, and our results are comparable with those of Hansen [45] who compares eleven optimization algorithms on twelve functions. The particle swarm optimization algorithm achieved the global minimum in functions f
1, f
2, f
3, f
6, and f
7. Our results using SCE-PSO are better than those of the optimization algorithms BLX-MA and DE and are as good as those from CoEVO as reported by Hansen [45].Bui et al. [12] achieved the global optimum in two unimodal functions f
1 and f
2 using the PSO method APSO1 and in three unimodal functions f
1, f
2, and f
4 using the DPSO method. APSO is PSO algorithm with adaptive constriction factor and in DPSO the bound of the velocity is adapted. None of their algorithms converge to the global minimum in multimodal functions [12]. In this regard, our results are better.Nickabadi et al. [13] compare six inertia weight adjusting methods on 15 test problems with dimension set to 30. If we look only at functions solved for this paper, Nickabadi et al. [13] achieved the global optimum in functions f
1, f
2, and f
8. They obtained the best results using the adaptive inertia weight, which they had proposed (modification “AdaptW” in this paper). Their results are comparable with those achieved in the present study. The difference being that our functions have shifted the global optimum, whereas Nickabadi et al. [13] did not.Figure1 presents the convergence graphs for each function while utilizing the best modification of the PSO algorithm. The x-axis indicates the number of function evaluations and the y-axis the logarithmic value of the best fitness, which is the difference between the searched and the best achieved functional value. A decline with the number of evaluations is clearly visible for all functions, thus indicating the approach to the global optimum.Convergence graphs for best fitness of the best modifications and strategy of PSO for functionsf
1
–
f
11 according to Table 3.
(a)
(b)
(c)
(d)
(e)
(f)
(g)
(h)
(i)
(j)
(k)


## 5. Conclusions

This paper compared 27 variants of particle swarm optimization algorithm. Eight modifications were performed using the parameter inertia weight and one modification using constriction factor. Both parameters improved the optimization. All modifications were tested with three strategies of swarm distribution, which were in terms of population. The population was either considered as a single unit (OC-PSO) or it was divided into several complexes. Division into complexes was made according to the functional value of each particle (SCE-PSO) or through random permutation (SCERand-PSO).The main aim of this work was to find the global minima of eleven benchmark functions prepared for the special session on real-parameter optimization of CEC 2005. The achievement of the minimum is when the obtained error value is less than1
0
-
8. We obtained the global minimum in two unimodal functions (f
1 and f
2) and in one multimodal function (f
7). The original particle swarm optimization has slow convergence to the global optimum, but the shuffling mechanism improves the optimization.The best modification of the PSO algorithm is the variant called “AdaptW.” The best choice for selected benchmark functions is to use the parameter of inertia weight, where thew value is adapted based on a feedback parameter. The best strategy for swarm distribution is SCE-PSO. Shuffled complex evolution particle swarm optimization with allocation of particles into complexes according to their functional values is better than OC-PSO and SCERand-PSO.



---

*Source: 293087-2014-06-15.xml*