# An Improved Convergence Particle Swarm Optimization Algorithm with Random Sampling of Control Parameters

Authors: Lijun Sun; Xiaodong Song; Tianfei Chen
Journal: Journal of Control Science and Engineering
 (2019)

---

## Abstract

Although particle swarm optimization (PSO) has been widely used to address various complicated engineering problems, it still needs to overcome the several shortcomings of PSO, e.g., premature convergence and low accuracy. Its final optimization result is related to the control parameters selection; therefore, an improved convergence particle swarm optimization algorithm with random sampling of control parameters is proposed. For the proposed algorithm, the random sampling strategy of control parameters is designed, which can promote the flexibility of algorithm parameters and simultaneously enhance the updating randomness for both particle velocity and position. According to the convergence analysis of PSO, the sampling range for inertial weight is determined after both the acceleration factors have already been sampled in their respective value interval, to ensure convergence for every evolution step of algorithm. Besides that, in order to make full use of dimension information of some better particles, the stochastic correction approach on each dimension for the population optimum value has been adopted. The final experiments results demonstrate that the proposed algorithm further improves the convergence rate while maintaining higher convergence accuracy, compared with basic particle swarm optimization and other variants.


---

## Body

## 1. Introduction

PSO, proposed by Kennedy and Eberhart [1], is an evolutionary algorithm based on swarm intelligence which simulates birds or fish predation, and it has already attracted a lot of interest from scholars and researchers for the reason that PSO has simple structure, strong maneuverability, easy realization, and other characteristics. Up to now, PSO has been successfully applied in many areas [2–6], and meanwhile some improved versions of PSO have also been studied accordingly [7–11].Inertial weight, which is the relatively important control parameter of PSO, is first introduced by Shi [12] into the basic evolution equations of algorithm, and from then on, some research about the influence of inertial weight on optimization performance has been carried out. In [13], Alfi proposes an adaptive particle swarm optimization algorithm in which a dynamic inertia weight is used. Based on the Bayesian theory, an adaptive adjustment strategy for inertia weight is designed by Zhang [14], and simultaneously the historical positions of particles are fully used. Although the convergence precision of this improved PSO is higher, the convergence speed becomes slow. After Han [15] compared several common updating ways for inertial weight, it can be concluded that the convergence performances of the simulated annealing updating method and the linear decreasing method are relatively better, but the acceleration coefficient, when it changed, has big influence on the convergence performance. Besides that, a linear updating way for acceleration coefficientc1 andc2 is put forward by Ratnaweera [16] through the corresponding parameter analysis, and Yamaguchi [17] proposed an adaptive adjustment strategy for acceleration coefficient according to the updated positions of particles. Furthermore, Liang [18] proposed a comprehensive learning particle swarm optimization algorithm using a novel learning method to improve the convergence performance. However, all the above literatures improve the convergence performance by modifying control parameters of algorithm, and they are only demonstrated through numerical simulation experiments, but because of lack of the corresponding theoretical convergence analysis, perhaps some part of the actual evolutionary process is divergent and unstable.The convergence of PSO algorithms should be based on the framework of random search algorithm [19], and it has been proved by Van den Bergh [20] that PSO is not a global optimization algorithm and also cannot be guaranteed to converge to a local optimum. On this basis, Trelea [21] utilized the linear dynamic system theory with constant coefficient to analyze the stability of basic PSO, and Clerc [22] established a constraint model of PSO described by only five parameters; then the convergence and trajectories of particles in phase plane were analyzed. Starting with the Markov chain formed by particles states, Ren [23] has pointed out that this Markov chain does not have conditions for stationary processes, and then it was proved that PSO is not globally convergent in the view of transition probability. On the basis of stochastic system theory, Jin [24] analyzed the mean square convergence of PSO and provided a sufficient condition of convergence. Although some these literatures for convergence analysis supply sufficient conditions, it is still not given how to adjust control parameters of algorithm in evolution process in order to get better convergence performance.In view of the problems mentioned above, this paper proposes an improved convergence particle swarm optimization algorithm with random sampling of control parameters (SC-PSO), and the main contribution of the present work is delineated as follows.( 1 ) The random sampling strategy is designed to improve the flexibility of control parameters, which also can strengthen the position updating randomness of particles to enhance the exploration ability of PSO and help to jump out of local optimum.( 2 ) In order to ensure the convergence of the algorithm, the inertia weight is selected around the center part of the convergence interval, and the phenomenon of “oscillation” and “two steps forward, one step back” can be prevented.( 3 ) Due to the weakness of exploitation caused by the random sampling strategy, the intermediate particle updating strategy is devised to update the optimal position of swarm population in every evolution step. In addition, the optimal value is updated dimensionally, and the dimensionality information of different particles is used to randomly select the value, so as to find the better position in the dimension.This paper is organized as follows. Section2 introduces the basic PSO and gives its theoretical analysis of convergence. Section 3 describes the proposed algorithm in detail. Section 4 presents the test functions, the parameters setting of each algorithm, the results, and discussions. Conclusions are given in Section 5.


## 2. PSO Algorithm

### 2.1. Basic PSO

While PSO is running, each particle is regarded as a feasible solution to the optimization problem in search space and the flight behavior of particles can be treated as the search process of all individuals; then the velocity of particles is dynamically updated according to the historical optimal position of particle and the optimal position of swarm population. It is assumed that the swarm population is composed ofM particles inD dimensional space, and the historical optimal position of theith particle is represented by pi, i∈{1,2,⋯,M}, and the optimal position of swarm population is denoted as pg. In every evolution step, the velocity vi and position xi for each particle are updated by dynamically tracking its corresponding historical optimal position and the optimal position of swarm population. The detailed equations are expressed as follows:(1)vi,dt+1=ω·vi,dt+c1·r1·pi,dt-xi,dt+c2·r2·pg,dt-xi,dt(2)xi,dt+1=xi,dt+vi,dt+1 wheret shows the iteration number and d∈{1,2,⋯,D} indicates dimension; thusxi,d(t) is thedth dimension variable of theith particle in thetth iteration, and variablesvi,d(t),pg,d(t), andpi,d(t) have the similar meanings in turn;ω is inertial weight, andc1 andc2 denote acceleration coefficients;r1 andr2 are random numbers uniformly distributed in interval [0,1].According to the detailed optimization problem to be settled, the objective function should be set, and the objective function values of each particle are corresponding fitness values. The fitness value can be used to not only measure the position of particles but also update the historical optimal position of particles and the optimal position of swarm population.


