Abstract
In this paper, an important class of hypermutation operators are discussed and quantitatively compared with respect to their success rate and computational cost. We use a standard Immune Algorithm (IA), based on the clonal selection principle to investigate the searching capability of the designed hypermutation operators. We computed the parameter surface for each variation operator to predict the best parameter setting for each operator and their combination. The experimental investigation in which we use a standard clonal selection algorithm with different hypermutation operators on a complex “toy problem”, the trap functions, and a complex NP-complete problem, the 2D HP model for the protein structure prediction problem, clarifies that only few really different and useful hypermutation operators exist, namely: inversely proportional hypermutation, static hypermutation and hypermacromutation operators. The combination of static and inversely proportional Hypermutation and hypermacromutation showed the best experimental results for the “toy problem” and the NP-complete problem.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Cutello, V., Nicosia, G.: The Clonal Selection Principle for in silico and in vitro Computing. In: de Castro, L.N., Von Zuben, F.J. (eds.) Recent Developments in Biologically Inspired Computing (2004) (to appear)
Dasgupta, D. (ed.): Artificial Immune Systems and their Applications. Springer, Berlin (1999)
De Castro, L.N., Timmis, J.: Artificial Immune Systems: A New Computational Intelligence Paradigm. Springer, London (2002)
Cutello, V., Nicosia, G., Pavone, M.: A Hybrid Immune Algorithm with Information Gain for the Graph Coloring Problem. In: Cantú-Paz, E., Foster, J.A., Deb, K., Davis, L., Roy, R., O’Reilly, U.-M., Beyer, H.-G., Kendall, G., Wilson, S.W., Harman, M., Wegener, J., Dasgupta, D., Potter, M.A., Schultz, A., Dowsland, K.A., Jonoska, N., Miller, J., Standish, R.K. (eds.) GECCO 2003. LNCS, vol. 2723, pp. 171–182. Springer, Heidelberg (2003)
Goldberg, D.E.: The Design of Innovation: Lessons from and for Competent Genetic Algorithms, vol. 7. Kluwer Academic Publishers, Boston (2002)
De Castro, L.N., Von Zuben, F.J.: Learning and optimization using the clonal selection principle. IEEE Trans. on Evol. Comp. 6(3), 239–251 (2002)
Prugel-Bennett, A., Rogers, A.: Modelling GA Dynamics. In: Proceedings Theoretical Aspects of Evolutionary Computing, Springer, Heidelberg (2001)
Nijssen, S., Back, T.: An analysis of the Behavior of Simplified Evolutionary Algorithms on Trap Functions. IEEE Trans. on Evol. Comp. 7(1), 11–22 (2003)
Dill, K.A.: Theory for the folding and stability of globular proteins. Biochemistry 24(6), 1501–1509 (1985)
Crescenzi, P., Goldman, D., Papadimitriou, C., Piccolboni, A., Yannakakis, M.: On the complexity of protein folding. J. of Comp. Bio. 5(3), 423–466 (1998)
Krasnogor, N., Hart, W.E., Smith, J., Pelta, D.A.: Protein Structure Prediction with Evolutionary Algorithms. In: GECCO 1999, vol. 2, pp. 1596–1601. Morgan Kaufman, San Francisco (1999)
Cutello, V., Nicosia, G., Pavone, M.: An Immune Algorithm with Hyper- Macromutations for the 2D Hydrophilic-Hydrophobic Model. In: CEC 2004, vol. 1, pp. 1074–1080. IEEE Press, Los Alamitos (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cutello, V., Nicosia, G., Pavone, M. (2004). Exploring the Capability of Immune Algorithms: A Characterization of Hypermutation Operators. In: Nicosia, G., Cutello, V., Bentley, P.J., Timmis, J. (eds) Artificial Immune Systems. ICARIS 2004. Lecture Notes in Computer Science, vol 3239. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30220-9_22
Download citation
DOI: https://doi.org/10.1007/978-3-540-30220-9_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23097-7
Online ISBN: 978-3-540-30220-9
eBook Packages: Springer Book Archive