Illinois Genetic Algorithms Laboratory

Pelikan, M. and Lobo, F. (1999)
TR No.: 99014 | Download PDF | Download PS

Abstract:

In this paper, the worst-case analysis of the time and space complexity of the parameter-less genetic algorithm versus the genetic algorithm with an optimal population size is provided and the results of the analysis are discussed. Since the assumptions in order for the analysis to be correct are very weak, the result is applicable to a wide range of problems. Various configurations of the parameter-less genetic algorithm are considered and the results of their time and space complexity are compared.