### 2.2. Convergence Analysis

The convergence of particles trajectories is determined by control parameters of algorithm, and in order to facilitate analysis and generality, the case of a single particle system having only one dimension is taken as an example. After that, the basic evolution equations (1) and (2) can be transformed into the dynamic equation form.(3)vt+1xt+1=ω-φtω1-φtvtxt+φ1tφ2tφ1tφ2tpitpgtwhere we define φ1=c1·r1, φ2=c2·r2, and φ=φ1+φ2. If the historical optimal position of particle pi finally converges to the optimal position of swarm population pg, the dynamic equation (3) can be arranged as follows:(4)vt+1xt+1=ω-φtω1-φtvtxt+φt·pgφt·pgFor (4), [24] has given a sufficient condition of mean square convergence through theoretical analysis, and this condition is expressed as(5)ω<10<μ<2ω+1a0<11-a2+a1-a0>01+a2+a1+a0>01-a02>a1-a0a2where(6)μ=Eφt=c1+c22a0=-ω3a1=μ2ω-σ2ω-ω2a2=ω-μ2-σ2σ2=Dφt=c12+c2212According to formula (5) and (6), it is easy to get the relationship between inertial weight ω and acceleration coefficientsc1 andc2 at the situation of convergence.


## 2.1. Basic PSO

While PSO is running, each particle is regarded as a feasible solution to the optimization problem in search space and the flight behavior of particles can be treated as the search process of all individuals; then the velocity of particles is dynamically updated according to the historical optimal position of particle and the optimal position of swarm population. It is assumed that the swarm population is composed ofM particles inD dimensional space, and the historical optimal position of theith particle is represented by pi, i∈{1,2,⋯,M}, and the optimal position of swarm population is denoted as pg. In every evolution step, the velocity vi and position xi for each particle are updated by dynamically tracking its corresponding historical optimal position and the optimal position of swarm population. The detailed equations are expressed as follows:(1)vi,dt+1=ω·vi,dt+c1·r1·pi,dt-xi,dt+c2·r2·pg,dt-xi,dt(2)xi,dt+1=xi,dt+vi,dt+1 wheret shows the iteration number and d∈{1,2,⋯,D} indicates dimension; thusxi,d(t) is thedth dimension variable of theith particle in thetth iteration, and variablesvi,d(t),pg,d(t), andpi,d(t) have the similar meanings in turn;ω is inertial weight, andc1 andc2 denote acceleration coefficients;r1 andr2 are random numbers uniformly distributed in interval [0,1].According to the detailed optimization problem to be settled, the objective function should be set, and the objective function values of each particle are corresponding fitness values. The fitness value can be used to not only measure the position of particles but also update the historical optimal position of particles and the optimal position of swarm population.


## 2.2. Convergence Analysis

The convergence of particles trajectories is determined by control parameters of algorithm, and in order to facilitate analysis and generality, the case of a single particle system having only one dimension is taken as an example. After that, the basic evolution equations (1) and (2) can be transformed into the dynamic equation form.(3)vt+1xt+1=ω-φtω1-φtvtxt+φ1tφ2tφ1tφ2tpitpgtwhere we define φ1=c1·r1, φ2=c2·r2, and φ=φ1+φ2. If the historical optimal position of particle pi finally converges to the optimal position of swarm population pg, the dynamic equation (3) can be arranged as follows:(4)vt+1xt+1=ω-φtω1-φtvtxt+φt·pgφt·pgFor (4), [24] has given a sufficient condition of mean square convergence through theoretical analysis, and this condition is expressed as(5)ω<10<μ<2ω+1a0<11-a2+a1-a0>01+a2+a1+a0>01-a02>a1-a0a2where(6)μ=Eφt=c1+c22a0=-ω3a1=μ2ω-σ2ω-ω2a2=ω-μ2-σ2σ2=Dφt=c12+c2212According to formula (5) and (6), it is easy to get the relationship between inertial weight ω and acceleration coefficientsc1 andc2 at the situation of convergence.


## 3. Our Proposal: SC-PSO Algorithm

### 3.1. Random Sampling Strategy for Control Parameters

