Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Experiment Videos

General cardinality genetic algorithms

Koehler1, Bhattacharyya, Vose

  • 1Warrington College of Business Administration, University of Florida, Gainesville 32611, USA. koehler@ufl.edu

Evolutionary Computation
|January 1, 1997
PubMed
Summary

This study generalizes the Vose genetic algorithm to higher cardinality cases, replacing Boolean operators with arithmetic operations. Results demonstrate a viable extension of this evolutionary computation model.

Related Concept Videos

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Radioactive iodine for hyperthyroidism: patient satisfaction survey.

Clinical endocrinology·2017
Same author

Microscopic evidence of gonorrhea; the importance of grief for diagnosis.

Medizinische Klinik·2010
Same author

Metabolic Study of Isoproturon in Goats Following a Single Oral Administration: Toxicokinetics and Recovery.

Journal of agricultural and food chemistry·2001
Same author

Analysis of the effects of the continuous electrode paste band on precordial leads of the electrocardiogram.

Arquivos brasileiros de cardiologia·2001
Same author

Power law mass dependence of diffusion: A mode coupling theory analysis

Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics·2000
Same author

Entry distribution, fission barrier, and formation mechanism of 254102No

Physical review letters·2000

Area of Science:

  • Computer Science
  • Artificial Intelligence
  • Evolutionary Computation

Background:

  • The Vose genetic algorithm is a foundational model in evolutionary computation, traditionally limited to binary representations.
  • Extending genetic algorithm models to higher cardinality alphabets is crucial for broader applicability in complex problem-solving.

Purpose of the Study:

  • To provide a comprehensive generalization of the Vose genetic algorithm from binary to higher cardinality settings.
  • To adapt core genetic algorithm operators for non-binary domains.

Main Methods:

  • Replaced binary Boolean AND and EXCLUSIVE-OR operators with multiplication and addition over rings of integers.
  • Generalized Walsh matrices using finite Fourier transforms to accommodate higher cardinality inputs.
  • Empirically compared the performance and characteristics of the generalized model against the original binary Vose model.

Main Results:

  • Successfully adapted the Vose model for higher cardinality alphabets, demonstrating its theoretical and practical extension.
  • The use of arithmetic operations over integer rings proved effective in mimicking Boolean logic for genetic operations.
  • Finite Fourier transforms provided a robust method for generalizing Walsh matrices in this new context.

Conclusions:

  • The generalized Vose genetic algorithm offers a powerful extension for evolutionary computation beyond binary constraints.
  • This work opens avenues for applying genetic algorithms to a wider range of combinatorial optimization and machine learning problems.

Related Experiment Videos