Recombination Hotspots Promote the Evolvability of Modular Systems

ABSTRACT

Random recombination in evolutionary algorithms can be counterproductive in systems that evolve increasing modularity, because such operators do not preserve community structures during their development. Partly because of this, methods have been proposed that derandomize recombination by placing potential crossover locations under evolutionary control. Since crossover is likely to be particularly useful when genetic material that generates incipient phenotype modules is recombined, there may be an advantage to seeking such modularity directly in the phenotype and probabilistically focusing recombination at such "hotspot" locations. Here we show that such phenotypically-aware crossover operators can outcompete random or evolved crossover points as the size of the system being evolved grows. As this crossover operator can be viewed as epigenetic, and as epigenetic processes seem to be common in biological systems, other such epigenetic mechanisms may further improve future evolutionary algorithms.

References

1. C. Espinosa-Soto and A. Wagner. Specialization can drive the evolution of modularity. PLoS Comput Biol, 6(3):e1000719, 2010.
2. D. G. Georges Harik. Learning gene linkage to efficiently solve problems of bounded difficulty using genetic algorithms. FOGA, 4:247--262, August 1996.
3. M. Newman. Modularity and community structure in networks. Proc Natl Acad Sci USA, 103(23):8577--8582, April 2006.
4. R. A. Watson. Compositional evolution: the impact of sex, symbiosis and modularity on the gradualist framework of evolution. Mit Press, 2006.

Index Terms

• Mathematics of computing

  • Mathematical analysis

    • Mathematical optimization

      • Discrete optimization

        • Optimization with randomized search heuristics

          • Evolutionary algorithms