ABSTRACT
This chapter is devoted to the theoretical foundation of evolutionary computation and genetic algorithm. The standard genetic algorithm is presented and discussed. Advanced aspects of genetic algorithm are discussed, such as: mutation, crossover and selection operators and stopping criteria, bringing to the reader a complete aspect of the genetic algorithm and its latest operators. Furthermore, an important evolutionary algorithm is presented: the differential evolution and its variation: chaotic differential evolution. Also, an illustrative application example is presented to help the reader understand the differential evolution process.
