Improving the Performance of Evolutionary Optimization by Dynamically Scaling the Evolution Function
Created by W.Langdon from
gp-bibliography.bib Revision:1.8051
- @InProceedings{fukunaga:1995:dsef,
-
author = "Alex S. Fukunaga and Andrew B. Kahng",
-
title = "Improving the Performance of Evolutionary Optimization
by Dynamically Scaling the Evolution Function",
-
booktitle = "1995 IEEE Conference on Evolutionary Computation",
-
year = "1995",
-
volume = "1",
-
pages = "182--187",
-
address = "Perth, Australia",
-
publisher_address = "Piscataway, NJ, USA",
-
month = "29 " # nov # " - 1 " # dec,
-
publisher = "IEEE Press",
-
keywords = "genetic algorithms, genetic programming",
-
URL = "http://metahack.org/Fukunaga-Kahng-ICEC-1995.pdf",
-
URL = "http://citeseer.ist.psu.edu/fukunaga95improving.html",
-
size = "6 pages",
-
abstract = "Traditional evolutionary optimization algorithms
assume a static environment in which solutions are
evolved. Incremental evolution is an approach through
which a dynamic evaluation function is scaled over time
in order to improve the performance of evolutionary
optimization. In this paper, we present empirical
results that demonstrate the effectiveness of this
approach for genetic programming. Using two domains, a
two-agent pursuit-evasion game and the Tracker
trail-following task, we demonstrate that incremental
evolution is most successful when applied near the
beginning of an evolutionary run. We also show that
incremental evolution can be successful when the
intermediate evaluation functions are more difficult
than the target evaluation function, as well as they
are easier than the target function.",
-
notes = "ICEC-95 Editors not given by IEEE, Organisers David
Fogel and Chris deSilva.
",
- }
Genetic Programming entries for
Alex S Fukunaga
Andrew B Kahng
Citations