For basic PSO, control parameters have great impact on the performance of algorithm. If they are assigned inappropriately, the trajectories of particles cannot converge and may even be unstable, which will cause that the optimal solution of optimization problems cannot be found. At present, the control parameters are usually chosen according to the experience or experiments from engineers, so it is not flexible and the exploration ability of PSO has also been greatly restricted.Random sampling strategy is designed to improve the flexibility of control parameters and enhance the exploration ability of PSO to help to jump out of local optimum. On the basis of the conclusion from [24], the convergence of PSO should be considered when the parameters are randomly selected. First of all, acceleration coefficientsc1 andc2 are, respectively, uniformly sampled in their corresponding value interval, and the parametersμ andσ can be computed using formula (6). According to the condition of mean square convergence from formula (5), the sampling interval for inertial weightω can be solved.(7)ω_≤ω≤ω¯where ω_ and ω¯, respectively, denote the lower bound and the upper bound.(8)ω_=μ2-σ2-μ2-σ22-8μμ-12+σ2-14μ(9)ω¯=μ2-σ2+μ2-σ22-8μμ-12+σ2-14μFinally, the inertial weight ought to be sampled in the above computed interval. However, in order to avoid the phenomenon of “oscillation” and “two steps forward, one step back,” the inertia weight is selected around the center part of the convergence interval ofω. According to formula (8) and (9), Figure 1 shows the relationship betweenμ andωfor mean square convergence of PSO. For example, when the acceleration coefficients have been already sampled,c1=c2=2, and then parametersμ andσ2 can be computed,μ=2,σ2=2/3. The convergence interval of inertial weight is [0.333,0.5]. In practice, the inertial weight is uniformly selected around the center part of the above interval to avoid the phenomenon of “oscillation” and “two steps forward, one step back.”Figure 1
The relationship betweenμ andω for mean square convergence of PSO.On the basis of random sampling strategy, all particles in swarm update their positions and velocity using formula (1) and (2) in every evolution step. Besides that, intermediate particle updating strategy is meanwhile devised to avoid premature which is caused by the strong randomness of sampling strategy of control parameters, and it is only used to update the optimal position of swarm population in every evolution step.The method for generating intermediate particles is as follows:( 1 ). Intermediate particle 1 (Xitemp(1)): the position of this particle in each dimension is the average value of all updated particles in the same dimension.(10)Xitemp1d=∑i=1Mxi,dM;d∈1,2,⋯,D( 2 ). Intermediate particle 2 (Xitemp(2)): the value of this particle in each dimension is equal to the median of particles in the corresponding dimension.(11)Xitemp2d=medianx:,d;d∈1,2,⋯,D( 3 ). Intermediate particle 3 (Xitemp(3)d): each dimension value of this particle is the one which has larger absolute value of maximum and minimum in the same dimension.(12)Xitemp3d=minx:,dminx;,d>maxx:,dmaxx:,delse;d∈1,2,⋯,D( 4 ). Intermediate particle 4 (Xitemp(4)d): each dimension value of this particle is the one which has smaller absolute value of maximum and minimum in the corresponding dimension.(13)Xitemp4d=minx:,dminX:,d<maxX:,dmaxx:,delse;d∈1,2,⋯,DWe choose the one which has the best fitness value from the four intermediate particles. If it is better than the optimal position, the optimal position of swarm population will be replaced by it; otherwise, the optimal position remains unchanged.


### 3.2. Stochastic Correction Approach on Each Dimension for the Optimal Position

The intermediate particles mentioned in the above section are only used to correct the optimal position in the same dimensions; however, we know that the positions of particles are evaluated overall, and the historical optimal positions of particles, which are less than the optimal position of swarm, may have some useful information at some dimensions. Therefore, the stochastic correction approach on each dimension for the optimal position is used in this section.According to the fitness value order of historical optimal positions of particles, we select five better historical optimal positions of particles denoted aspind,ind = 1,2,⋯,5, and then the procedure of stochastic correction approach on each dimension for the optimal position is described in detail as follows:ford=1,2,⋯,D
value1=value2=pg;% two dimensions m and n are randomly selected from the five better historical optimal positionpind and the optimal position pg to determine the correction range; m∈{1,2,⋯,D}, n∈{1,2,⋯,D} and m≠n≠d;minvalue=min(pg,j,⋯pind,j,⋯), and j=m,n,d;ind=1,2,⋯,5;maxvalue=max(pg,j,⋯,pind,j,⋯), and j=m,n,d;ind=1,2,⋯,5;average=(minvalue+maxvalue)/2;%value1(d) indicates the dth dimension value ofvalue1, andvalue2(d) is the similar; and rand() is a random number uniformly distributed in the interval [0,1].value1(d)=minvalue+rand()·(average-minvalue);value2(d)=average+rand()·(maxvalue-average);(14)pg,d=value1dfvalue1<fpg&fvalue1<fvalue2value2dfvalue2<fpg&fvalue2≤fvalue1pg,delseend


### 3.3. Algorithm Flow

The whole process of SC-PSO algorithm is shown in Figure2.Figure 2
Flow chart of SC-PSO.


## 3.1. Random Sampling Strategy for Control Parameters

For basic PSO, control parameters have great impact on the performance of algorithm. If they are assigned inappropriately, the trajectories of particles cannot converge and may even be unstable, which will cause that the optimal solution of optimization problems cannot be found. At present, the control parameters are usually chosen according to the experience or experiments from engineers, so it is not flexible and the exploration ability of PSO has also been greatly restricted.Random sampling strategy is designed to improve the flexibility of control parameters and enhance the exploration ability of PSO to help to jump out of local optimum. On the basis of the conclusion from [24], the convergence of PSO should be considered when the parameters are randomly selected. First of all, acceleration coefficientsc1 andc2 are, respectively, uniformly sampled in their corresponding value interval, and the parametersμ andσ can be computed using formula (6). According to the condition of mean square convergence from formula (5), the sampling interval for inertial weightω can be solved.(7)ω_≤ω≤ω¯where ω_ and ω¯, respectively, denote the lower bound and the upper bound.(8)ω_=μ2-σ2-μ2-σ22-8μμ-12+σ2-14μ(9)ω¯=μ2-σ2+μ2-σ22-8μμ-12+σ2-14μFinally, the inertial weight ought to be sampled in the above computed interval. However, in order to avoid the phenomenon of “oscillation” and “two steps forward, one step back,” the inertia weight is selected around the center part of the convergence interval ofω. According to formula (8) and (9), Figure 1 shows the relationship betweenμ andωfor mean square convergence of PSO. For example, when the acceleration coefficients have been already sampled,c1=c2=2, and then parametersμ andσ2 can be computed,μ=2,σ2=2/3. The convergence interval of inertial weight is [0.333,0.5]. In practice, the inertial weight is uniformly selected around the center part of the above interval to avoid the phenomenon of “oscillation” and “two steps forward, one step back.”Figure 1
The relationship betweenμ andω for mean square convergence of PSO.On the basis of random sampling strategy, all particles in swarm update their positions and velocity using formula (1) and (2) in every evolution step. Besides that, intermediate particle updating strategy is meanwhile devised to avoid premature which is caused by the strong randomness of sampling strategy of control parameters, and it is only used to update the optimal position of swarm population in every evolution step.The method for generating intermediate particles is as follows:( 1 ). Intermediate particle 1 (Xitemp(1)): the position of this particle in each dimension is the average value of all updated particles in the same dimension.(10)Xitemp1d=∑i=1Mxi,dM;d∈1,2,⋯,D( 2 ). Intermediate particle 2 (Xitemp(2)): the value of this particle in each dimension is equal to the median of particles in the corresponding dimension.(11)Xitemp2d=medianx:,d;d∈1,2,⋯,D( 3 ). Intermediate particle 3 (Xitemp(3)d): each dimension value of this particle is the one which has larger absolute value of maximum and minimum in the same dimension.(12)Xitemp3d=minx:,dminx;,d>maxx:,dmaxx:,delse;d∈1,2,⋯,D( 4 ). Intermediate particle 4 (Xitemp(4)d): each dimension value of this particle is the one which has smaller absolute value of maximum and minimum in the corresponding dimension.(13)Xitemp4d=minx:,dminX:,d<maxX:,dmaxx:,delse;d∈1,2,⋯,DWe choose the one which has the best fitness value from the four intermediate particles. If it is better than the optimal position, the optimal position of swarm population will be replaced by it; otherwise, the optimal position remains unchanged.


