Assortative Mating in Genetic Algorithms for Dynamic Problems

Non-random mating seems to be the norm in nature among sexual organisms. A common mating criteria among animals is assortative mating, where individuals mate according to their phenotype similarities (or dissimilarities). This paper explores the effect of including assortative mating in genetic algorithms for dynamic problems. A wide range of mutation rates was explored, since comparative results were found to change drastically for different mutation rates. The strategy for selecting mates was found to interact with the mutation rate value: low mutation rates were the best choice for dissortative mating, medium mutation values for the standard GA, and higher mutation rates for assortative mating. Thus, GA efficiency is related to mate selection strategies in connection with mutation values. For low mutation rates typically used in GA, dissortative mating was shown to be a robust and promising strategy for dynamic problems.

• Type: Conference
• Year: 2005
• Where: EVOW
• Authors: Gabriela Ochoa, Christian Mädler-Kron, Ricardo Rodriguez, Klaus Jaffe
• Keywords: Artificial Intelligence, Assortative Mating, EVOW 2005, Low Mutation Rates, Mutation Rates