Such an algorithm keeps a population consisting of candidate solutions. Mutation and\or recombination are used to create new candidate solutions. According to a fitness function some candidate solutions are selected to survive. The hope is that thereby an optimum solution is found.
This talk will give an introduction to evolutionary computation and give examples how such algorithms can be theoretically analyzed.