## 3.2. Stochastic Correction Approach on Each Dimension for the Optimal Position

The intermediate particles mentioned in the above section are only used to correct the optimal position in the same dimensions; however, we know that the positions of particles are evaluated overall, and the historical optimal positions of particles, which are less than the optimal position of swarm, may have some useful information at some dimensions. Therefore, the stochastic correction approach on each dimension for the optimal position is used in this section.According to the fitness value order of historical optimal positions of particles, we select five better historical optimal positions of particles denoted aspind,ind = 1,2,⋯,5, and then the procedure of stochastic correction approach on each dimension for the optimal position is described in detail as follows:ford=1,2,⋯,D
value1=value2=pg;% two dimensions m and n are randomly selected from the five better historical optimal positionpind and the optimal position pg to determine the correction range; m∈{1,2,⋯,D}, n∈{1,2,⋯,D} and m≠n≠d;minvalue=min(pg,j,⋯pind,j,⋯), and j=m,n,d;ind=1,2,⋯,5;maxvalue=max(pg,j,⋯,pind,j,⋯), and j=m,n,d;ind=1,2,⋯,5;average=(minvalue+maxvalue)/2;%value1(d) indicates the dth dimension value ofvalue1, andvalue2(d) is the similar; and rand() is a random number uniformly distributed in the interval [0,1].value1(d)=minvalue+rand()·(average-minvalue);value2(d)=average+rand()·(maxvalue-average);(14)pg,d=value1dfvalue1<fpg&fvalue1<fvalue2value2dfvalue2<fpg&fvalue2≤fvalue1pg,delseend


## 3.3. Algorithm Flow

The whole process of SC-PSO algorithm is shown in Figure2.Figure 2
Flow chart of SC-PSO.


## 4. Numerical Simulation Experiments

### 4.1. Experiments Settings

In order to demonstrate the performance of the proposed algorithm SC-PSO, the basic PSO and the other three improved versions of PSO are selected to compare. For convenience, the basic PSO is represented by A1; A2 indicates DCW-PSO in [25] which can dynamically adjust the inertial weight; LDC-PSO in [26], represented by A3, makes the acceleration coefficientc1 be linearly increased but the acceleration coefficientc2 be linearly declined. Algorithm A4(DPSO) is an improved algorithm using asynchronous learning variation strategy for learning factors [27]. Reference [28] describes the SS-PSO, marked by A5, which is based on the principle of Latin Hypercube Sampling. Finally, the proposed algorithm SC-PSO is marked by A5. Table 1 shows five benchmark functions and their corresponding features.Table 1
Benchmark functions.
function function expression search range global optimum Sphere f 1 ( X ) = ∑ i = 1 D x i 2 - 100,100 D 0 Rosenbrock f 2 ( X ) = ∑ i = 1 D - 1 ( 100 ( x i + 1 - x i 2 ) 2 + ( x i - 1 ) 2 ) - 2.048,2.048 D 0 Griewank f 3 X = 1 4000 ∑ i = 1 D x i 2 - ∏ i = 1 D cos ⁡ x i i + 1 - 600,600 D 0 Ackley f 4 ( X ) = - 20 e x p - 0.2 1 D ∑ i = 1 D x i 2 - 32.768,32.768 D 0 - e x p 1 D ∑ i = 1 D cos ⁡ 2 π x i + e + 20 Schwefel f 5 ( X ) = 418.9829 D - ∑ i = 1 D x i s i n x i 1 / 2 - 500,500 D 0 Weierstrass f 6 ( X ) = ∑ i = 1 D ∑ k = 1 20 a k c o s ( 2 π b k ( x i + 0.5 ) ) - 0.5,0.5 D 0 - D ∑ k = 0 20 [ a k c o s ( 2 π b k ⋅ 0.5 ) ] a = 0.5 ,   b = 3 Noncontinuous Rastrigin’s f 7 X = ∑ i = 1 D y i 2 - 10  c o s 2 π y i + 10 - 5.12,5.12 D 0 y i = x i x i < 0.5 r o u n d ( 2 x i ) 2 x i ≥ 0.5 Quartic f 8 ( X ) = ∑ i = 1 D i x i 4 - 1.28,1.28 D 0 Schwefel 2.22 f 9 ( X ) = ∑ i = 1 D x i + ∏ i = 1 D x i - 10,10 D 0 Schaffer6 f 10 X = ∑ i = 1 D 0.5 + s i n 2 ( 100 x i 2 + x i + 1 2 ) - 0.5 1 + 0.001 ( x i 2 - 2 x i x i + 1 + x x + 1 2 ) 2 - 100,100 D 0The problem dimension of the benchmark functions is set, respectively, as 30 and 50, and the sample interval for both acceleration coefficientsc1 andc2 is [0,2]; in addition, maximum function evaluation timesMFEs= 30000, and the size of population for every algorithm is 20. All the algorithms were conducted independently 30 times with different random initial positions.


