A Hierarchy of Evolution Programs: An Experimental Study
- 1 March 1993
- journal article
- research article
- Published by MIT Press in Evolutionary Computation
- Vol. 1 (1) , 51-76
- https://doi.org/10.1162/evco.1993.1.1.51
Abstract
In this paper we present the concept of evolution programs and discuss a hierarchy of such programs for a particular problem. We argue that (for a particular problem) stronger evolution programs (in terms of the problem-specific knowledge incorporated in the system) should perform better than weaker ones. This hypothesis is based on a number of experiments and a simple intuition that problem-specific knowledge enhances an algorithm's performance; at the same time it narrows the applicability of an algorithm. Trade-offs between the effort of finding an effective representation for general-purpose evolution programs and the effort of developing more specialized systems are also discussed.This publication has 7 references indexed in Scilit:
- Dynamic Parameter Encoding for genetic algorithmsMachine Learning, 1992
- A modified genetic algorithm for optimal control problemsComputers & Mathematics with Applications, 1992
- Genetic algorithms for numerical optimizationStatistics and Computing, 1991
- A Nonstandard Genetic Algorithm for the Nonlinear Transportation ProblemINFORMS Journal on Computing, 1991
- A genetic algorithm for the linear transportation problemIEEE Transactions on Systems, Man, and Cybernetics, 1991
- Integer programming vs. expert systems: an experimental comparisonCommunications of the ACM, 1990
- Optimization of Control Parameters for Genetic AlgorithmsIEEE Transactions on Systems, Man, and Cybernetics, 1986