In the chapter we introduce two evolutionary algorithms, specifically genetic algorithms and the more recent differential evolution algorithm. We describe the key processes of selection, mutation and recombination. We consider both binary and continuous (or real) versions of the genetic algorithm. We examine the practical performance of these algorithms on some standard test problems and the effect of key parameters on their overall efficiency.