Let's get ready to rumble: Crossover versus mutation head to head

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3103, Issue , 2004, Pages 126-137

  Sastry, Kumara ^a   Goldberg, David E ^a,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

KNOWLEDGE MANAGEMENT; STOCHASTIC SYSTEMS;

ADDITIVE GAUSSIAN NOISE; BUILDING BLOCKES; CONVERGENCE TIME; CROSSOVER AND MUTATION; DETERMINISTIC PROBLEMS; MUTATION OPERATORS; POPULATION SIZING; STOCHASTIC PROBLEMS;

GAUSSIAN NOISE (ELECTRONIC);

EID: 34547288544     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24855-2_12     Document Type: Article

References (30)

1. Barnes, J.W., Dimova, B., Dokov, S.P.: The theory of elementary landscapes. Applied Mathematical Letters 16 (2003) 337-343
2. Watson, J.P.: Empirical Modeling and Analysis of Local Search Algorithms For The Job-Shop Scheduling Problem. PhD thesis, Colorado State University, Fort Collins, CO (2003)
3. Mühlenbein, H.: Evolution in time and space- the parallel genetic algorithm. Foundations of Genetic Algorithms (1991) 316-337
4. Mühlenbein, H.: How genetic algorithms really work: Mutation and hillclimbing. Parallel Problem Solving from Nature II (1992) 15-26
5. Mitchell, M., Holland, J., Forrest, S.: When will a genetic algorithm outperform hill-climbing. Advances in Neural Information Processing Systems 6 (1994) 51-58
6. Baum, E.B., Boneh, D., Garrett, C.: Where genetic algorithms excel. Evolutionary Computation 9 (2001) 93-124
7. Spears, W.M.: Crossover or mutation. Foundations of Genetic Algorithms 2 (1993) 221-237
8. Goldberg, D.E.: Using time efficiently: Genetic-evolutionary algorithms and the continuation problem. Proceedings of the Genetic and Evolutionary Computation Conference (1999) 212-219 (Also IlliGAL Report No. 99002).
9. Srivastava, R., Goldberg, D.E.: Verification of the theory of genetic and evolutionary continuation. Proceedings of the Genetic and Evolutionary Computation Conference (2001) 551-558 (Also IlliGAL Report No. 2001007).
10. Srivastava, R.: Time continuation in genetic algorithms. Master's thesis, University of Illinois at Urbana-Champaign, General Engineering Department, Urbana, IL (2002) (Also IlliGAL Report No. 2001021).
11. Cantú-Paz, E., Goldberg, D.E.: Are multiple runs of genetic algorithms better than one? Proceedings of the Genetic and Evolutionary Computation Conference (2003) 801-812
12. Cantú-Paz, E.: Efficient and accurate parallel genetic algorithms. Kluwer Academic Pub, Boston, MA (2000)
13. Luke, S.: When short runs beat long runs. Proceedings of the Genetic and Evolutionary Computation Conference (2001) 74-80
14. Fuchs, M.: Large populations are not always the best choice in genetic programming. Proceedings of the Genetic and Evolutionary Computation Conference (1999) 1033-1038
15. Goldberg, D.E.: Design of innovation: Lessons from and for competent genetic algorithms. Kluwer Academic Publishers, Boston, MA (2002)
16. Sastry, K., Goldberg, D.: Designing competent mutation operators via probabilistic model building of neighborhoods. Proceedings of the Genetic and Evolutionary Computation Conference (2004) (To appear) (Also IlliGAL Report No. 2004006).
17. Holland, J.H.: Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor, MI (1975)
18. Goldberg, D.E.: Genetic Algorithms in Search Optimization and Machine Learning. Addison-Wesley, Reading, MA (1989)
19. Goldberg, D.E., Korb, B., Deb, K.: Messy genetic algorithms: Motivation, analysis, and first results. Complex Systems 3 (1989) 493-530 (Also IlliGAL Report No. 89003).
20. Thierens, D., Goldberg, D.E.: Convergence models of genetic algorithm selection schemes. Parallel Problem Solving from Nature 3 (1994) 116-121
21. Goldberg, D.E., Deb, K., Clark, J.H.: Genetic algorithms, noise, and the sizing of populations. Complex Systems 6 (1992) 333-362 (Also IlliGAL Report No. 91010).
22. Harik, G., Cantú-Paz, E., Goldberg, D.E., Miller, B.L.: The gambler's ruin problem, genetic algorithms, and the sizing of populations. Evolutionary Computation 7 (1999) 231-253 (Also IlliGAL Report No. 96004).
23. Mühlenbein, H., Schlierkamp-Voosen, D.: Predictive models for the breeder genetic algorithm: I. continuous parameter optimization. Evolutionary Computation 1 (1993) 25-49
24. Bulmer, M.G.: The Mathematical Theory of Quantitative Genetics. Oxford University Press, Oxford (1985)
25. Bäck, T.: Selective pressure in evolutionary algorithms: A characterization of selection mechanisms. Proceedings of the First IEEE Conference on Evolutionary Computation (1994) 57-62
26. Miller, B.L., Goldberg, D.E.: Genetic algorithms, tournament selection, and the effects of noise. Complex Systems 9 (1995) 193-212 (Also IlliGAL Report No. 95006).
27. Bäck, T.: Generalized convergence models for tournament - and (μ, λ) - selection. Proceedings of the Sixth International Conference on Genetic Algorithms (1995) 2-8
28. Miller, B.L.: Noise, Sampling, and Efficient Genetic Algorithms. PhD thesis, University of Illinois at Urbana-Champaign, General Engineering Department, Urbana, IL (1997) (Also IlliGAL Report No. 97001).
29. Goldberg, D.E.: Simple genetic algorithms and the minimal, deceptive problem. In Davis, L., ed.: Genetic algorithms and simulated annealing. Morgan Kaufmann, Los Altos, CA (1987) 74-88
30. Sastry, K.: Evaluation-relaxation schemes for genetic and evolutionary algorithms. Master's thesis, University of Illinois at Urbana-Champaign, General Engineering Department, Urbana, IL (2001) (Also IlliGAL Report No. 2002004).