Assortative mating in genetic algorithms for dynamic problems

Authors:
Gabriela Ochoa;Christian Mädler-Kron;Ricardo Rodriguez;Klaus Jaffe
Affiliations:
Universidad Simon Bolivar, Caracas, Venezuela;Universidad Simon Bolivar, Caracas, Venezuela;Universidad Simon Bolivar, Caracas, Venezuela;Universidad Simon Bolivar, Caracas, Venezuela
Venue:
EC'05 Proceedings of the 3rd European conference on Applications of Evolutionary Computing
Year:
2005

Citing 5
Cited 8

niGAVaPS — outbreeding in genetic algorithms

SAC '00 Proceedings of the 2000 ACM symposium on Applied computing - Volume 1
Using assortative mating in genetic algorithms for vector quantization problems

Proceedings of the 2001 ACM symposium on Applied computing
Enhancing GA Performance through Crossover Prohibitions Based on Ancestry

Proceedings of the 6th International Conference on Genetic Algorithms
A Comparison of Dominance Mechanisms and Simple Mutation on Non-stationary Problems

PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
The Role of Mate Choice in Biocomputation: Sexual Selection as a Process of Search, Optimization and Diversification

Evolution and Biocomputation, Computational Models of Evolution

UMDAs for dynamic optimization problems

Proceedings of the 10th annual conference on Genetic and evolutionary computation
A self-organized criticality mutation operator for dynamic optimization problems

Proceedings of the 10th annual conference on Genetic and evolutionary computation
A comparative study on the performance of dissortative mating and immigrants-based strategies for evolutionary dynamic optimization

Information Sciences: an International Journal
Incorporating knowledge of secondary structures in a l-system-based encoding for protein folding

EA'05 Proceedings of the 7th international conference on Artificial Evolution
Static and adaptive mutation techniques for genetic algorithm: a systematic comparative analysis

International Journal of Computational Science and Engineering
A novel mating approach for genetic algorithms

Evolutionary Computation
Performance consequences of introducing an internal penalty function to a genetic algorithm for scheduling

Proceedings of the 2013 Research in Adaptive and Convergent Systems
Impact of static and adaptive mutation techniques on the performance of Genetic Algorithm

International Journal of Hybrid Intelligent Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.