Abstract
Quite different search heuristics make use of the concept of assigning an age to search points and systematically remove search points that are too old from the search process. In evolutionary computation one defines some finite maximal lifespan and assigns age 0 to each new search point. In artificial immune systems static pure aging is used. There a finite maximal lifespan is defined but new search points inherit the age of their origin if they do not excel in function value. Both aging mechanisms are supposed to increase the capabilities of the respective search heuristics. A rigorous analysis for two typical difficult situations sheds light on similarities and differences. Considering the behavior on plateaus of constant function values and in local optima both methods are shown to have their strengths. A third aging operator is introduced that provably shares the advantages of both aging mechanisms.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aarts, E., Korst, J., Michiels, W.: Simulated annealing. In: Search Methodologies, pp. 187–210. Springer, Heidelberg (2005)
Cutello, V., Nicosia, G., Pavone, M.: Exploring the capability of immune algorithms: A characterization of hypermutation operators. In: Nicosia, G., Cutello, V., Bentley, P.J., Timmis, J. (eds.) ICARIS 2004. LNCS, vol. 3239, pp. 263–276. Springer, Heidelberg (2004)
Dasgupta, D., Niño, L.F.: Immunological Computation: Theory and Applications. Auerbach (2008)
de Castro, L.N., Timmis, J.: Artificial Immune Systems: A New Computational Intelligence Approach. Springer, Heidelberg (2002)
de Castro, L.N., Zuben, F.J.V.: Learning and optimization using the clonal selection principle. IEEE Trans. on Evolutionary Computation 6(3), 239–251 (2002)
De Jong, K.A.: Evolutionary Computation. MIT Press, Cambridge (2006)
Droste, S., Jansen, T., Wegener, I.: On the analysis of the (1+1) evolutionary algorithm. Theoretical Computer Science 276(1-2), 51–81 (2002)
Friedrich, T., Hebbinghaus, N., Neumann, F.: Comparison of simple diversity mechanisms on plateau functions. Theoretical Computer Science (2009) (to appear)
Glover, F., Laguna, M.: Tabu Search. Kluwer, Dordrecht (1997)
Horoba, C., Jansen, T., Zarges, C.: Maximal age in randomized search heuristics with aging. In: Genetic and Evolutionary Computation Conf. GECCO (to appear, 2009)
Jansen, T.: On classifications of fitness functions. In: Theoretical Aspects of Evolutionary Computing, pp. 371–386. Springer, Heidelberg (2001)
Jansen, T.: On the analysis of dynamic restart strategies for evolutionary algorithms. In: Guervós, J.J.M., Adamidis, P.A., Beyer, H.-G., Fernández-Villacañas, J.-L., Schwefel, H.-P. (eds.) PPSN 2002. LNCS, vol. 2439, pp. 33–43. Springer, Heidelberg (2002)
Jansen, T., Wegener, I.: Evolutionary algorithms — how to cope with plateaus of constant fitness and when to reject strings of the same fitness. IEEE Trans. on Evolutionary Computation 5(6), 589–599 (2002)
Kelsey, J., Timmis, J.: Immune inspired somatic contiguous hypermutation for function optimisation. In: Cantú-Paz, E., et al. (eds.) GECCO 2003. LNCS, vol. 2723, pp. 207–218. Springer, Heidelberg (2003)
Michiels, W., Aarts, E., Korst, J.: Theoretical Aspects of Local Search. Springer, Heidelberg (2007)
Schwefel, H.-P., Rudolph, G.: Contemporary evolution strategies. In: European Conf. on Artificial Life (ECAL), pp. 893–907. Springer, Heidelberg (1995)
Witt, C.: Runtime analysis of the (μ+1) EA on simple pseudo-Boolean functions. Evolutionary Computation 14(1), 65–86 (2006)
Zarges, C.: Rigorous runtime analysis of inversely fitness proportional mutation rates. In: Rudolph, G., Jansen, T., Lucas, S., Poloni, C., Beume, N. (eds.) PPSN 2008. LNCS, vol. 5199, pp. 112–122. Springer, Heidelberg (2008)
Zarges, C.: On the utility of the population size for inversely fitness proportional mutation rate. In: Foundations of Genetic Algorithms (FOGA), pp. 39–46 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jansen, T., Zarges, C. (2009). Comparing Different Aging Operators. In: Andrews, P.S., et al. Artificial Immune Systems. ICARIS 2009. Lecture Notes in Computer Science, vol 5666. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03246-2_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-03246-2_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03245-5
Online ISBN: 978-3-642-03246-2
eBook Packages: Computer ScienceComputer Science (R0)