title: A novel mating approach for genetic algorithms.
abstract: Genetic algorithms typically use crossover, which relies on mating a set of selected parents. As part of crossover, random mating is often carried out. A novel approach to parent mating is presented in this work. Our novel approach can be applied in combination with a traditional similarity-based criterion to measure distance between individuals or with a fitness-based criterion. We introduce a parameter called the mating index that allows different mating strategies to be developed within a uniform framework: an exploitative strategy called best-first, an explorative strategy called best-last, and an adaptive strategy called self-adaptive. Self-adaptive mating is defined in the context of the novel algorithm, and aims to achieve a balance between exploitation and exploration in a domain-independent manner. The present work formally defines the novel mating approach, analyzes its behavior, and conducts an extensive experimental study to quantitatively determine its benefits. In the domain of real function optimization, the experiments show that, as the degree of multimodality of the function at hand grows, increasing the mating index improves performance. In the case of the self-adaptive mating strategy, the experiments give strong results for several case studies.
authors.affiliation: Department of Artificial Intelligence, UNED, Madrid, 28040, Spain. seve@dia.uned.es
authors.forename: Severino F
authors.initials: SF
authors.lastname: Galán
authors.forename: Ole J
authors.initials: OJ
authors.lastname: Mengshoel
authors.forename: Rafael
authors.initials: R
authors.lastname: Pinter
mesh_terms: D000465:Algorithms; D005075:Biological Evolution; D019295:Computational Biology / Q000379:methods*; D014644:Genetic Variation; D008957:Models, Genetic; D009154:Mutation; D010641:Phenotype; D011995:Recombination, Genetic; D015203:Reproducibility of Results; D012984:Software; D013997:Time Factors