Initial-population bias in the univariate estimation of distribution algorithm

Proceedings of the 11th Annual Genetic and Evolutionary Computation Conference, GECCO-2009

Volumn , Issue , 2009, Pages 429-436

  Pelikan, Martin ^a   Sastry, Kumara ^b  

^a UNIVERSITY OF MISSOURI ST LOUIS   (United States)

^b INTEL CORPORATION   (United States)

Author keywords

Edas; Estimation of distribution algorithms; Noisy onemax; Onemax; Population bias; Population size; Scalability; Time to convergence; Umda; Univariate marginal distribution algorithm

Indexed keywords

ESTIMATION OF DISTRIBUTION ALGORITHMS; GLOBAL OPTIMUM; INITIAL POPULATION; POPULATION SIZES; TEST PROBLEM; THEORETICAL MODELS; UNIVARIATE; UNIVARIATE MARGINAL DISTRIBUTION ALGORITHMS;

ESTIMATION; EVOLUTIONARY ALGORITHMS; HEURISTIC ALGORITHMS; PARAMETERIZATION; POPULATION STATISTICS; SCALABILITY; THREE TERM CONTROL SYSTEMS;

CONVERGENCE OF NUMERICAL METHODS;

EID: 72749112069     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1569901.1569961     Document Type: Conference Paper

References (16)

1. S. Baluja. Population-based incremental learning: A method for integrating genetic search based function optimization and competitive learning. Tech. Rep. No. CMU-CS-94-163, Carnegie Mellon University, Pittsburgh, PA, 1994.
2. J. Branke, C. Lode, and J. L. Shapiro. Addressing sampling errors and diversity loss in UMDA. Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2007), pages 508-515, 2007.
3. W. Feller. An introduction to probability theory and its applications. Wiley, New York, NY, 1970.
4. D. E. Goldberg. The design of innovation: Lessons from and for competent genetic algorithms, volume 7 of Genetic Algorithms and Evolutionary Computation. Kluwer Academic Publishers, 2002.
5. D. E. Goldberg, K. Deb, and J. H. Clark. Genetic algorithms, noise, and the sizing of populations. Complex Systems, 6:333-362, 1992.
6. D. E. Goldberg and M. Rudnick. Genetic algorithms and the variance of fitness. Complex Systems, 5(3):265-278, 1991. Also IlliGAL Report No. 91001.
7. D. E. Goldberg, K. Sastry, and T. Latoza. On the supply of building blocks. Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2001), pages 336-342, 2001. Also IlliGAL Report No. 2001015.
8. G. Harik, E. Cantú-Paz, D. E. Goldberg, and B. L. Miller. The gambler's ruin problem, genetic algorithms, and the sizing of populations. Evolutionary Computation, 7(3):231-253, 1999.
9. A. Juels, S. Baluja, and A. Sinclair. The equilibrium genetic algorithm and the role of crossover. Unpublished manuscript, 1993.
10. B. L. Miller and D. E. Goldberg. Genetic algorithms, tournament selection, and the effects of noise. Complex Systems, 9(3):193-212, 1995.
11. B. L. Miller and D. E. Goldberg. Genetic algorithms, selection schemes, and the varying effects of noise. Evolutionary Computation, 4(2):113-131, 1996.
12. H. Mühlenbein. How genetic algorithms really work: I.Mutation and Hillclimbing. In R. Männer and B. Manderick, editors, Parallel Problem Solving from Nature, pages 15-25, Amsterdam, Netherlands, 1992. Elsevier Science.
13. H. Mühlenbein and G. Paaß. From recombination of genes to the estimation of distributions I. Binary parameters. Parallel Problem Solving from Nature, pages 178-187, 1996.
14. M. Pelikan. Hierarchical Bayesian optimization algorithm: Toward a new generation of evolutionary algorithms. Springer, 2005.
15. K. Sastry. Evaluation-relaxation schemes for genetic and evolutionary algorithms. Master's thesis, University of Illinois at Urbana-Champaign, Department of General Engineering, Urbana, IL, 2001.
16. D. Thierens and D. Goldberg. Convergence models of genetic algorithm selection schemes. Parallel Problem Solving from Nature, pages 116-121, 1994.