General Cardinality Genetic Algorithms

被引：29

作者：

Koehler, Gary J. ^{[1
]}

Bhattacharyya, Siddhartha ^{[2
]}

Vose, Michael D. ^{[3
]}

机构：

[1] Univ Florida, Warrington Coll Business Adm, Gainesville, FL 32611 USA

[2] Univ Illinois, Coll Business Adm, Chicago, IL 60607 USA

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

来源：

EVOLUTIONARY COMPUTATION | 1997年 / 5卷 / 04期

关键词：

Genetic algorithms; general cardinality; Markov chain; Fourier transform;

D O I：

10.1162/evco.1997.5.4.439

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

A complete generalization of the Vose genetic algorithm model from the binary to higher cardinality case is provided. Boolean AND and EXCLUSIVE-OR operators are replaced by multiplication and addition over rings of integers. Walsh matrices are generalized with finite Fourier transforms for higher cardinality usage. Comparison of results to the binary case are provided.

引用

页码：439 / 459

页数：21

共 21 条

[11]

SHAFFER JD, 1984, THESIS VANDERBILT U

[12]

SPEARS WM, 1997, FDN GENETIC ALGORITH, V4, P85

[13]

SUZUKI J, 1993, PROCEEDINGS OF THE FIFTH INTERNATIONAL CONFERENCE ON GENETIC ALGORITHMS, P146

[14]

VOSE M, 1997, EVOLUTIONARY COMPUTA, V4, P395

[15]

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

[16]

Vose M. D., SIMPLE GENE IN PRESS

[17]

VOSE MD, 1993, FDN GENETIC ALGORITH, V2, P63

[18]

VOSE MD, 1990, P IEEE WORKSH GEN AL

[19]

VOSE MD, 1995, FDN GENETIC ALGORITH, V3, P103

[20] Modeling Simple Genetic Algorithms [J].

Vose, Michael D. .

EVOLUTIONARY COMPUTATION, 1995, 3 (04) :453-472

← 1 2 3 →