### 4.2. Performance Analysis

Tables2 and 3, respectively, show the optimization results of all the algorithms on benchmark functions for 30 dimensions and 50 dimensions. In both tables, Mean denotes the mean value of optimization results, and Std represents the standard deviation of results. From Tables 2 and 3, it can be concluded that the performance of SC-PSO proposed in this paper is better than the other algorithms. Compared with the basic PSO, the performance of the improved PSO variants has been greatly improved. For functionsf1,f8, andf9, the convergence accuracy of the proposed algorithm is obviously better than that of all other algorithms. Forf2,f3, andf10, the convergence accuracy of the proposed algorithms is improved slightly. Besides that, for the remaining test functions, the performance convergence accuracy of PSO, DCW-PSO, LDC-PSO, and DPSO is almost the same, and their convergence accuracy is worse than that of SS-PSO and the proposed algorithm. Table 3 shows the optimization result on benchmark functions in 50 dimensions; it can be seen from the rankings in the table that the change of function and dimension has little influence on the quality of the algorithm.Table 2
Comparison of the optimization results on benchmark functions (30D).
function algorithm PSO DCW-PSO LDC-PSO DPSO SS-PSO SC-PSO f 1 Mean 7.59E+03 9.11E-10 8.29E-12 4.63E-06 3.06E-67 4.13E-125 Std 9.98E+03 4.07E-09 2.96E-11 1.40E-05 1.23E-66 1.60E-124 Rank 6 4 3 5 2 1  f 2 Mean 1.05E+03 2.68E+01 3.31E+01 3.81E+01 2.98E+01 2.61E+01 Std 8.56E+02 1.82E+01 2.28E+01 2.39E+01 1.70E+01 6.17E+00 Rank 6 2 4 5 3 1  f 3 Mean 6.83E+01 2.54E-01 9.97E-02 3.16E-02 1.03E-02 1.04E-02 Std 8.03E+01 4.25E-01 1.26E-01 3.35E-02 1.44E-02 3.70E-02 Rank 6 5 4 3 2 1  f 4 Mean 1.54E+01 7.56E+00 4.57E+00 2.35E+00 4.87E-14 2.15E-14 Std 2.71E+00 2.38E+00 1.21E+00 3.00E+00 1.01E-14 7.24E-15 Rank 6 5 4 3 2 1  f 5 Mean 5.40E+03 4.85E+03 4.77E+03 3.40E+03 3.82E-04 3.82E-04 Std 6.16E+02 8.06E+02 8.83E+02 7.63E+02 7.05E-12 2.25E-12 Rank 6 5 4 3 1 1  f 6 Mean 2.36E+01 1.47E+01 6.38E+00 6.03E+00 3.20E-14 7.82E-15 Std 5.74E+00 1.78E+00 1.97E+00 3.84E+00 2.49E-14 6.06E-15 Rank 6 5 4 3 2 1  f 7 Mean 1.29E+02 9.26E+01 8.04E+01 2.91E+01 0.00E+00 0.00E+00 Std 4.19E+01 2.13E+01 3.13E+01 1.74E+01 0.00E+00 0.00E+00 Rank 6 4 5 3 1 1  f 8 Mean 4.10E+00 6.13E-60 7.21E-24 1.35E-08 4.19E-139 5.76E-253 Std 6.46E+00 2.15E-59 3.21E-23 5.58E-08 1.87E-138 0.00E+00 Rank 6 3 4 5 2 1  f 9 Mean 3.19E+01 2.05E+00 7.55E-03 6.22E+01 1.22E-34 1.22E-64 Std 1.73E+01 1.71E+00 1.42E-02 2.35E+01 2.05E-34 9.86E-65 Rank 6 4 3 5 2 1  f 10 Mean 8.58E+00 1.02E+01 9.31E+00 1.03E+01 3.13E+00 1.49E+00 Std 1.39E+00 7.68E-01 9.44E-01 6.89E-01 8.29E-01 8.05E-01 Rank 3 5 4 6 2 1  Average Rank 5.7 4.2 3.9 4.1 1.9 1 Total rank 6 5 3 4 2 1Table 3
Comparison of the optimization results on benchmark functions (50D).
function algorithm PSO DCW-PSO LDC-PSO DPSO SS-PSO SC-PSO f 1 Mean 4.64E+04 8.63E-02 1.12E-03 2.46E-01 5.26E-59 8.06E-87 Std 1.45E+04 9.92E-02 8.26E-04 2.96E-01 6.84E-59 2.85E-87 Rank 6 4 3 5 2 1  f 2 Mean 4.06E+03 8.15E+01 7.75E+01 1.23E+02 4.91E+01 4.89E+01 Std 1.60E+03 3.12E+01 4.12E+01 5.55E+01 1.74E+01 6.04E+00 Rank 6 4 3 5 2 1  f 3 Mean 3.70E+02 1.59E+00 4.66E-01 4.00E-01 5.66E-03 4.93E-03 Std 1.33E+02 2.26E+00 6.53E-01 6.26E-01 9.00E-03 9.59E-03 Rank 6 5 4 3 2 1  f 4 Mean 1.88E+01 1.33E+01 8.68E+00 8.32E+00 8.76E-14 3.69E-14 Std 1.21E+00 1.78E+00 1.47E+00 3.79E+00 1.44E-14 7.42E-15 Rank 6 5 4 3 2 1  f 5 Mean 1.10E+04 8.81E+03 1.05E+04 5.25E+03 6.36E-04 6.36E-04 Std 8.08E+02 6.17E+02 1.28E+03 9.32E+02 1.37E-11 1.47E-09 Rank 6 4 5 3 1 1  f 6 Mean 5.99E+01 3.51E+01 2.15E+01 1.30E+01 9.59E-14 2.84E-14 Std 7.96E+00 3.95E+00 3.09E+00 4.60E+00 6.04E-14 1.03E-14 Rank 6 5 4 3 2 1  f 7 Mean 3.37E+02 2.11E+02 1.70E+02 1.06E+02 0.00E+00 0.00E+00 Std 6.89E+01 3.62E+01 6.86E+01 3.42E+01 0.00E+00 0.00E+00 Rank 6 4 5 3 1 1  f 8 Mean 8.37E+01 3.49E-18 3.14E-04 4.33E-05 1.37E-122 7.49E-175 Std 4.00E+01 7.07E-18 1.32E-03 1.14E-04 4.24E-122 0.00E+00 Rank 6 3 5 4 2 1  f 9 Mean 1.11E+02 2.23E+01 1.19E+00 1.56E+12 6.71E-30 1.70E-44 Std 1.97E+01 1.08E+01 1.23E+00 8.44E+12 8.51E-30 1.58E-44 Rank 6 4 3 5 2 1  f 10 Mean 1.62E+01 1.91E+01 1.65E+01 1.93E+01 5.11E+00 3.44E+00 Std 1.33E+00 1.02E+00 2.00E+00 5.87E-01 1.02E+00 1.07E+00 Rank 3 5 4 6 2 1  Average Rank 5.7 4.3 4.0 4.0 1.8 1 Total Rank 6 5 3 3 2 1In order to intuitively investigate the convergence performance of SC-PSO, the convergence curves of the 6 algorithms (PSO, DCW-PSO, LDC-PSO, DPSO, SS-PSO, and SC-PSO) are on the 10 selected functions. From Figures5, 7–9, and 12, SC-PSO’s convergence speed is faster than of any of the comparison algorithms and its advantages are prominent. In Figures 4 and 6, the convergence speed of SC-PSO is also faster than that of any of the comparison algorithms, but its advantages are not sharp. From Figures 3, 10, and 11, SC-PSO’s convergence speed is almost the same as that of SS-PSO in the early stage, but its convergence accuracy is better than that of SS-PSO. On the whole, SC-PSO has the best convergence performance. In general, the convergence performance of SC-PSO on the 10 functions is much better than other algorithms. The convergence curves further prove that improvement strategies are effective and that SC-PSO has good convergence performance.Figure 3
The functionf1 iterates over the curve.Figure 4
The functionf2 iterates over the curve.Figure 5
The functionf3 iterates over the curve.Figure 6
The functionf4 iterates over the curve.Figure 7
The functionf5 iterates over the curve.Figure 8
The functionf6 iterates over the curve.Figure 9
The functionf7 iterates over the curve.Figure 10
The functionf8 iterates over the curve.Figure 11
The functionf9 iterates over the curve.Figure 12
The functionf10 iterates over the curve.In summary, compared with basic PSO and its modified versions, the convergence rate of SC-PSO proposed in this paper is significantly improved while its convergence accuracy is still guaranteed higher.


