Optimal mutation and crossover rates for a genetic algorithm operating in a dynamic environment

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

Volumn 1447, Issue , 1998, Pages 693-702

  Stanhope, Stephen A ^a   Daida, Jason M ^b  

^a ERIM International   (United States)

^b UNIVERSITY OF MICHIGAN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; HAMMING DISTANCE; HEALTH;

CROSSOVER AND MUTATION; CROSSOVER RATES; DYNAMIC ENVIRONMENTS; DYNAMIC FITNESS FUNCTION; OPTIMAL MUTATION; PROBLEMATIC ISSUES; RATE OF CHANGE; RESEARCH RESULTS;

GENETIC ALGORITHMS;

EID: 84947786473     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0040820     Document Type: Conference Paper

References (34)

1. Angeline, P. 1997. Tracking Extrema in Dynamic Landscapes. In Angeline et al. (editors). Evolutionary Programming VI. Berlin: Springer-Verlag. Pp. 335-345.
2. Bäck, T. 1992. The Interaction of Mutation Rate, Selection, and Self-Adaptation Within a Genetic Algorithm. In Manner, R. and Manderick, B. (editors). Parallel Problem Solving from Nature 2. Amsterdam: North Holland. Pp. 85-94.
3. Bäck, T. 1992. Self-adaptation in Genetic Algorithms. In Varela, F. et al. (editors). Proceedings of the First European Conference on Artificial Life. Cambridge, MA: MIT Press. Pp. 263-271.
4. Back, T. 1993. Optimal Mutation Rates in Genetic Search. In Forrest, S. (editor). Proceedings of the Fifth International Conference on Genetic Algorithms. San Mateo, CA: Morgan Kaufmann. Pp. 2-8.
5. Bremermann, H. 1958. The Evolution of Intelligence. The Nervous System as a Model if its Environment. Technical Report No. 1, Contract No. 477 (17), Dept, of Mathematics, University of Washington.
6. Cobb, H.G. 1990. An Investigation into the Use of Hypermutation as an Adaptive Operator in Genetic Algorithms Having Continuous, Time-Dependent Nonstationary Environments. NRL Memorandum Report 6760.
7. Cobb, H.G. and Grefenstette, J.J. 1993. Genetic Algorithms for Tracking Changing Environments. In Forrest, S. (editor). Proceedings of the Fifth International Conference on Genetic Algorithms. San Mateo, CA: Morgan Kaufmann. Pp. 523-530.
8. Daida, J.M. et al. 1997. Challenges with Verification, Repeatability, and Meaningful Comparisons in Genetic Programming. In Koza, J.R. et al. (editors). Genetic Programming 1997. San Francisco, CA: Morgan Kaufmann. Pp. 64-69.
9. Dasgupta, D. and McGregor, D.R. 1992. Nonstationary Function Optimization using the Structured Genetic Algorithm. In Schwefel, H.P. and Manner, R. (editors). Parallel Problem Solving From Nature. Amsterdam: North Holland. Pp. 145-154.
10. Dasgupta, D. 1993. Optimization in Time-Varying environments using Structured Genetic Algorithms. Technical Report IKBS 17-93. University of Strathclyde, Dept, of Computer Science.
11. Deb, K. et al. 1997. Fitness Landscapes. In Back, T. et al. (editors). Handbook of Evolutionary Computation. Ch. B2.7. Oxford University Press.
12. Droste, S. et al. 1997. A Rigorous Complexity Analysis of the (1+1) Evolution Strategy for Separable Functions with Boolean Inputs. Technical Reports of the SFB 531, University of Dortmund.
13. Fogel, D. and Ghozeil, A. 1997. A Note on Representations and Variation Operators. IEEE Transactions on Evolutionary Computation. Vol. 1, No.2. Pp. 159-161.
14. Goldberg, D. 1989. Siving Populations for Serial and Parallel Genetic Algorithms. In Schaffer, J. (editor). Proceedings of the International Conference on Genetic Algorithms. San Mateo, CA: Morgan Kaufmann. Pp. 70-79.
15. Grefenstette, J. 1986. Optimization of Control Parameters for Genetic Algorithms. IEEE Transactions on Systems, Man, and Cybernetics. Vol. SMC-16, No. 1. Pp. 122-128.
16. Grefenstette, J. 1992. Genetic algorithms for changing environments. In Manner, R. and Manderick, B. (editors). Parallel Problem Solving from Nature 2. Amsterdam: North Holland. Pp. 137-144.
17. Harik, G. et al. 1997. The Gambler's Ruin Problem, Genetic Algorithms, and the Sizing of Populations. In Back, T. et al. (editors). Proceedings of the 1997 IEEE International Conference on Evolutionary Computation. Piscataway, NJ: IEEE Press. Pp. 7-12.
18. Hesser, J. and Manner, R. 1991. Towards an Optimal Mutation Probability for Genetic Algorithms. In Schwefel, H.P. and Manner, R. (editors). Parallel Problem Solving from Nature. New York, NY: Springer LCNS 496. Pp. 23-31.
19. Maysenburg, M.M. and Foster, J.A. 1997. The Effect of the Quality of Pseudo-Random Number Generator on the Performance of a Simple Genetic Algorithm. In Back, T. (editor). Proceedings of the Seventh International Conference on Genetic Algorithms. San Francisco, CA: Morgan Kaufmann. Pp. 276-281.
20. Holland, J. 1975. Adaptation in Natural and Artificial Systems. Cambridge, MA: The MIT Press.
21. Jones, T. 1995. Evolutionary Algorithms, Fitness Landscapes, and Search. PhD Dissertation 95-05-048, University of New Mexico.
22. Koza, J.R. 1992. Genetic Programming: On the Programming of Computers by Means of Natural Selection. Cambridge, MA: The MIT Press.
23. Krishnakumar, K. 1989. Micro-Genetic Algorithms for Stationary and Non-Stationary Function Optimization. In Rodriguez, G. (editor). SPIE Vol. 1196 Intelligent Control and Adaptive Systems. Bellingham, WA: SPIE Press. Pp. 289-296.
24. Park. S.K. and Miller, K.W. 1988. Random number generators: Good ones are hard to find. Communications of the ACM. 31:1192-1201.
25. Pettit, E. and Swigger, K.M. 1983. An Analysis of Genetic-Based Pattern Tracking and Cognitive-Based Component Tracking Models of Adaptation. Proceedings of National Conference on Al. San Francisco, CA: Morgan Kaufmann. Pp. 327-332.
26. Rechenberg, I. 1973. Evolution Strategy: Optimization of Technical Systems by Principles of Biological Evolution. (In German.) Stuttgart: Fromman-Holzboog.
27. Reeves, C. 1993. Using Genetic Algorithms with Small Populations. In Forrest, S. (editor). Proceedings of the Fifth International Conference on Genetic Algorithms. San Mateo, CA: Morgan Kaufmann. Pp. 92-99.
28. Rudolph, G. 1997. Convergence Properties of Evolutionary Algorithms. Hamburg: Kovac.
29. Schaffer, J.D. et al. 1989. A Study of Control Parameters Affecting Online Performance of Genetic Algorithms for Function Optimization. In Schaffer, J.D. (editor). Proceedings of the Third International Conference on Genetic Algorithms. San Mateo, CA: Morgan Kaufmann. Pp. 51-60.
30. Spears, W. 1993. Crossover or Mutation? In Whitley, D. (editor). Proceedings of Foundations of Genetic Algorithms 2. San Mateo, CA: Morgan Kaufmann. Pp. 221-237.
31. Stanhope, S. and Daida, J. 1997. An Individually Variable Mutation-Rate Strategy for Genetic Algorithms. In Angeline, P. et al. (editors). Proceedings of the Sixth International Conference on Evolutionary Programming. Berlin: Springer-Verlag. Pp. 235-245.
32. Suzuki, J. 1995. A Markov Chain Analysis on Simple Genetic Algorithms. IEEE Transactions on Systems, Man, and Cybernetics. Vol. SMC-25, No. 4. Pp. 655-659.
33. Wu, A. et al. 1997. Empirical observations on the roles of crossover and mutation. In Back, T. (editor). Proceedings of the Seventh International Conference on Genetic Algorithms. San Francisco, CA: Morgan Kaufmann. Pp. 362-369.
34. Vose, M. 1997. Modeling Simple Genetic Algorithms. Evolutionary Computation. Vol. 3, No. 4. Pp. 453-472.