论文信息 - Parameter-less Genetic Algorithm: A Worst-case Time and Space Complexity Analysis

Parameter-less Genetic Algorithm: A Worst-case Time and Space Complexity Analysis

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 con gurations of the parameter less genetic algorithm are considered and the results of their time and space complexity are compared

Martin Pelikan | Fernando G. Lobo

[1] Dirk Thierens,et al. Toward a Better Understanding of Mixing in Genetic Algorithms , 1993 .

[2] John H. Holland,et al. Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[3] David E. Goldberg,et al. The Gambler's Ruin Problem, Genetic Algorithms, and the Sizing of Populations , 1999, Evolutionary Computation.

[4] David E. Goldberg,et al. Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[5] Fernando G. Lobo,et al. A parameter-less genetic algorithm , 1999, GECCO.