Fig. 12.

Operational scheme of the genetic algorithm (GA). In this scheme an initial population with 3 chromosomes is shown. A fitness value is assigned for each chromosome through the fitness function (F). Note that the chromosome with less fitness is discarded in the selection stage, while the larger one is doubly copied and the second largest fitness receives a copy. It is observed that the chromosome is mutated through the mutation operator in the second moment, and the other two chromosomes are crossed through the crossover operator. This process is repeated for a defined number of generations.