On inversely proportional hypermutations with mutation potential

Artificial Immune Systems (AIS) employing hypermutations with linear static mutation potential have recently been shown to be very effective at escaping local optima of combinatorial optimisation problems at the expense of being slower during the exploitation phase compared to standard evolutionary algorithms. In this paper, we prove that considerable speed-ups in the exploitation phase may be achieved with dynamic inversely proportional mutation potentials (IPM) and argue that the potential should decrease inversely to the distance to the optimum rather than to the difference in fitness. Afterwards, we define a simple (1+1) Opt-IA that uses IPM hypermutations and ageing for realistic applications where optimal solutions are unknown. The aim of this AIS is to approximate the ideal behaviour of the inversely proportional hypermutations better and better as the search space is explored. We prove that such desired behaviour and related speed-ups occur for a well-studied bimodal benchmark function called TwoMax. Furthermore, we prove that the (1+1) Opt-IA with IPM efficiently optimises a second multimodal function, Cliff, by escaping its local optima while Opt-IA with static mutation potential cannot, thus requires exponential expected runtime in the distance between the local and global optima.

[1]  Pietro Simone Oliveto,et al.  Theoretical analysis of fitness-proportional selection: landscapes and efficiency , 2009, GECCO.

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

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

[4]  Dogan Corus,et al.  Artificial immune systems can find arbitrarily good approximations for the NP-hard number partitioning problem , 2018, Artif. Intell..

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

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

[7]  Feller William,et al.  An Introduction To Probability Theory And Its Applications , 1950 .

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

[9]  Dirk Sudholt,et al.  The Benefits of Population Diversity in Evolutionary Algorithms: A Survey of Rigorous Runtime Analyses , 2018, Theory of Evolutionary Computation.

[10]  Pietro Simone Oliveto,et al.  Artificial Immune Systems Can Find Arbitrarily Good Approximations for the NP-Hard Partition Problem , 2018, PPSN.

[11]  Dirk Sudholt,et al.  On the benefits and risks of using fitness sharing for multimodal optimisation , 2019, Theor. Comput. Sci..

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

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

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

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

[16]  Pietro Simone Oliveto,et al.  Analysis of Diversity-Preserving Mechanisms for Global Exploration , 2009, Evolutionary Computation.

[17]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1967 .

[18]  Dirk Sudholt,et al.  Analysis of the Clearing Diversity-Preserving Mechanism , 2017, FOGA '17.

[19]  Jason Brownlee,et al.  Clonal selection algorithms , 2007 .

[20]  L. Darrell Whitley,et al.  The GENITOR Algorithm and Selection Pressure: Why Rank-Based Allocation of Reproductive Trials is Best , 1989, ICGA.

[21]  Pietro Simone Oliveto,et al.  Improved time complexity analysis of the Simple Genetic Algorithm , 2015, Theor. Comput. Sci..

[22]  Pietro Simone Oliveto,et al.  On the runtime analysis of the opt-IA artificial immune system , 2017, GECCO.

[23]  Pietro Simone Oliveto,et al.  When Hypermutations and Ageing Enable Artificial Immune Systems to Outperform Evolutionary Algorithms , 2018, Theor. Comput. Sci..

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

[25]  Pietro Simone Oliveto,et al.  On the runtime analysis of the Simple Genetic Algorithm , 2014, Theor. Comput. Sci..

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

[27]  F. Azuaje Artificial Immune Systems: A New Computational Intelligence Approach , 2003 .