skip to main content

Title: Deceptiveness and genetic algorithm dynamics

We address deceptiveness, one of at least four reasons genetic algorithms can fail to converge to function optima. We construct fully deceptive functions and other functions of intermediate deceptiveness. For the fully deceptive functions of our construction, we generate linear transformations that induce changes of representation to render the functions fully easy. We further model genetic algorithm selection recombination as the interleaving of linear and quadratic operators. Spectral analysis of the underlying matrices allows us to draw preliminary conclusions about fixed points and their stability. We also obtain an explicit formula relating the nonuniform Walsh transform to the dynamics of genetic search. 21 refs.
Authors:
 [1] ;  [2]
  1. (Oak Ridge National Lab., TN (USA))
  2. (Tennessee Univ., Knoxville, TN (USA))
Publication Date:
OSTI Identifier:
6445602
Report Number(s):
CONF-9007175-1
ON: DE91000723; CNN: IRI-8917545
DOE Contract Number:
AC05-84OR21400
Resource Type:
Conference
Resource Relation:
Conference: Genetic algorithms theory workshop, Bloomington, IN (USA), 16-18 Jul 1990
Research Org:
Oak Ridge National Lab., TN (USA); Tennessee Univ., Knoxville, TN (USA)
Sponsoring Org:
DOE/ER; NSF
Country of Publication:
United States
Language:
English
Subject:
59 BASIC BIOLOGICAL SCIENCES; 99 GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE; GENETICS; ALGORITHMS; DYNAMICS; MATRICES; MUTATIONS; BIOLOGY; MATHEMATICAL LOGIC; MECHANICS 550400* -- Genetics; 990200 -- Mathematics & Computers