### 4.3. Running Time Analysis

From Figure13, on average runtime, SC-PSO is the least among the 6 algorithms, which means that the speed of SC-PSO is the faster. Compared with PSO, SC-PSO’s average runtime is 0.7725 s, while PSO’s is 2.1244s, and SC-PSO’s average runtime is 36% of PSO’s. Compared with the other 4 algorithms, SC-PSO’s average runtime accounts for 34%, 37%, 20%, and 43% of DCW-PSO’s (2.2871s), LDC-PSO’s (2.0658s), DPSO’s (3.8148s), and SS-PSO’s (1.7965s), respectively.Figure 13
Average runtime comparison of the 6 algorithms (Sphere 30D).


## 4.1. Experiments Settings

In order to demonstrate the performance of the proposed algorithm SC-PSO, the basic PSO and the other three improved versions of PSO are selected to compare. For convenience, the basic PSO is represented by A1; A2 indicates DCW-PSO in [25] which can dynamically adjust the inertial weight; LDC-PSO in [26], represented by A3, makes the acceleration coefficientc1 be linearly increased but the acceleration coefficientc2 be linearly declined. Algorithm A4(DPSO) is an improved algorithm using asynchronous learning variation strategy for learning factors [27]. Reference [28] describes the SS-PSO, marked by A5, which is based on the principle of Latin Hypercube Sampling. Finally, the proposed algorithm SC-PSO is marked by A5. Table 1 shows five benchmark functions and their corresponding features.Table 1
Benchmark functions.
function function expression search range global optimum Sphere f 1 ( X ) = ∑ i = 1 D x i 2 - 100,100 D 0 Rosenbrock f 2 ( X ) = ∑ i = 1 D - 1 ( 100 ( x i + 1 - x i 2 ) 2 + ( x i - 1 ) 2 ) - 2.048,2.048 D 0 Griewank f 3 X = 1 4000 ∑ i = 1 D x i 2 - ∏ i = 1 D cos ⁡ x i i + 1 - 600,600 D 0 Ackley f 4 ( X ) = - 20 e x p - 0.2 1 D ∑ i = 1 D x i 2 - 32.768,32.768 D 0 - e x p 1 D ∑ i = 1 D cos ⁡ 2 π x i + e + 20 Schwefel f 5 ( X ) = 418.9829 D - ∑ i = 1 D x i s i n x i 1 / 2 - 500,500 D 0 Weierstrass f 6 ( X ) = ∑ i = 1 D ∑ k = 1 20 a k c o s ( 2 π b k ( x i + 0.5 ) ) - 0.5,0.5 D 0 - D ∑ k = 0 20 [ a k c o s ( 2 π b k ⋅ 0.5 ) ] a = 0.5 ,   b = 3 Noncontinuous Rastrigin’s f 7 X = ∑ i = 1 D y i 2 - 10  c o s 2 π y i + 10 - 5.12,5.12 D 0 y i = x i x i < 0.5 r o u n d ( 2 x i ) 2 x i ≥ 0.5 Quartic f 8 ( X ) = ∑ i = 1 D i x i 4 - 1.28,1.28 D 0 Schwefel 2.22 f 9 ( X ) = ∑ i = 1 D x i + ∏ i = 1 D x i - 10,10 D 0 Schaffer6 f 10 X = ∑ i = 1 D 0.5 + s i n 2 ( 100 x i 2 + x i + 1 2 ) - 0.5 1 + 0.001 ( x i 2 - 2 x i x i + 1 + x x + 1 2 ) 2 - 100,100 D 0The problem dimension of the benchmark functions is set, respectively, as 30 and 50, and the sample interval for both acceleration coefficientsc1 andc2 is [0,2]; in addition, maximum function evaluation timesMFEs= 30000, and the size of population for every algorithm is 20. All the algorithms were conducted independently 30 times with different random initial positions.


