Skip to main content

Santa Fe Trail Hazards

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3871))

Abstract

This paper focuses on methodological problems associated to the famous Santa Fe Trail (SFT) problem, a very common benchmark for evaluating Genetic Programming (GP) algorithms, introduced by Koza in its first book on GP. We put in evidence the difficulty to ensure fair comparisons especially with new genotype representations as found in works on grammar-based automatic programming, such as Grammatical Evolution, and Bayesian Automatic Programming. We extend a work by Langdon et al. by measuring the effort to solve SFT by random search with different time steps limits and a reduced but semantically equivalent function set.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Jefferson, D., Collins, R., Cooper, C., Dyer, M., Flowers, M., Korf, R., Taylor, C., Wang, A.: Evolution as a theme in artificial life: The genesys/tracker system. In: Langton, Taylor, Farmer, Rasmussen (eds.) Proceedings of Artificial Life 2. Proceedings volume in the Santa Fe Institute studies in the sciences of complexity, vol. 10, pp. 549–578. Addison-Wesley, Reading (1992)

    Google Scholar 

  2. Koza, J.: Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge (1992)

    MATH  Google Scholar 

  3. Koza, J.: Genetic evolution and co-evolution of computer programs. In: Langton, Taylor, Farmer, Rasmussen (eds.) Proceedings of Artificial Life 2. Proceedings volume in the Santa Fe Institute studies in the sciences of complexity, vol. 10, pp. 603–629. Addison Wesley, Reading (1992)

    Google Scholar 

  4. Langdon, W.B.: Better trained ants. In: Banzhaf, W., Poli, R., Schoenauer, M., Fogarty, T.C. (eds.) EuroGP 1998. LNCS, vol. 1391, pp. 11–13. Springer, Heidelberg (1998)

    Google Scholar 

  5. Langdon, W.B., Poli, R.: Foundations of Genetic Programming. Springer, Heidelberg (2002)

    Book  MATH  Google Scholar 

  6. O’Neill, M., Ryan, C.: Evolving multi-line compilable C programs. In: Langdon, W.B., Fogarty, T.C., Nordin, P., Poli, R. (eds.) EuroGP 1999. LNCS, vol. 1598, pp. 83–92. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  7. O’Neill, M., Ryan, C.: Grammatical evolution. IEEE Transactions on Evolutionary Computation 5(4), 349–358 (2001)

    Article  Google Scholar 

  8. Keijzer, M., O’Neill, M., Ryan, C., Cattolico, M.: Grammatical evolution rules: The mod and the bucket rule. In: Foster, J.A., Lutton, E., Miller, J., Ryan, C., Tettamanzi, A.G.B. (eds.) EuroGP 2002. LNCS, vol. 2278, pp. 123–130. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  9. Ryan, C., Nicolau, M., O’Neill, M.: Genetic algorithms using grammatical evolution. In: Foster, J.A., Lutton, E., Miller, J., Ryan, C., Tettamanzi, A.G.B. (eds.) EuroGP 2002. LNCS, vol. 2278, pp. 278–287. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  10. O’Neill, M., Ryan, C.: Grammatical evolution by grammatical evolution: The evolution of grammar and genetic code. In: Keijzer, M., O’Reilly, U.-M., Lucas, S.M., Costa, E., Soule, T. (eds.) EuroGP 2004. LNCS, vol. 3003, pp. 138–149. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  11. O’Neill, M., Ryan, C.: Automatic generation of high level functions using evolutionary algorithms. In: Ryan, C., Buckley, J. (eds.) Proceedings of the 1st International Workshop on Soft Computing Applied to Software Enineering, University of Limerick, Ireland, 12-14 April 1999, pp. 21–29. Limerick University Press (1999)

    Google Scholar 

  12. O’Neill, M., Ryan, C.: Grammatical Evolution: Evolutionary Automatic Programming in a Arbitrary Language. Genetic programming, vol. 4. Kluwer Academic Publishers, Dordrecht (2003)

    Book  MATH  Google Scholar 

  13. Regolin, E.N., Pozo, A.T.R.: Bayesian automatic programming. In: Keijzer, M., Tettamanzi, A.G.B., Collet, P., van Hemert, J.I., Tomassini, M. (eds.) EuroGP 2005. LNCS, vol. 3447, pp. 39–48. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  14. Salustowicz, R.P., Schmidhuber, J.: Probabilistic incremental program evolution. Evolutionary Computation 5(2), 123–141 (1997)

    Article  Google Scholar 

  15. Luke, S., Panait, L.: Is the perfect the enemy of the good? In: Langdon, W.B., Cantú-Paz, E., Mathias, K., Roy, R., Davis, D., Poli, R., Balakrishnan, K., Honavar, V., Rudolph, G., Wegener, J., Bull, L., Potter, M.A., Schultz, A.C., Miller, J.F., Burke, E., Jonoska, N. (eds.) GECCO 2002: Proceedings of the Genetic and Evolutionary Computation Conference, 9-13 July 2002, pp. 820–828. Morgan Kaufmann, San Francisco (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Robilliard, D., Mahler, S., Verhaghe, D., Fonlupt, C. (2006). Santa Fe Trail Hazards. In: Talbi, EG., Liardet, P., Collet, P., Lutton, E., Schoenauer, M. (eds) Artificial Evolution. EA 2005. Lecture Notes in Computer Science, vol 3871. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11740698_1

Download citation

  • DOI: https://doi.org/10.1007/11740698_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-33589-4

  • Online ISBN: 978-3-540-33590-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics