2006 | OriginalPaper | Buchkapitel
Diophantine Benchmarks for the B-Cell Algorithm
verfasst von : P. Bull, A. Knowles, G. Tedesco, A. Hone
Erschienen in: Artificial Immune Systems
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
The B-cell algorithm (BCA) due to Kelsey and Timmis is a function optimization algorithm inspired by the process of somatic mutation of B cell clones in the natural immune system. So far, the BCA has been shown to be perform well in comparison with genetic algorithms when applied to various benchmark optimisation problems (finding the optima of
smooth
real functions). More recently, the convergence of the BCA has been shown by Clark, Hone and Timmis, using the theory of Markov chains. However, at present the theory does not predict the average number of iterations that are needed for the algorithm to converge. In this paper we present some empirical convergence results for the BCA, using a very different
non-smooth
set of benchmark problems. We propose that certain Diophantine equations, which can be reformulated as an optimization problem in integer programming, constitute a much harder set of benchmarks for evolutionary algorithms. In the light of our empirical results, we also suggest some modifications that can be made to the BCA in order to improve its performance.