On benchmarking functions for genetic algorithms
Jason G. Digalakis, Konstantinos G. Margaritis · International Journal of Computer Mathematics · 2001
This paper presents experimental results on the major benchmarking functions used for performance evaluation of Genetic Algorithms (GAs). Parameters considered include the effect of population size, crossover probability, mutation rate and pseudorandom generator. The general computational behavior of two basic GAs models, the Generational Replacement Model (GRM) and the Steady State Replacement Model (SSRM) is evaluated.