White Rose University Consortium logo
University of Leeds logo University of Sheffield logo York University logo

A Computational View on Natural Evolution: On the Rigorous Analysis of the Speed of Adaptation

Pérez Heredia, Jorge (2017) A Computational View on Natural Evolution: On the Rigorous Analysis of the Speed of Adaptation. PhD thesis, University of Sheffield.

[img]
Preview
Text
PerezHeredia2017ComputationalViewNaturalEvolution.pdf
Available under License Creative Commons Attribution-Noncommercial-No Derivative Works 2.0 UK: England & Wales.

Download (4Mb) | Preview

Abstract

Inspired by Darwin’s ideas, Turing (1948) proposed an evolutionary search as an automated problem solving approach. Mimicking natural evolution, evolutionary algorithms evolve a set of solutions through the repeated application of the evolutionary operators (mutation, recombination and selection). Evolutionary algorithms belong to the family of black box algorithms which are general purpose optimisation tools. They are typically used when no good specific algorithm is known for the problem at hand and they have been reported to be surprisingly effective (Eiben and Smith, 2015; Sarker et al., 2002). Interestingly, although evolutionary algorithms are heavily inspired by natural evolution, their study has deviated from the study of evolution by the population genetics community. We believe that this is a missed opportunity and that both fields can benefit from an interdisciplinary collaboration. The question of how long it takes for a natural population to evolve complex adaptations has fascinated researchers for decades. We will argue that this is an equivalent research question to the runtime analysis of algorithms. By making use of the methods and techniques used in both fields, we will derive plenty of meaningful results for both communities, proving that this interdisciplinary approach is effective and relevant. We will apply the tools used in the theoretical analysis of evolutionary algorithms to quantify the complexity of adaptive walks on many landscapes, illustrating how the structure of the fitness landscape and the parameter conditions can impose limits to adaptation. Furthermore, as geneticists use diffusion theory to track the change in the allele frequencies of a population, we will develop a brand new model to analyse the dynamics of evolutionary algorithms. Our model, based on stochastic differential equations, will allow to describe not only the expected behaviour, but also to measure how much the process might deviate from that expectation.

Item Type: Thesis (PhD)
Keywords: evolutionary computation; runtime analysis; complexity theory; evolutionary algorithms; natural evolution; population genetics; strong selection weak mutation; metropolis; stochastic differential equations; stochastic drift
Academic Units: The University of Sheffield > Faculty of Engineering (Sheffield) > Computer Science (Sheffield)
The University of Sheffield > Faculty of Science (Sheffield) > Computer Science (Sheffield)
Identification Number/EthosID: uk.bl.ethos.731555
Depositing User: Jorge Pérez Heredia
Date Deposited: 22 Jan 2018 12:21
Last Modified: 12 Oct 2018 09:50
URI: http://etheses.whiterose.ac.uk/id/eprint/19205

You do not need to contact us to get a copy of this thesis. Please use the 'Download' link(s) above to get a copy.
You can contact us about this thesis. If you need to make a general enquiry, please see the Contact us page.

Actions (repository staff only: login required)