Simplifying particle swarm optimization
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).
Full text not available from this repository.
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
|Digital Object Identifier (DOI):||doi:10.1016/j.asoc.2009.08.029|
|Keywords:||numerical optimization, stochastic, swarm, turning, simplifying|
|Subjects:||Q Science > Q Science (General)|
|Divisions:||University Structure - Pre August 2011 > School of Engineering Sciences > Computational Engineering and Design
|Date Deposited:||23 Dec 2009|
|Last Modified:||06 Aug 2015 02:56|
|RDF:||RDF+N-Triples, RDF+N3, RDF+XML, Browse.|
Actions (login required)