Ancestral networks in evolutionary algorithms
Karthik Kuber, Stuart W. Card, Kishan G. Mehrotra, Chilukuri Krishna Mohan · 2014
The behaviors of populations in evolutionary algorithms can be understood in terms of the dynamics of network models whose nodes represent individuals in the population. This paper explores "ancestral networks" in which connections indicate the proximity of the nearest common ancestor of two nodes. Preliminary experimental results show that the formation of large components in such an ancestral network model can be used to identify potential convergence, and to determine when randomly reseeding part of a population can prove beneficial.