Particle swarm optimization has been used to solve many optimization problems since it was

proposed by Kennedy and Eberhart in 1995 [4]. After that, they published one book [9] and

several papers on this topic [5][7][13][15], one of which did a study on its performance using

four nonlinear functions adopted as a benchmark by many researchers in this area [14]. In PSO,

each particle moves in the search space with a velocity according to its own previous best

solution and its group’s previous best solution. The dimension of the search space can be any

positive integer.