Self-adaptive Mate Choice for Cluster Geometry Optimization



Sexual Selection through Mate Choice has, over the past few decades, attracted the attention of researchers from various fields. They have gathered numerous supporting evidence, establishing Mate Choice as a major driving force of evolution, capable of shaping complex traits and behaviours. Despite its wide acceptance and relevance across various research fields, the impact of Mate Choice in Evolutionary Computation is still far from understood, both regarding performance and behaviour.
In this study we describe a nature-inspired self-adaptive mate choice model, relying on a Genetic Programming representation tailored for the optimization of Morse clusters, a relevant and widely accepted problem for benchmarking new algorithms, which provides a set of hard test instances. The model is coupled with a state-of-the-art hybrid steady-state approach and both its performance and behaviour are assessed with a particular interest on the replacement strategy’s acceptance rate and diversity handling.


Evolutionary Algorithms, Genetic Programming, Sexual Se- lection, Mate Choice, Self-adaption, Cluster Geometry Op- timization


Mate Choice for CGO


Conference on Genetic and Evolutionary Computation (GECCO), July 2013

PDF File

Cited by

No citations found