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 条

[1] [Anonymous], 1991, Handbook of genetic algorithms
[2] ANTONISSE J, 1989, PROCEEDINGS OF THE THIRD INTERNATIONAL CONFERENCE ON GENETIC ALGORITHMS, P86
[3] Aytug H., 1996, ORSA J COMPUTING, V8, P183
[4] Bhattacharyya S., 1994, Complex Systems, V8, P227
[5] Davis T. E., 1991, THESIS U FLORIDA GAI
[6] DeJong K.A., 1995, FDN GENETIC ALGORITH, V3, P115, DOI DOI 10.1016/B978-1-55860-356-1.50011-X
[7] The Genetic Algorithm Fractal
Juliany, Jenny
Vose, Michael D.
[J]. EVOLUTIONARY COMPUTATION, 1994, 2 (02) : 165 - 180
[8] Koehler G. J., 1994, Annals of Mathematics and Artificial Intelligence, V10, P409, DOI 10.1007/BF01531278
[9] Nix A. E., 1992, Annals of Mathematics and Artificial Intelligence, V5, P79, DOI 10.1007/BF01530781
[10] Reeves C., 1995, FDN GENETIC ALGORITH, P85

← 1 2 3 →