Skip to main content

The Influence of Age Assignments on the Performance of Immune Algorithms

  • Conference paper
  • First Online:

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 840))

Abstract

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.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Conca, P., Stracquadanio, G., Greco, O., Cutello, V., Pavone, M., Nicosia, G.: Packing equal disks in a unit square: an immunological optimization approach. In: 1st International Workshop on Artificial Immune Systems (AIS), pp. 1–5. IEEE Press (2015)

    Google Scholar 

  2. Cutello, V., De Michele, A.G., Pavone, M.: Escaping local optima via parallelization and migration. In: VI International Workshop on Nature Inspired Cooperative Strategies for Optimization (NICSO). Studies in Computational Intelligence, vol. 512, pp. 141–152 (2013)

    Google Scholar 

  3. Cutello, V., Morelli, G., Nicosia, G., Pavone, M., Scollo, G.: On discrete models and immunological algorithms for protein structure prediction. Natural Comput. 10(1), 91–102 (2011)

    Article  MathSciNet  Google Scholar 

  4. Cutello, V., Narzisi, G., Nicosia, G., Pavone, M.: Clonal selection algorithms: a comparative case study using effective mutation potentials. In: 4th International Conference on Artificial Immune Systems (ICARIS). LNCS, vol. 3627, pp. 13–28 (2005)

    Google Scholar 

  5. Di Stefano, A., Vitale, A., Cutello, V., Pavone, M.: How long should offspring lifespan be in order to obtain a proper exploration? In: 2016 IEEE Symposium Series on Computational Intelligence (SSCI), pp. 1–8, INSPEC number 16670548 (2016)

    Google Scholar 

  6. Fouladvand, S., Osareh, A., Shadgar, B., Pavone, M., Sharafi, S.: DENSA: an effective negative selection algorithm with flexible boundaries for selfspace and dynamic number of detectors. Eng. Appl. Artif. Intell. 62, 359–372 (2017)

    Article  Google Scholar 

  7. Jansen, T., Zarges, C.: On benefits and drawbacks og aging strategies for randomized search heuristics. Theor. Comput. Sci. 412, 543–559 (2011)

    Article  Google Scholar 

  8. Kauffman, S.A., Levin, S.: Towards a genarl theory of adaptive walks on rugged landscapes. J. Theor. Biol. 128(1), 11–45 (1987)

    Article  Google Scholar 

  9. Kauffman, S.A., Weinberger, E.D.: The NK model of rugged fitness landscapes and its application to maturation of the immune response. J. Theor. Biol. 141(2), 211–245 (1989)

    Article  Google Scholar 

  10. Levinthal, D.A.: Adaptation on rugged landscapes. Manage. Sci. 43(7), 934–950 (1997)

    Article  Google Scholar 

  11. Pavone, M., Narzisi, G., Nicosia, G.: Clonal selection - an immunological algorithm for global optimization over continuous spaces. J. Global Optim. 53(4), 769–808 (2012)

    Article  MathSciNet  Google Scholar 

  12. Schaffer, J.D., Eshelman, L.J.: On crossover as an evolutionary viable strategy. In: 4th International Conference on Genetic Algorithms, pp. 61–68 (1991)

    Google Scholar 

  13. Weinberger, E.: NP-completeness of Kauffman’s NK model, a tuneably rugged fitness landscape. Santa Fe Institute Working Paper, 96-02-003 (1996)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Mario Pavone .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Vitale, A., Di Stefano, A., Cutello, V., Pavone, M. (2019). The Influence of Age Assignments on the Performance of Immune Algorithms. In: Lotfi, A., Bouchachia, H., Gegov, A., Langensiepen, C., McGinnity, M. (eds) Advances in Computational Intelligence Systems. UKCI 2018. Advances in Intelligent Systems and Computing, vol 840. Springer, Cham. https://doi.org/10.1007/978-3-319-97982-3_2

Download citation

Publish with us

Policies and ethics