Simplifying particle swarm optimization
Simplifying particle swarm optimization
The general purpose optimization method known as Particle Swarm Optimization (PSO) has received much attention in past years, with many attempts to find the variant that performs best on a wide variety of optimization problems. The focus of past research has been with making the PSO method more complex as this is frequently believed to increase its adaptability to other optimization problems. This study takes the opposite approach and simplifies the PSO method. To compare the efficacy of the original PSO and the simplified variant here, an easy technique is presented for efficiently tuning their behavioural parameters. The technique works by employing an overlaid meta-optimizer, which is capable of simultaneously tuning parameters with regard to multiple optimization problems, wheras previous approaches to meta-optimization have buned behavioural parameters to work well on just a single optimization problem. It is then found that not only the PSO method and its simplified variant have comparable performance for optimization a number of Artificial Neural Network problems, but also the simplified variant appears to offer a small improvement in some cases
numerical optimization, stochastic, swarm, turning, simplifying
Pedersen, M.E.H
4b06039f-ff5d-4caa-b984-a61a2fa7b2af
Chipperfield, A.J.
524269cd-5f30-4356-92d4-891c14c09340
March 2010
Pedersen, M.E.H
4b06039f-ff5d-4caa-b984-a61a2fa7b2af
Chipperfield, A.J.
524269cd-5f30-4356-92d4-891c14c09340
Pedersen, M.E.H and Chipperfield, A.J.
(2010)
Simplifying particle swarm optimization.
Applied Soft Computing, 10 (2).
(doi:10.1016/j.asoc.2009.08.029).
Abstract
The general purpose optimization method known as Particle Swarm Optimization (PSO) has received much attention in past years, with many attempts to find the variant that performs best on a wide variety of optimization problems. The focus of past research has been with making the PSO method more complex as this is frequently believed to increase its adaptability to other optimization problems. This study takes the opposite approach and simplifies the PSO method. To compare the efficacy of the original PSO and the simplified variant here, an easy technique is presented for efficiently tuning their behavioural parameters. The technique works by employing an overlaid meta-optimizer, which is capable of simultaneously tuning parameters with regard to multiple optimization problems, wheras previous approaches to meta-optimization have buned behavioural parameters to work well on just a single optimization problem. It is then found that not only the PSO method and its simplified variant have comparable performance for optimization a number of Artificial Neural Network problems, but also the simplified variant appears to offer a small improvement in some cases
This record has no associated files available for download.
More information
Submitted date: 7 April 2008
Published date: March 2010
Keywords:
numerical optimization, stochastic, swarm, turning, simplifying
Identifiers
Local EPrints ID: 71755
URI: http://eprints.soton.ac.uk/id/eprint/71755
ISSN: 1568-4946
PURE UUID: 02a97e94-7c48-4d2b-8f48-756062737a4a
Catalogue record
Date deposited: 23 Dec 2009
Last modified: 14 Mar 2024 02:47
Export record
Altmetrics
Contributors
Author:
M.E.H Pedersen
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics