More Information
Quarterly (spring, summer, fall, winter)
176 pp. per issue
7 x 10
ISSN
1063-6560
E-ISSN
1530-9304
2014 Impact factor:
2.37
List of All Issues » Issue TOC

Evolutionary Computation

Winter 1997, Vol. 5, No. 4, Pages 439-459
(doi: 10.1162/evco.1997.5.4.439)
© 1997 by the Massachusetts Institute of Technology
General Cardinality Genetic Algorithms
Article PDF (891.46 KB)
Gary J. Koehler
Decision and Information Sciences Warrington College of Business Administration, 351 BUS University of Florida Gainesville, FL 32611 koehler@ufl.edu
Siddhartha Bhattacharyya
Information and Decision Sciences College of Business Administration University of Illinois at Chicago 601 South Morgan Street (M/C 294) Chicago, IL 60607 sidb@uic.edu
Michael D. Vose
Computer Science Department The University of Tennessee 107 Ayres Hall Knoxville, TN 37996-1301 vose@cs.utk.edu
Abstract

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.