The Influence of Age Assignments on the Performance of Immune Algorithms

How long a B cell remains, evolves and matures inside a population plays a crucial role on the capability for an immune algorithm to jump out from local optima, and find the global optimum. Assigning the right age to each clone (or offspring, in general) means to find the proper balancing between the exploration and exploitation. In this research work we present an experimental study conducted on an immune algorithm, based on the clonal selection principle, and performed on eleven different age assignments, with the main aim to verify if at least one, or two, of the top 4 in the previous efficiency ranking produced on the one-max problem, still appear among the top 4 in the new efficiency ranking obtained on a different complex problem. Thus, the NK landscape model has been considered as the test problem, which is a mathematical model formulated for the study of tunably rugged fitness landscape. From the many experiments performed is possible to assert that in the elitism variant of the immune algorithm, two of the best age assignments previously discovered, still continue to appear among the top 3 of the new rankings produced; whilst they become three in the no elitism version. Further, in the first variant none of the 4 top previous ones ranks ever in the first position, unlike on the no elitism variant, where the previous best one continues to appear in 1st position more than the others. Finally, this study confirms that the idea to assign the same age of the parent to the cloned B cell is not a good strategy since it continues to be as the worst also in the new efficiency ranking.

[1]  Vincenzo Cutello,et al.  Clonal Selection Algorithms: A Comparative Case Study Using Effective Mutation Potentials , 2005, ICARIS.

[2]  Vincenzo Cutello,et al.  Escaping Local Optima via Parallelization and Migration , 2013, NICSO.

[3]  Di Stefano Antonino,et al.  How long should offspring lifespan be in order to obtain a proper exploration , 2016 .

[4]  Daniel A. Levinthal Adaptation on rugged landscapes , 1997 .

[5]  Thomas Jansen,et al.  On benefits and drawbacks of aging strategies for randomized search heuristics , 2011, Theor. Comput. Sci..

[6]  E. Weinberger NP Completeness of Kauffman's N-k Model, A Tuneable Rugged Fitness Landscape , 1996 .

[7]  Giuseppe Nicosia,et al.  Clonal selection: an immunological algorithm for global optimization over continuous spaces , 2012, J. Glob. Optim..

[8]  Vincenzo Cutello,et al.  On discrete models and immunological algorithms for protein structure prediction , 2011, Natural Computing.

[9]  Mario Pavone,et al.  DENSA: An effective negative selection algorithm with flexible boundaries for self-space and dynamic number of detectors , 2017, Eng. Appl. Artif. Intell..

[10]  Vincenzo Cutello,et al.  Packing equal disks in a unit square: an immunological optimization approach , 2015, 2015 International Workshop on Artificial Immune Systems (AIS).

[11]  E. D. Weinberger,et al.  The NK model of rugged fitness landscapes and its application to maturation of the immune response. , 1989, Journal of theoretical biology.

[12]  S. Kauffman,et al.  Towards a general theory of adaptive walks on rugged landscapes. , 1987, Journal of theoretical biology.