Dynamic Optimization using Evolutionary Algorithms with a Case-based Memory

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

  author =       "J. Eggermont and T. Lenaerts",
  title =        "Dynamic Optimization using Evolutionary Algorithms
                 with a Case-based Memory",
  booktitle =    "Proceedings of the 14th Belgium/Netherlands Conference
                 on Artificial Intelligence (BNAIC'02)",
  year =         "2002",
  editor =       "Hendrik Blockeel and Marc Denecker",
  address =      "Leuven, Belgium",
  month =        "21-22 " # oct,
  organisation = "BNVKI, Dutch and the Belgian AI Association",
  keywords =     "genetic algorithms, genetic programming, evolutionary
  URL =          "http://www.liacs.nl/~jeggermo/publications/bnaic02-dynamic.ps.gz",
  size =         "8 pages",
  abstract =     "Dynamic environments form a dicult class of problems
                 for evolutionary algorithms to solve. In this paper we
                 propose a new evolutionary algorithm for this class in
                 which we combine a case-based memory with a
  notes =        "http://www.cs.kuleuven.ac.be/conference/bnaic02/

                 Katholieke Universiteit Leuven and Universite Libre de
                 Bruxelles in collaboration with PharmaDM and under the
                 auspices of BNVKI/AIABN (the Belgian-Dutch Association
                 for Artificial Intelligence), SIKS (School for
                 Information and Knowledge Systems), and SNN (the
                 Foundation for Neural Networks).",

Genetic Programming entries for Jeroen Eggermont Tom Lenaerts