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. © 2009 Springer.
CITATION STYLE
Jansen, T., & Zarges, C. (2009). Comparing different aging operators. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5666 LNCS, pp. 95–108). https://doi.org/10.1007/978-3-642-03246-2_13
Mendeley helps you to discover research relevant for your work.