A GP neutral function for the artificial ANT problem

Proceedings of GECCO 2007: Genetic and Evolutionary Computation Conference, Companion Material

Volumn , Issue , 2007, Pages 2565-2571

  Ricalde, Esteban ^a   Vázquez, Katya Rodríguez ^a  

^a UNIVERSIDAD NACIONAL AUTÓNOMA DE MÉXICO   (Mexico)

Author keywords

Evolutionary computation; Genetic programming; Neutrality

Indexed keywords

EVOLUTIONARY ALGORITHMS; GENETIC PROGRAMMING; MATHEMATICAL MODELS; PROBLEM SOLVING;

ARTIFICIAL ANT PROBLEM; MUTATION RATES; NEUTRALITY;

NEURAL NETWORKS;

EID: 34548106596     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1274000.1274026     Document Type: Conference Paper

References (18)

1. W. Banzhaf. Genotype-phenotype mapping and neutral variation - a case study in genetic programming. In Parallel Problem Solving from Nature III, volume 866 of Lecture Notes in Computer Science, pages 322-332, October 1994.
2. W. Banzhaf, P. Nordin, R. Keller, and F. Francone. Genetic programming - An introduction. Morgan Kaufmann, San Francisco, 1998.
3. K. Chellapilla. Evolutionary programming with tree mutations: Evolving computer programs without crossover. In J. Koza, K. Deb, M. Dorigo, D. B. Fogel, M. Garzon, H. Iba, and R. L. Riolo, editors, Genetic Programming 2007: Proceedings of the Second Annual Conference on Genetic Programming, pages 432-438. MIT Press, Morgan Kaufmann, July 1997.
4. M. Collins. Finding needles in haystacks is harder with neutrality. In H.-G. Beyer, U.-M. O'Reilly, D. V. Arnold, W. Banzhaf, D. Dasgupta, K. Deb, J. A. Foster, E. D. de Jong, H. Lipson, X. Llora, S. Mancoridis, A. M. Tyrrell, J.-P. Watson, and E. Zitzler, editors, GECCO 2005: Proceedings of the 2005 conference on Genetic and Evolutionary Computation, volume 2, pages 1613-1618. ACM Press, June 2005.
5. E. Galván-López, K. Rodríguez-Vázquez, and R. Poli. Beneficial aspects of neutrality in GP. In F. Rothlauf, editor, Late breaking paper at Genetic and Evolutionary Computation Conference (GECCO'2005), Washington, D.C., USA, June 2005.
6. C. Janikow and C. Mann. CGP visits the santa fe trail-effects of heuristics on GP. In H.-G. Beyer, U.-M. O'Reilly, D. V. Arnold, W. Banzhaf, D. Dasgupta, K. Deb, J. A. Foster, E. D. de Jong, H. Lipson, X. Llora, S. Mancoridis, A. M. Tyrrell, J.-P. Watson, and E. Zitzler, editors, GECCO 2005: Proceedings of the 2005 conference on Genetic and Evolutionary Computation, volume 2, pages 1697-1704, Washington DC, USA, June 2005. ACM Press.
7. D. Jefferson, R. Collins, C. Cooper, M. Dyer, M. Flowers, R. Korf, C. Taylor, and A. Wang. Evolution as a theme in artificial life: The genesys/tracker system. In C. G. Langton, C. E. Taylor, D. J. Farmer, and S. Rasmussen, editors, Artificial Life II, pages 549-578. Santa Fe Institute Studies in the Sciences of Complexity, Addison-Wesley, February 1992.
8. M. Kimura. The neutral theory of molecular evolution. Cambridge University Press, 1983.
9. J. Koza. Genetic Programming: On the programming of computers by means of natural selection. MIT Press, Cambridge, Massachusetts, 1992.
10. W. Langdon and R. Poli. Better trained ants for genetic programming. Technical Report CSRP-98-12, University of Birmingham, School of Computer Science, April 1998.
11. W. Langdon and R. Poli. Why ants are hard. In J. Koza, W. Banzhaf, K. Chellapilla, K. Deb, M. Dorigo, D. B. Fogel, M. H. Garzon, D. E. Goldberg, H. Iba, and R. Riolo, editors, Genetic Programming 1998: Proceedings of the Third Annual Conference, pages 193-201, University of Wisconsin, Madison, Wisconsin, USA, July 1998.
12. J. Miller and P. Thomson. Cartesian genetic programming. In R. Poli, W. Banzhaf, W. Langdon, J. Miller, P. Nordin, and T. C. Fogarty, editors, Third European Conference on Genetic Programming, volume 1802 of Lecture Notes in Computer Science, pages 121-132. Springer-Verlag, 2000.
13. P. Smith and K. Harries. Code growth, explicitly defined introns and alternative selection schemes. Evolutionary Computation, 6(4):339-360, 1998.
14. T. Soule. Operator choice and the evolution of robust solutions. In R. L. Riolo and B. Worzel, editors, Genetic Programming Theory and Practice, chapter 16, pages 257-270. Kluwer, July 2003.
15. M. Tomassini, L. Vanneschi, F. Fernández, and G. Galeano. A study of diversity in multipopulation genetic programming. In P. Liardet, P. Collet, C Fonlupt, E. Lutton, and M. Schoenauer, editors, Evolution Artificielle, 6th International Conference, volume 2936 of Lecture Notes in Computer Science, pages 243-255, Marseilles, France, October 2003. Springer-Verlag.
16. T. Yu and J. Miller. Neutrality and the evolvability of boolean function landscape. In J. F. Miller, M. Tomassini, P. L. Lanzi, C. Ryan, A. G. B. Tettamanzi, and W. B. Langdon, editors, Genetic Programming, Proceedings of EuroGP'2001, volume 2038 of Lecture Notes in Computer Science, pages 204-217, Lake Como, Italy, April 2001. Springer-Verlag.
17. T. Yu and J. Miller. Needles in haystacks are not hard to find with neutrality. In J. A. Foster, E. Lutton, J. F. Miller, C. Ryan, and A. Tettamanzi, editors, Proceedings of the Fifth European Conference on GP, volume 2278 of Lecture Notes in Computer Science, pages 13-25, Kinsale, Ireland, April 2002. Springer-Verlag.
18. T. Yu and J. Miller. The role of neutral and adaptive mutation in an evolutionary search on the onemax problem. In E. Cantú-Paz, editor, Late Breaking Papers at the Genetic and Evolutionary Computation Conference (GECCO-2002), pages 512-519, New York, USA, July 2002. AAAI.