## 4.2. Performance Analysis

Tables2 and 3, respectively, show the optimization results of all the algorithms on benchmark functions for 30 dimensions and 50 dimensions. In both tables, Mean denotes the mean value of optimization results, and Std represents the standard deviation of results. From Tables 2 and 3, it can be concluded that the performance of SC-PSO proposed in this paper is better than the other algorithms. Compared with the basic PSO, the performance of the improved PSO variants has been greatly improved. For functionsf1,f8, andf9, the convergence accuracy of the proposed algorithm is obviously better than that of all other algorithms. Forf2,f3, andf10, the convergence accuracy of the proposed algorithms is improved slightly. Besides that, for the remaining test functions, the performance convergence accuracy of PSO, DCW-PSO, LDC-PSO, and DPSO is almost the same, and their convergence accuracy is worse than that of SS-PSO and the proposed algorithm. Table 3 shows the optimization result on benchmark functions in 50 dimensions; it can be seen from the rankings in the table that the change of function and dimension has little influence on the quality of the algorithm.Table 2
Comparison of the optimization results on benchmark functions (30D).
function algorithm PSO DCW-PSO LDC-PSO DPSO SS-PSO SC-PSO f 1 Mean 7.59E+03 9.11E-10 8.29E-12 4.63E-06 3.06E-67 4.13E-125 Std 9.98E+03 4.07E-09 2.96E-11 1.40E-05 1.23E-66 1.60E-124 Rank 6 4 3 5 2 1  f 2 Mean 1.05E+03 2.68E+01 3.31E+01 3.81E+01 2.98E+01 2.61E+01 Std 8.56E+02 1.82E+01 2.28E+01 2.39E+01 1.70E+01 6.17E+00 Rank 6 2 4 5 3 1  f 3 Mean 6.83E+01 2.54E-01 9.97E-02 3.16E-02 1.03E-02 1.04E-02 Std 8.03E+01 4.25E-01 1.26E-01 3.35E-02 1.44E-02 3.70E-02 Rank 6 5 4 3 2 1  f 4 Mean 1.54E+01 7.56E+00 4.57E+00 2.35E+00 4.87E-14 2.15E-14 Std 2.71E+00 2.38E+00 1.21E+00 3.00E+00 1.01E-14 7.24E-15 Rank 6 5 4 3 2 1  f 5 Mean 5.40E+03 4.85E+03 4.77E+03 3.40E+03 3.82E-04 3.82E-04 Std 6.16E+02 8.06E+02 8.83E+02 7.63E+02 7.05E-12 2.25E-12 Rank 6 5 4 3 1 1  f 6 Mean 2.36E+01 1.47E+01 6.38E+00 6.03E+00 3.20E-14 7.82E-15 Std 5.74E+00 1.78E+00 1.97E+00 3.84E+00 2.49E-14 6.06E-15 Rank 6 5 4 3 2 1  f 7 Mean 1.29E+02 9.26E+01 8.04E+01 2.91E+01 0.00E+00 0.00E+00 Std 4.19E+01 2.13E+01 3.13E+01 1.74E+01 0.00E+00 0.00E+00 Rank 6 4 5 3 1 1  f 8 Mean 4.10E+00 6.13E-60 7.21E-24 1.35E-08 4.19E-139 5.76E-253 Std 6.46E+00 2.15E-59 3.21E-23 5.58E-08 1.87E-138 0.00E+00 Rank 6 3 4 5 2 1  f 9 Mean 3.19E+01 2.05E+00 7.55E-03 6.22E+01 1.22E-34 1.22E-64 Std 1.73E+01 1.71E+00 1.42E-02 2.35E+01 2.05E-34 9.86E-65 Rank 6 4 3 5 2 1  f 10 Mean 8.58E+00 1.02E+01 9.31E+00 1.03E+01 3.13E+00 1.49E+00 Std 1.39E+00 7.68E-01 9.44E-01 6.89E-01 8.29E-01 8.05E-01 Rank 3 5 4 6 2 1  Average Rank 5.7 4.2 3.9 4.1 1.9 1 Total rank 6 5 3 4 2 1Table 3
Comparison of the optimization results on benchmark functions (50D).
function algorithm PSO DCW-PSO LDC-PSO DPSO SS-PSO SC-PSO f 1 Mean 4.64E+04 8.63E-02 1.12E-03 2.46E-01 5.26E-59 8.06E-87 Std 1.45E+04 9.92E-02 8.26E-04 2.96E-01 6.84E-59 2.85E-87 Rank 6 4 3 5 2 1  f 2 Mean 4.06E+03 8.15E+01 7.75E+01 1.23E+02 4.91E+01 4.89E+01 Std 1.60E+03 3.12E+01 4.12E+01 5.55E+01 1.74E+01 6.04E+00 Rank 6 4 3 5 2 1  f 3 Mean 3.70E+02 1.59E+00 4.66E-01 4.00E-01 5.66E-03 4.93E-03 Std 1.33E+02 2.26E+00 6.53E-01 6.26E-01 9.00E-03 9.59E-03 Rank 6 5 4 3 2 1  f 4 Mean 1.88E+01 1.33E+01 8.68E+00 8.32E+00 8.76E-14 3.69E-14 Std 1.21E+00 1.78E+00 1.47E+00 3.79E+00 1.44E-14 7.42E-15 Rank 6 5 4 3 2 1  f 5 Mean 1.10E+04 8.81E+03 1.05E+04 5.25E+03 6.36E-04 6.36E-04 Std 8.08E+02 6.17E+02 1.28E+03 9.32E+02 1.37E-11 1.47E-09 Rank 6 4 5 3 1 1  f 6 Mean 5.99E+01 3.51E+01 2.15E+01 1.30E+01 9.59E-14 2.84E-14 Std 7.96E+00 3.95E+00 3.09E+00 4.60E+00 6.04E-14 1.03E-14 Rank 6 5 4 3 2 1  f 7 Mean 3.37E+02 2.11E+02 1.70E+02 1.06E+02 0.00E+00 0.00E+00 Std 6.89E+01 3.62E+01 6.86E+01 3.42E+01 0.00E+00 0.00E+00 Rank 6 4 5 3 1 1  f 8 Mean 8.37E+01 3.49E-18 3.14E-04 4.33E-05 1.37E-122 7.49E-175 Std 4.00E+01 7.07E-18 1.32E-03 1.14E-04 4.24E-122 0.00E+00 Rank 6 3 5 4 2 1  f 9 Mean 1.11E+02 2.23E+01 1.19E+00 1.56E+12 6.71E-30 1.70E-44 Std 1.97E+01 1.08E+01 1.23E+00 8.44E+12 8.51E-30 1.58E-44 Rank 6 4 3 5 2 1  f 10 Mean 1.62E+01 1.91E+01 1.65E+01 1.93E+01 5.11E+00 3.44E+00 Std 1.33E+00 1.02E+00 2.00E+00 5.87E-01 1.02E+00 1.07E+00 Rank 3 5 4 6 2 1  Average Rank 5.7 4.3 4.0 4.0 1.8 1 Total Rank 6 5 3 3 2 1In order to intuitively investigate the convergence performance of SC-PSO, the convergence curves of the 6 algorithms (PSO, DCW-PSO, LDC-PSO, DPSO, SS-PSO, and SC-PSO) are on the 10 selected functions. From Figures5, 7–9, and 12, SC-PSO’s convergence speed is faster than of any of the comparison algorithms and its advantages are prominent. In Figures 4 and 6, the convergence speed of SC-PSO is also faster than that of any of the comparison algorithms, but its advantages are not sharp. From Figures 3, 10, and 11, SC-PSO’s convergence speed is almost the same as that of SS-PSO in the early stage, but its convergence accuracy is better than that of SS-PSO. On the whole, SC-PSO has the best convergence performance. In general, the convergence performance of SC-PSO on the 10 functions is much better than other algorithms. The convergence curves further prove that improvement strategies are effective and that SC-PSO has good convergence performance.Figure 3
The functionf1 iterates over the curve.Figure 4
The functionf2 iterates over the curve.Figure 5
The functionf3 iterates over the curve.Figure 6
The functionf4 iterates over the curve.Figure 7
The functionf5 iterates over the curve.Figure 8
The functionf6 iterates over the curve.Figure 9
The functionf7 iterates over the curve.Figure 10
The functionf8 iterates over the curve.Figure 11
The functionf9 iterates over the curve.Figure 12
The functionf10 iterates over the curve.In summary, compared with basic PSO and its modified versions, the convergence rate of SC-PSO proposed in this paper is significantly improved while its convergence accuracy is still guaranteed higher.


