Asynchronous Evolution by Reference-based Evaluation: Tertiary Parent Selection and its Archive

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

  author =       "Tomohiro Harada and Keiki Takadama",
  title =        "Asynchronous Evolution by Reference-based Evaluation:
                 Tertiary Parent Selection and its Archive",
  booktitle =    "17th European Conference on Genetic Programming",
  year =         "2014",
  editor =       "Miguel Nicolau and Krzysztof Krawiec and 
                 Malcolm I. Heywood and Mauro Castelli and Pablo Garcia-Sanchez and 
                 Juan J. Merelo and Victor M. {Rivas Santos} and 
                 Kevin Sim",
  series =       "LNCS",
  volume =       "8599",
  publisher =    "Springer",
  pages =        "198--209",
  address =      "Granada, Spain",
  month =        "23-25 " # apr,
  organisation = "EvoStar",
  keywords =     "genetic algorithms, genetic programming :poster",
  isbn13 =       "978-3-662-44302-6",
  DOI =          "doi:10.1007/978-3-662-44303-3_17",
  abstract =     "This paper proposes a novel asynchronous
                 reference-based evaluation (named as ARE) for an
                 asynchronous EA that evolves individuals independently
                 unlike general EAs that evolve all individuals at the
                 same time. ARE is designed for an asynchronous
                 evolution by tertiary parent selection and its archive.
                 In particular, ARE asynchronously evolves individuals
                 through a comparison with only three of individuals
                 (i.e., two parents and one reference individual as the
                 tertiary parent). In addition, ARE builds an archive of
                 good reference individuals. This differ from
                 synchronous evolution in EAs in which selection
                 involves comparison with all population members. In
                 this paper, we investigate the effectiveness of ARE, by
                 applying it to some standard problems used in Linear GP
                 that aim being to minimise the execution step of
                 machine-code programs. We compare GP using ARE (ARE-GP)
                 with steady state (synchronous) GP (SSGP) and our
                 previous asynchronous GP (Tierra-based Asynchronous GP:
                 TAGP). The experimental results have revealed that
                 ARE-GP not only asynchronously evolves the machine-code
                 programs, but also outperforms SSGP and TAGP in all
                 test problems.",
  notes =        "Part of \cite{Nicolau:2014:GP} EuroGP'2014 held in
                 conjunction with EvoCOP2014, EvoBIO2014, EvoMusArt2014
                 and EvoApplications2014",

Genetic Programming entries for Tomohiro Harada Keiki Takadama