| 
Each process works independetly on partial individuals of size 
éL/mù.
 
The population size is the same as for an equivalent sequential algorithm.
 
All the genetic operations are local: selection, crossover, mutation, evaluation.
 
Partial individuals are exchanged periodically for evaluation purposes.
 
The final result is obtained by concatenating the best partial individual 
from each process.
 
 |   |