School of Computing

Varying the topology and probability of re-initialization in particle swarm optimization

Mudassar Iqbal, Alex A. Freitas, and Colin G. Johnson

In E.-G. Talbi, editor, Evolution Artificielle 2005, pages 182-196. University of Lille, October 2005.

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.

Download publication 318 kbytes (PDF)

Bibtex Record

@inproceedings{2329,
author = {Mudassar Iqbal and Alex A. Freitas and Colin G. Johnson},
title = {Varying the Topology and Probability of Re-Initialization in Particle Swarm Optimization},
month = {October},
year = {2005},
pages = {182-196},
keywords = {determinacy analysis, Craig interpolants},
note = {},
doi = {},
url = {http://www.cs.kent.ac.uk/pubs/2005/2329},
    publication_type = {inproceedings},
    submission_id = {23602_1134843423},
    booktitle = {Evolution Artificielle 2005},
    editor = {E.-G. Talbi},
    organization = {University of Lille},
    refereed = {yes},
}

School of Computing, University of Kent, Canterbury, Kent, CT2 7NF

Enquiries: +44 (0)1227 824180 or contact us.

Last Updated: 21/03/2014