A rigorous analysis of the compact genetic algorithm for linear functions

Natural Computing

Volumn 5, Issue 3, 2006, Pages 257-283

  Droste, Stefan ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

Compact genetic algorithm; Runtime; Theoretical analysis

Indexed keywords

ARTICLE; GENETIC ALGORITHM; INFORMATION SCIENCE; LINEAR SYSTEM; PROBABILITY; PROBLEM SOLVING;

EID: 33748112122     PISSN: 15677818     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11047-006-9001-0     Document Type: Article

References (11)

1. Beyer H-G, Schwefel H-P, Wegener I (2002). 'How to analyse evolutionary algorithms. Theoretical Computer Science 287: 101-130
2. Droste S (2005) Not all linear functions are equally difficult for the compact genetic algorithms. In: Beyer H-G et al. (eds.) Proceedings of the Genetic and Evolutionary Computation Conference, pp. 679-686. ACM Press, Washington, DC
3. Droste S, Jansen T, Wegener I (2002). 'On the analysis of the (1+1) EA'. Theoretical Computer Science 276: 51-81
4. Harik GR, Lobo FG and Goldberg DE (1998) The compact genetic algorithm. In: Proceedings of the IEEE Conference on Evolutionary Computation, pp. 523-528. IEEE Press, Anchorage, AK
5. He J and Yao X (2004). 'A study of drift analysis for estimating computation time of evolutionary algorithms'. Natural Computing 3: 21-35
6. Larranaga P and Lozano JA (2002) Estimation of Distribution Algorithms. Kluwer Academic Publisher
7. Motwani R and Raghavan P (1995). Randomized Algorithms. Cambridge, Cambridge University Press
8. Mühlenbein H and Mahnig T (1999). 'Convergence theory and applications of the factorized distribution algorithm'. Journal of Computing and Information Technology 7: 19-32
9. Rudolph G (1997). Convergence Properties of Evolutionary Algorithms. Verlag Dr., Kovač
10. Wegener I (2002) Methods for the analysis of evolutionary algorithms on pseudo-boolean functions. In: Sarker R, Yao X and Mohammadian M (eds) Evolutionary Optimization, pp. 349-369. Kluwer
11. Wegener I (2005) Computational Complexity and EC. Tutorial at GECCO 2003, 2004, and 2005