Title
Characterising the searchability of continuous optimisation problems for PSO.
Abstract
The focus of research in swarm intelligence has been largely on the algorithmic side with relatively little attention being paid to the study of problems and the behaviour of algorithms in relation to problems. When a new algorithm or variation on an existing algorithm is proposed in the literature, there is seldom any discussion or analysis of algorithm weaknesses and on what kinds of problems the algorithm is expected to fail. Fitness landscape analysis is an approach that can be used to analyse optimisation problems. By characterising problems in terms of fitness landscape features, the link between problem types and algorithm performance can be studied. This article investigates a number of measures for analysing the ability of a search process to improve fitness on a particular problem (called in literature but referred to as in this study to broaden the scope to non-evolutionary-based search techniques). A number of existing fitness landscape analysis techniques originally proposed for discrete problems are adapted to work in continuous search spaces. For a range of benchmark problems, the proposed searchability measures are viewed alongside performance measures for a traditional global best particle swarm optimisation (PSO) algorithm. Empirical results show that no single measure can be used as a predictor of PSO performance, but that multiple measures of different fitness landscape features can be used together to predict PSO failure.
Year
DOI
Venue
2014
https://doi.org/10.1007/s11721-014-0099-x
Swarm intelligence
Keywords
Field
DocType
Fitness landscape analysis,Evolvability,Particle swarm optimisation
Particle swarm optimization,Mathematical optimization,Fitness landscape,Evolvability,Computer science,Swarm intelligence,Artificial intelligence,Machine learning
Journal
Volume
Issue
ISSN
8
4
1935-3812
Citations 
PageRank 
References 
0
0.34
27
Authors
2
Name
Order
Citations
PageRank
Katherine Malan116212.77
Andries P. Engelbrecht266061.64