The Genetic Algorithm Fractal

被引：14

作者：

Juliany, Jenny ^{[1
]}

Vose, Michael D. ^{[1
]}

机构：

[1] Univ Tennessee, Dept Comp Sci, Knoxville, TN 37996 USA

来源：

EVOLUTIONARY COMPUTATION | 1994年 / 2卷 / 02期

基金：

美国国家科学基金会;

关键词：

genetic algorithms; fractal; dynamical system; schema;

D O I：

10.1162/evco.1994.2.2.165

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

The original schema theorem (an inequality) has been replaced by an equality that determines the expected next generation for a simple genetic algorithm. This has made possible the computation of the trajectory of expected next generations. Visualization of these evolutionary trajectories beginning from different initial populations has led to the discovery of fractal structures.

引用

页码：165 / 180

页数：16

共 11 条

[1]

Barnsley M. F., 1993, FRACTALS EVERYWHERE, Vsecond

[2]

Bridges C., 1987, P 2 INT C GEN ALG TH

[3]

Goldberg DE, 1987, GENETIC ALGORITHMS S, P74

[4]

Holland J. H, 1992, MIT PRESS

[5]

Loomis L. H., 1968, ADV CALCULUS

[6]

Nix A. E., 1992, Annals of Mathematics and Artificial Intelligence, V5, P79, DOI 10.1007/BF01530781

[7]

Vose M. D., 1991, Complex Systems, V5, P31

[8]

Vose M. D., SIMPLE GENE IN PRESS

[9]

Vose M. D., 1992, CS92148 U TENN

[10]

Vose M. D., EVOLUTIONAR IN PRESS

← 1 2 →