An Adaptive Particle Swarm Optimization Algorithm for Unconstrained Optimization

Algorithm 3

Pseudocode of the population update.

: velocity and location update function
Input:
: an individual or particle
: global best particle
D: problem size
C1: first coefficient
C2: second coefficient
θ: fragmentation size
: sparse subspace rate array
MaxV: an array of D values; MaxVd is the maximum value in the domain of the dth dimension of the problem space
MinV: an array of D values; MinVd is the minimum value in the domain of the dth dimension of the problem space
: a given objective function
Output:
: an individual or particle
(1)
(2)	For d = 1 : D
(2.1)	[r1, r2] = two random or chaotic values of uniform distribution in interval [0, 1]
(2.2)
(2.3)
(2.4)
(2.5)
(2.6)
(3)
(4)
(5)
(5.1)
(5.2)