Varying the Topology and Probability of Re-Initialization in Particle Swarm Optimization

Iqbal, M. and Freitas, A.A. and Johnson, Colin G. (2005) Varying the Topology and Probability of Re-Initialization in Particle Swarm Optimization. In: Evolution Artificielle 2005.

PDF
Download (318Kb)	Preview

Abstract

This paper introduces two new versions of dissipative particle swarm optimization. Both of these use a new time-dependent strategy for randomly re-initializing the positions of the particles. In addition, one variation also uses a novel dynamic neighbourhood topology based on small world networks. We present results from applying these algorithms to two well-known function optimization problems. Both algorithms perform considerably better than both standard PSO and the original dissipative PSO algorithms. In particular one version performs significantly better on high-dimensional problems that are inaccessible to traditional methods.

Item Type:	Conference or workshop item (UNSPECIFIED)
Uncontrolled keywords:	PSO; swarm intelligence; small-world theory
Subjects:	Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions:	Faculties > Science Technology and Medical Studies > School of Computing > Applied and Interdisciplinary Informatics Group
Depositing User:	Mark Wheadon
Date Deposited:	24 Nov 2008 18:02
Last Modified:	17 Jul 2012 14:36
Resource URI:	http://kar.kent.ac.uk/id/eprint/14249 (The current URI for this page, for reference purposes)

• Depositors only (login required):