A particle swarm optimization algorithm with variable random functions and mutation

Title: A particle swarm optimization algorithm with variable random functions and mutation
Creator: Zhou, Xiaojun; Yang, Chunhua; Gui, Weihua; Dong, Tianxue
Date: 2014
Type: Text; Journal article
Identifier: http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/77134
Identifier: vital:7670
Identifier: ISSN: 0254-4156
Abstract: The convergence analysis of the standard particle swarm optimization (PSO) has shown that the changing of random functions, personal best and group best has the potential to improve the performance of the PSO. In this paper, a novel strategy with variable random functions and polynomial mutation is introduced into the PSO, which is called particle swarm optimization algorithm with variable random functions and mutation (PSO-RM). Random functions are adjusted with the density of the population so as to manipulate the weight of cognition part and social part. Mutation is executed on both personal best particle and group best particle to explore new areas. Experiment results have demonstrated the effectiveness of the strategy. Copyright © 2014 Acta Automatica Sinica. All rights reserved.
Relation: Zidonghua Xuebao/Acta Automatica Sinica Vol. 40, no. 7 (2014), p. 1339 - 1347
Rights: This metadata is freely available under a CCO license
Subject: Mutation; Particle swarm optimization; Population density; Random functions
Reviewed

		Thumbnail	File	Description	Size	Format