Particle swarm optimisation (PSO) algorithms have been successfully used to solve many complex real-world optimisation problems. Since their introduction in 1995, the focus of research in PSOs has largely been on the algorithmic side with many new variations proposed on the original PSO algorithm. Relatively little attention has been paid to the study of problems with respect to PSO performance. The aim of this study is to investigate whether a link can be found between problem characteristics and algorithm performance for PSOs. A range of benchmark problems are numerically characterised using fitness landscape analysis techniques. Decision tree induction is used to develop failure prediction models for seven different variations on the PSO algorithm. Results show that for most PSO models, failure could be predicted to a fairly high level of accuracy. The resulting prediction models are not only useful as predictors of failure, but also provide insight into the algorithms themselves, especially when expressed as fuzzy rules in terms of fitness landscape features.
Cody DennisBeatrice Ombuki-BermanAndries P. Engelbrecht
Andries P. EngelbrechtPhlippie Rudolph BosmanKatherine M. Malan
Zhenya DiaoF. Richard YuJian GuanMeitong Liu