General cardinality genetic algorithms

Authors:
Gary J. Koehler;Siddhartha Bhattacharyya;Michael D. Vose
Affiliations:
Decision and Information Sciences Warrington College of Business Administration, 351 BUS University of Florida Gainesville, FL 32611 koehler@ufl.edu;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;Computer Science Department The University of Tennessee 107 Ayres Hall Knoxville, TN 37996-1301 vose@cs.utk.edu
Venue:
Evolutionary Computation
Year:
1997

Citing 10
Cited 10

Toward an extrapolation of the simulated annealing convergence theory onto the simple genetic algorithm144438

Toward an extrapolation of the simulated annealing convergence theory onto the simple genetic algorithm144438
The Simple Genetic Algorithm: Foundations and Theory

The Simple Genetic Algorithm: Foundations and Theory
A New Interpretation of Schema Notation that Overtums the Binary Encoding Constraint

Proceedings of the 3rd International Conference on Genetic Algorithms
A Markov Chain Analysis on A Genetic Algorithm

Proceedings of the 5th International Conference on Genetic Algorithms
Epistasis in Genetic Algorithms: An Experimental Design Perspective

Proceedings of the 6th International Conference on Genetic Algorithms
Some experiments in machine learning using vector evaluated genetic algorithms (artificial intelligence, optimization, adaptation, pattern recognition)

Some experiments in machine learning using vector evaluated genetic algorithms (artificial intelligence, optimization, adaptation, pattern recognition)
The genetic algorithm fractal

Evolutionary Computation
Simple genetic algorithms with linear fitness

Evolutionary Computation
Modeling simple genetic algorithms

Evolutionary Computation
Logarithmic convergence of random heuristic search

Evolutionary Computation

Theory of genetic algorithms II: models for genetic operators over the string-tensor representation of populations and convergence to global optima for arbitrary fitness function under scaling

Theoretical Computer Science
Form Invariance and Implicit Parallelism

Evolutionary Computation
Structural Search Spaces and Genetic Operators

Evolutionary Computation
Extended probe method for linkage discovery over high-cardinality alphabets

Proceedings of the 9th annual conference on Genetic and evolutionary computation
Covariant Genetic Dynamics

Evolutionary Computation
The simple genetic algorithm and the walsh transform: Part i, theory

Evolutionary Computation
Detecting the epistatic structure of generalized embedded landscape

Genetic Programming and Evolvable Machines
Implicit parallelism

GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartII
Natural coding: a more efficient representation for evolutionary learning

GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI
Stopping criteria for genetic algorithms with application to multiobjective optimization

PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I

Quantified Score

Hi-index	0.00

Visualization

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.