On the runtime analysis of the opt-IA artificial immune system

We present a time complexity analysis of the Opt-IA artificial immune system (AIS). We first highlight the power and limitations of its distinguishing operators (i.e., hypermutations with mutation potential and ageing) by analysing them in isolation. Recent work has shown that ageing combined with local mutations can help escape local optima on a dynamic optimisation benchmark function. We generalise this result by rigorously proving that ageing leads to considerable speed-ups (compared to evolutionary algorithms (EAs)) on the standard Cliff benchmark function both when using local and global mutations. Unless the stop at first constructive mutation (FCM) mechanism is applied, we show that hypermutations require exponential expected runtime to optimise any function with a polynomial number of optima. If instead FCM is used, the expected runtime is at most a linear factor larger than the upper bound achieved for any random local search algorithm using the artificial fitness levels method. Nevertheless, we prove that algorithms using hypermutations can be considerably faster than EAs at escaping local optima. An analysis of the complete Opt-IA reveals that it is efficient on the previously considered functions and highlights problems where the use of the full algorithm is crucial.

[1]  Thomas Jansen,et al.  Maximal age in randomized search heuristics with aging , 2009, GECCO.

[2]  Thomas Jansen,et al.  On the Analysis of the Immune-Inspired B-Cell Algorithm for the Vertex Cover Problem , 2011, ICARIS.

[3]  Pietro Simone Oliveto,et al.  On the runtime analysis of stochastic ageing mechanisms , 2014, GECCO.

[4]  Marina Fruehauf.  Artificial Immune Systems A New Computational Intelligence Paradigm , 2016 .

[5]  Thomas Jansen,et al.  On Easiest Functions for Mutation Operators in Bio-Inspired Optimisation , 2016, Algorithmica.

[6]  Vincenzo Cutello,et al.  An Immune Algorithm for Protein Structure Prediction on Lattice Models , 2007, IEEE Transactions on Evolutionary Computation.

[7]  Jonathan Timmis,et al.  Immune Inspired Somatic Contiguous Hypermutation for Function Optimisation , 2003, GECCO.

[8]  Thomas Jansen,et al.  Analyzing Evolutionary Algorithms , 2015, Natural Computing Series.

[9]  Thomas Jansen,et al.  On the role of age diversity for effective aging operators , 2011, Evol. Intell..

[10]  Duc-Cuong Dang,et al.  Emergence of Diversity and Its Benefits for Crossover in Genetic Algorithms , 2016, PPSN.

[11]  Per Kristian Lehre,et al.  Theoretical analysis of rank-based mutation - combining exploration and exploitation , 2009, 2009 IEEE Congress on Evolutionary Computation.

[12]  Xin Yao,et al.  Runtime Analysis of Evolutionary Algorithms for Discrete Optimization , 2011, Theory of Randomized Search Heuristics.

[13]  Christine Zarges,et al.  Rigorous Runtime Analysis of Inversely Fitness Proportional Mutation Rates , 2008, PPSN.

[14]  Vincenzo Cutello,et al.  Exploring the Capability of Immune Algorithms: A Characterization of Hypermutation Operators , 2004, ICARIS.

[15]  Pietro Simone Oliveto,et al.  On the Convergence of Immune Algorithms , 2007, 2007 IEEE Symposium on Foundations of Computational Intelligence.

[16]  Thomas Jansen,et al.  Analyzing Evolutionary Algorithms: The Computer Science Perspective , 2012 .

[17]  Christine Zarges,et al.  On the utility of the population size for inversely fitness proportional mutation rates , 2009, FOGA '09.

[18]  Thomas Jansen,et al.  Variation in Artificial Immune Systems: Hypermutations with Mutation Potential , 2011, ICARIS.

[19]  Dirk Sudholt,et al.  First Steps Towards a Runtime Comparison of Natural and Artificial Evolution , 2015, GECCO.

[20]  Jens Jägersküpper,et al.  When the Plus Strategy Outperforms the Comma Strategyand When Not , 2007, 2007 IEEE Symposium on Foundations of Computational Intelligence.

[21]  Thomas Jansen,et al.  Analyzing different variants of immune inspired somatic contiguous hypermutations , 2011, Theor. Comput. Sci..

[22]  Thomas Jansen,et al.  Computing Longest Common Subsequences with the B-Cell Algorithm , 2012, ICARIS.

[23]  F. Burnet.  The clonal selection theory of acquired immunity , 1959 .

[24]  Thomas Jansen,et al.  On the analysis of the (1+1) evolutionary algorithm , 2002, Theor. Comput. Sci..

[25]  JansenThomas,et al.  On the analysis of the (1+ 1) evolutionary algorithm , 2002 .

[26]  Fernando José Von Zuben,et al.  Learning and optimization using the clonal selection principle , 2002, IEEE Trans. Evol. Comput..