Particle swarm optimization using dimension selection methods

Particle swarm optimization using dimension selection methods

0.00 Avg rating0 Votes
Article ID: iaor2013889
Volume: 219
Issue: 10
Start Page Number: 5185
End Page Number: 5197
Publication Date: Jan 2013
Journal: Applied Mathematics and Computation
Authors: , , ,
Keywords: metaheuristics, particle swarm systems
Abstract:

Particle swarm optimization (PSO) has undergone many changes since its introduction in 1995. Being a stochastic algorithm, PSO and its randomness present formidable challenge for the theoretical analysis of it, and few of the existing PSO improvements have make an effort to eliminate the random coefficients in the PSO updating formula. This paper analyzes the importance of the randomness in the PSO, and then gives a PSO variant without randomness to show that traditional PSO cannot work without randomness. Based on our analysis of the randomness, another way of using randomness is proposed in PSO with random dimension selection (PSORDS) algorithm, which utilizes random dimension selection instead of stochastic coefficients. Finally, deterministic methods to do the dimension selection are proposed, and the resultant PSO with distance based dimension selection (PSODDS) algorithm is greatly superior to the traditional PSO and PSO with heuristic dimension selection (PSOHDS) algorithm is comparable to traditional PSO algorithm. In addition, using our dimension selection method to a newly proposed modified particle swarm optimization (MPSO) algorithm also gets improved results. The experiment results demonstrate that our analysis about the randomness is correct and the usage of deterministic dimension selection method is very helpful.

Reviews

Required fields are marked *. Your email address will not be published.