Not all linear functions are equally difficult for the compact genetic algorithm

GECCO 2005 - Genetic and Evolutionary Computation Conference

Volumn , Issue , 2005, Pages 679-686

  Droste, Stefan ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

Compact Genetic Algorithm; Runtime; Theoretical Analysis

Indexed keywords

ASYMPTOTIC STABILITY; BOOLEAN FUNCTIONS; LINEAR SYSTEMS; OPTIMIZATION; PROBABILITY DISTRIBUTIONS; PROBLEM SOLVING;

COMPACT GENETIC ALGORITHM; RUNTIME; THEORETICAL ANALYSIS;

GENETIC ALGORITHMS;

EID: 32444444502     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1068009.1068124     Document Type: Conference Paper

References (13)

1. T. Bäck, D. B. Fogel, and Z. Michalewicz, editors. Handbook of Evolutionary Computation. Institute of Physics Publishing and Oxford University Press, New York, NY, 1997.
2. H.-G. Beyer, H.-P. Schwefel, and I. Wegener. How to analyse evolutionary algorithms. Theoretical Computer Science, (287):101-130, 2002.
3. S. Droste, T. Jansen, and I. Wegener. On the analysis of the (1 + 1) EA. Theoretical Computer Science, (276):51-81, 2002.
4. G. R. Harik, F. G. Lobo, and D. E. Goldberg. The compact genetic algorithm. In Proceedings of the IEEE Conference on Evolutionary Computation, pages 523-528, 1998.
5. J. He and X. Yao. A study of drift analysis for estimating computation time of evolutionary algorithms. Natural Computing, (3):21 - 35, 2004.
6. P. Larranaga and J. A. Lozano. Estimation of Distribution Algorithms. Kluwer Academic Publisher, 2002.
7. R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, Cambridge, 1995.
8. H. Mühlenbein and T. Mahnig. Convergence theory and applications of the factorized distribution algorithm. Journal of Computing and Information Technology, (7): 19-32, 1999.
9. H. Mühlenbein and G. Paaß. From recombination of genes to the estimation of distributions I. Binary parameters. In Proceedings of PPSN IV, pages 178-187, 1996.
10. M. Pelikan, D. E. Goldberg, and E. Cantù-Paz. Bayesian optimization algorithm, population sizing, and time to convergence. In Proceedings of GECCO 2000, pages 275-282, 2000.
11. G. Rudolph. Convergence Properties of Evolutionary Algorithms. Verlag Dr. Kovač, 1997.
12. I. Wegener. Computational Complexity and EC. Tutorial at GECCO 2003, 2004, and 2005.
13. I. Wegener. Methods for the analysis of evolutionary algorithms on pseudo-boolean functions. In R.Sarker, X.Yao, and M.Mohammadian, editors, Evolutionary Optimization, pages 349-369. Kluwer, 2002.