Genetic programming: Analysis of optimal mutation rates in a problem with varying difficulty

FLAIRS 2006 - Proceedings of the Nineteenth International Florida Artificial Intelligence Research Society Conference

Volumn 2006, Issue , 2006, Pages 451-456

  Piszcz, Alan ^a   Soule, Terence ^a  

^a University of Idaho   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL PROGRAMMING; NUMERICAL METHODS; OPTIMAL CONTROL SYSTEMS; PROBLEM SOLVING;

GENETIC PROGRAMMING; GENETIC PROGRAMS; NUMERICAL SWEEPS; OPTIMAL MUTATION RATES;

GENETIC ALGORITHMS;

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

References (15)

1. Banzhaf, W.; Francone, F. D.; and Nordin, N. 1996. The effect of extensive use of the mutation operator on generalization in genetic programming using sparse data sets. In Voigt, H.-M.; Ebeling, W.; Rechenberg, I.; and Schwefel, H.-P., eds., Parallel Problem Solving from Nature IV, Proceedings of the International Conference on Evolutionary Computation, volume 1141 of LNCS, 300-309. Berlin, Germany: Springer Verlag.
2. Eiben, A. E.; Hinterding, R.; and Michalewicz, Z. 1999, Parameter control in evolutionary algorithms. IEEE Transations on Evolutionary Computation 3(2): 124-141.
3. Gathercole, C., and Ross, P. 1996. An adverse interaction between crossover and restricted tree depth in genetic programming. In Koza, J. R.; Goldberg, D. E.; Fogel, D. B.; and Riolo, R. L., eds., Genetic Programming 1996: Proceedings of the First Annual Conference, 291-296. Stanford University, CA, USA: MIT Press.
4. Koza, J. R.; III, F. H. B.; Andre, D.; and Keane, M. A. 1999. Genetic Programming III: Darwinian Invention and Problem Solving. Morgan Kaufmann Press.
5. Koza, J. R.; Keane, M. A.; Streeter, M. J.; Mydlowec, W.; Yu, J.; and Lanza, G. 2003. Genetic Programming IV: Routine Human-Competitive Machine Intelligence. Kluwer Academic Publishers.
6. Koza, J. R. 1992a. Genetic Programming: On the Programming of Computers by Means of Natural Selection, Cambridge, MA, USA: MIT Press. 106-107.
7. Koza, J. R. 1992b. Genetic Programming: On the Programming of Computers by Means of Natural Selection. Cambridge. M A, USA: MIT Press.
8. Langdon, W. B., and Poli, R. 1997. An analysis of the MAX problem in genetic programming. In Koza, J. R.; Deb, K.; Dorigo, M.: Fogel, D. B.; Garzon, M.; Iba, H.; and Riolo, R. L., eds., Genetic Programming 1997: Proceedings of the Second Annual Conference, 222-230. Stanford University, CA, USA: Morgan Kaufmann.
9. Luke, S., and Spector. L. 1997. A comparison of crossover and mutation in genetic programming. In Koza, J. R.; Deb, K.: Dorigo, M.; Fogel, D. B.; Garzon, M.; Iba, H.; and Riolo, R. L., eds., Genetic Programming 1997: Proc. of the Second Annual Conf., 240-248. San Francisco, CA: Morgan Kaufmann.
10. Luke, S., and Spector, L. 1998. A revised comparison of crossover and mutation in genetic programming. In Koza, J. R.; Banzhaf, W.; Chellapilla, K.; Deb, K.; Dorigo, M.; Fogel, D. B.; Garzon, M. H.; Goldberg, D. E.; Iba, H.; and Riolo, R., eds., Genetic Programming 1998: Proceedings of the Third Annual Conference, 208-213. University of Wisconsin, Madison, Wisconsin, USA: Morgan Kaufmann.
11. Mühlenbein, H., and Schlierkamp-Voosen, D. 1995. Analysis of selection, mutation and recombination in genetic algorithms. In Banzhaf, W., and Eeckman, F. H., eds., Evolution as a Computational Process, Lecture Notes in Computer Science, 188-214. Springer. Berlin.
12. Piszcz, A., and Soule, T. 2005. Genetic programming: Parametric analysis of structure altering mutation techniques. In Rothlauf. F.; Blowers, M.; Branke, J.; Cagnoni, S.; Garibay, I. I.; Garibay, O.; Grahl, J.; Hornby, G.; de Jong, E. D.; Kovacs, T.; Kumar. S.; Lima, C. F.: Llorà, X.; Lobo, F.; Merkle, L. D.; Miller, J.; Moore, J. H.; O'Neill, M.; Pelikan, M.; Riopka, T. P.; Ritchie, M. D.; Sastry, K.; Smith, S. L.; Stringer. H.; Takadama, K.; Toussaint, M.; Upton, S. C.; and Wright, A. H., eds., Genetic and Evolutionary Computation Conference (GECC02005) workshop program, 220-227. Washington, D.C., USA: ACM Press.
13. Poli, R., and Langdon, W. B. 1997. Genetic programming with one-point crossover. In Chawdhry, P. K.; Roy, R.; and Pant, R. K., eds., Soft Computing in Engineering Design and Manufacturing, 180-189. Springer-Verlag London.
14. Sasaki, A., and Nowak, M. A. 2003. Mutation landscapes. Journal of Theoretical Biology 62:7.
15. Stanhope. S., and Daida, J. 1997. An individually variable mutation-rate strategy for genetic algorithms. In Angeline, P. J.; Reynolds, R. G.: McDonnell, J. R.; and Eberhart, R., eds., Evolutionary Programming VI: Proceedings of the Sixth Annual Conference on Evolutionary' Programming, volume 1213 of Lecture Notes in Computer Science. Indianapolis, Indiana, USA: Springer-Vorlag.