Genetic algorithms with age structure

 This paper deals with genetic algorithms with age structure. Evolutionary optimization methods have been successfully applied to complex optimization problems, but the evolutionary optimization methods have a problem of bias in candidate solutions due to genetic drift in search. To solve this problem, we propose the introduction of age structure into genetic algorithms as a simple extension. In nature, an individual is removed from a population when the individual reaches lethal age. Therefore, genetic algorithms with age structure (ASGA) can maintain the genetic diversity of a population by removing aged individuals from the population. First, we conduct simple simulations of two subpopulations considering the age structure. Next, we apply the ASGA to a kanapsack problem. Finally, we discuss the optimal parameters for the age structure of the ASGA. These simulation results indicate that the ASGA can control selection pressure by aging process and relatively maintain the genetic diversity of a population. Received: 17 February 1997/Accepted: 6 May 1997