Convergence time for the linkage learning genetic algorithm

Proceedings of the 2004 Congress on Evolutionary Computation, CEC2004

Volumn 1, Issue , 2004, Pages 39-46

  Chen, Ying Ping ^a   Goldberg, David E ^b  

^a University of Illinois at Urbana Champaign   (United States)

^b University of Illinois at Urbana Champaign   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GENE CODING; LINKAGE LEARNING GENETIC ALGORITHM; PROBABILISTIC EXPRESSION;

APPROXIMATION THEORY; CONVERGENCE OF NUMERICAL METHODS; GENES; GENETIC ENGINEERING; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; PROBLEM SOLVING;

GENETIC ALGORITHMS;

EID: 4344663791     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. D. E. Goldberg, B. Korb, and K. Deb, Messy genetic algorithms: Motivation, analysis, and first results. Complex Systems, 3(5):493-530, 1989. (Also TCGA Report No. 89003).
2. D. E. Goldberg, K. Deb, and D. Thierens. Toward a better understanding of mixing in genetic algorithms. Journal of the Society of Instrument and Control Engineers, 32(1): 10-16, 1993. (Also IlliGAL Report No. 92009).
3. D. Thierens. Analysis and Design of Genetic Algorithms. PhD thesis, Katholieke Universiteit Leuven, Leuven, Belgium, 1995.
4. G. R. Harik. Learning gene linkage to efficiently solve problems of bounded difficulty using genetic algorithms. PhD thesis, University of Michigan, Ann Arbor, MI, 1997. (Also IlliGAL Report No. 97005).
5. J. H. Holland. Adaptation in natural and artificial systems. University of Michigan Press, Ann Arbor, MI, 1975. ISBN: 0-262-58111-6.
6. Y.-p. Chen and D. E. Goldberg. Introducing start expression genes to the linkage learning genetic algorithm. Proceedings of the Seventh International Conference on Parallel Problem Solving from Nature (PPSN VII), pages 351-360, 2002. (Also IlliGAL Report No. 2002007).
7. G. R. Harik and D. E. Goldberg. Learning linkage. Foundations of Genetic Algorithms 4, pages 247-262, 1996. (Also IlliGAL Report No. 96006).
8. G. R. Harik and D. E. Goldberg. Learning linkage through probabilistic expression. Computer Methods in Applied Mechanics and Engineering, 186(2-4):295-310, June 2000.
9. D. Thierens and D. E. Goldberg. Mixing in genetic algorithms. Proceedings of the Fifth International Conference on Genetic Algorithms (ICGA-93), pages 38-45, 1993.
10. D. H. Ackley. A connectionist machine for genetic hill climbing. Kluwer Academic, Boston, 1987.
11. David E. Goldberg. Simple genetic algorithms and the minimal, deceptive problem. In Davis L., editor, Genetic Algorithms and Simulated Annealing, chapter 6, pages 74-88. Morgan Kaufmann Publishers, Los Altos, CA, 1987. ISBN: 0-2730-8771-1.
12. K. Deb and D. E. Goldberg. Analyzing deception in trap functions. Foundations of Genetic Algorithms 2, pages 93-108, 1993.
13. 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, June 2002. ISBN: 1-4020-7098-5.
14. G. Harik, E. Cantú-Paz, D. E. Goldberg, and B. L. Miller. The gambler's ruin problem, genetic algorithms, and the sizing of populations. Proceedings of the 1997 IEEE International Conference on Evolutionary Computation, pages 7-12, 1997.
15. G. Harik, E. Cantuú-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.
16. Y.-p. Chen and D. E. Goldberg. Tightness time for the linkage learning genetic algorithm. Proceedings of Genetic and Evolutionary Computation Conference 2003 (GECCO-2003), pages 837-849, 2003. (Also IlliGAL Report No. 2003002).