Variable size population for dynamic optimization with genetic programming

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

@InProceedings{DBLP:conf/gecco/VanneschiC09,
  author =       "Leonardo Vanneschi and Giuseppe Cuccu",
  title =        "Variable size population for dynamic optimization with
                 genetic programming",
  booktitle =    "GECCO '09: Proceedings of the 11th Annual conference
                 on Genetic and evolutionary computation",
  year =         "2009",
  editor =       "Guenther Raidl and Franz Rothlauf and 
                 Giovanni Squillero and Rolf Drechsler and Thomas Stuetzle and 
                 Mauro Birattari and Clare Bates Congdon and 
                 Martin Middendorf and Christian Blum and Carlos Cotta and 
                 Peter Bosman and Joern Grahl and Joshua Knowles and 
                 David Corne and Hans-Georg Beyer and Ken Stanley and 
                 Julian F. Miller and Jano {van Hemert} and 
                 Tom Lenaerts and Marc Ebner and Jaume Bacardit and 
                 Michael O'Neill and Massimiliano {Di Penta} and Benjamin Doerr and 
                 Thomas Jansen and Riccardo Poli and Enrique Alba",
  pages =        "1895--1896",
  address =      "Montreal",
  publisher =    "ACM",
  publisher_address = "New York, NY, USA",
  month =        "8-12 " # jul,
  organisation = "SigEvo",
  keywords =     "genetic algorithms, genetic programming, Poster",
  isbn13 =       "978-1-60558-325-9",
  bibsource =    "DBLP, http://dblp.uni-trier.de",
  DOI =          "doi:10.1145/1569901.1570222",
  abstract =     "A new model of Genetic Programming with variable size
                 population is presented in this paper and applied to
                 the reconstruction of target functions in dynamic
                 environments (i.e. problems where target functions
                 change with time). The suitability of this model is
                 tested on a set of benchmarks based on some well known
                 symbolic regression problems. Experimental results
                 confirm that our variable size population model finds
                 solutions of the same quality as the ones found by
                 standard Genetic Programming, but with a smaller amount
                 of computational effort.",
  notes =        "GECCO-2009 A joint meeting of the eighteenth
                 international conference on genetic algorithms
                 (ICGA-2009) and the fourteenth annual genetic
                 programming conference (GP-2009).

                 ACM Order Number 910092.",
}

Genetic Programming entries for Leonardo Vanneschi Giuseppe Cuccu

Citations