Grammatical Evolution and the Santa Fe Trail Problem

Created by W.Langdon from gp-bibliography.bib Revision:1.4524

  author =       "Loukas Georgiou and William J. Teahan",
  title =        "Grammatical Evolution and the Santa Fe Trail Problem",
  booktitle =    "Proceedings of the International Conference on
                 Evolutionary Computation (ICEC 2010)",
  year =         "2010",
  editor =       "Joaquim Filipe and Janusz Kacprzyk",
  pages =        "10--19",
  address =      "Valencia, Spain",
  month =        "24-26 " # oct,
  organisation = "INSTICC, AAAI, WfMC",
  publisher =    "SciTePress",
  keywords =     "genetic algorithms, genetic programming, Grammatical
                 Evolution, Artificial Ant Problem, Santa Fe Trail
                 Problem, Genetic Programming, Genetic Algorithms, jGE,
                 jGE NetLogo, Java, NetLogo",
  isbn13 =       "978-989-8425-31-7",
  URL =          "",
  size =         "10 pages",
  abstract =     "In this paper we present the results of a series of
                 experiments which explore the effectiveness of
                 Grammatical Evolution for the Santa Fe Trail problem.
                 The experiments which are presented support the claim
                 of other published work that the comparison mentioned
                 in the Grammatical Evolution literature between
                 Grammatical Evolution (GE) and Genetic Programming (GP)
                 regarding the Santa Fe Trail problem is not a fair one.
                 Namely, GE literature claims that GE outperforms GP in
                 the Santa Fe Trail problem, but we show that this
                 happens only because the GE experiments described in
                 the literature use a different and narrower search
                 space. In order to perform the experiments, a series of
                 tools and models have been developed and are presented:
                 a) jGE, a Java implementation of the Grammatical
                 Evolution system; b) jGE NetLogo, an extension of jGE
                 for the NetLogo modelling environment; c) the Santa Fe
                 Trail model, a simulation of the problem in NetLogo;
                 and d) a NetLogo model for the execution of the

                 Finally, we show that Grammatical Evolution is capable
                 of finding solutions in the Santa Fe Trail problem that
                 require fewer steps than the solutions mentioned in the
                 GP and GE literature.",
  notes =        "Broken
                 Also known as \cite{DBLP:conf/ijcci/GeorgiouT10}",

Genetic Programming entries for Loukas Georgiou William J Teahan