A comparison of selection, recombination, and mutation parameter importance over a set of fifteen optimization tasks

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

@InProceedings{DBLP:conf/gecco/BanksAMO09,
  author =       "Edwin Roger Banks and Paul Agarwal and 
                 Marshall McBride and Claudette Owens",
  title =        "A comparison of selection, recombination, and mutation
                 parameter importance over a set of fifteen optimization
                 tasks",
  booktitle =    "GECCO-2009 Late-Breaking Papers",
  year =         "2009",
  editor =       "Anna I. Esparcia and Ying-ping Chen and 
                 Gabriela Ochoa and Ender Ozcan and Marc Schoenauer and Anne Auger and 
                 Hans-Georg Beyer and Nikolaus Hansen and 
                 Steffen Finck and Raymond Ros and Darrell Whitley and 
                 Garnett Wilson and Simon Harding and W. B. Langdon and 
                 Man Leung Wong and Laurence D. Merkle and Frank W. Moore and 
                 Sevan G. Ficici and William Rand and Rick Riolo and 
                 Nawwaf Kharma and William R. Buckley and Julian Miller and 
                 Kenneth Stanley and Jaume Bacardit and Will Browne and 
                 Jan Drugowitsch and Nicola Beume and Mike Preuss and 
                 Stephen L. Smith and Stefano Cagnoni and Jim DeLeo and 
                 Alexandru Floares and Aaron Baughman and 
                 Steven Gustafson and Maarten Keijzer and Arthur Kordon and 
                 Clare Bates Congdon and Laurence D. Merkle and 
                 Frank W. Moore",
  pages =        "1971--1976",
  address =      "Montreal",
  publisher =    "ACM",
  publisher_address = "New York, NY, USA",
  month =        "8-12 " # jul,
  organisation = "SigEvo",
  keywords =     "genetic algorithms, genetic programming",
  isbn13 =       "978-1-60558-325-9",
  bibsource =    "DBLP, http://dblp.uni-trier.de",
  DOI =          "doi:10.1145/1570256.1570261",
  abstract =     "How does one choose an initial set of parameters for
                 an evolutionary computing algorithm? Clearly some
                 choices are dictated by the problem itself, such as the
                 encoding of a problem solution, or how much time is
                 available for running the evolution. Others, however,
                 are frequently found by trial-and-error. These may
                 include population sizes, number of populations, type
                 of selection, recombination and mutation rates, and a
                 variety of other parameters. Sometimes these parameters
                 are allowed to co-evolve along with the solutions
                 rather than by trial-and-error. But in both cases, an
                 initial setting is needed for each parameter.

                 When there are hundreds of parameters to be adjusted,
                 as in some evolutionary computation tools, one would
                 like to just spend time adjusting those that are
                 believed to be most important, or sensitive, and leave
                 the rest to start with an initial default value. Thus
                 the primary goal of this paper is to establish the
                 relative importance of each parameter. Establishing
                 general guidance to assist in the determination of
                 these initial default values is another primary goal of
                 this paper. We propose to develop this guidance by
                 studying the solutions resulting from variations around
                 the default starting parameters applied across fifteen
                 different application types.",
  notes =        "Distributed on CD-ROM at GECCO-2009.

                 ACM Order Number 910092.",
}

Genetic Programming entries for Edwin Roger Banks Paul Agarwal Marshall McBride Claudette Owens

Citations