Analysis of the execution time plays an important role in selection of evolution algorithms and in selection of mapping algorithms for parallel processing. The paper presents the case of a parallel genetic algorithm spending most of time in the evaluation step. Presentation of some numerical results complements this study.
Advances in Natural Sciences Vol.4, No.4 (2003) (295-298)