## 4.3. Running Time Analysis

From Figure13, on average runtime, SC-PSO is the least among the 6 algorithms, which means that the speed of SC-PSO is the faster. Compared with PSO, SC-PSO’s average runtime is 0.7725 s, while PSO’s is 2.1244s, and SC-PSO’s average runtime is 36% of PSO’s. Compared with the other 4 algorithms, SC-PSO’s average runtime accounts for 34%, 37%, 20%, and 43% of DCW-PSO’s (2.2871s), LDC-PSO’s (2.0658s), DPSO’s (3.8148s), and SS-PSO’s (1.7965s), respectively.Figure 13
Average runtime comparison of the 6 algorithms (Sphere 30D).


## 5. Conclusions

This paper proposes an improved convergence particle swarm optimization algorithm with random sampling of control parameters. The random sampling strategy of control parameters is designed to improve the flexibility of control parameter setting, and corresponding updating randomness can also help to jump out from the local optimum. In order to avoid premature caused by the strong randomness of sampling strategy, intermediate particle updating strategy is devised. Besides that, the stochastic correction approach on each dimension for the optimal position is used to take advantage of some useful information of other particles. The final experimental results show that not only the proposed algorithm has high accuracy, but also its convergence rate is significantly improved. In the future, we will consider how to apply it to node localization in wireless sensor network.



---

*Source: 7478498-2019-06-02.xml*