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

Building blocks, cohort genetic algorithms, and hyperplane-defined functions.

J H Holland1

  • 1The University of Michigan, Ann Arbor 48109, USA.

Evolutionary Computation
|December 29, 2000
PubMed
Summary
This summary is machine-generated.

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

[Phase-II-study with cis-diamminedichloroplatinum (II) in the treatment of advanced malignant lymphomas].

Schweizerische medizinische Wochenschrift·1980
Same author

Comparative study of cytosine arabinoside therapy alone and combined with thioguanine, mercaptopurine, or daunorubicin in acute myelocytic leukemia.

Cancer·1975
Same author

Conditions of the hand.

Occupational health; a journal for occupational health nurses·1975
Same author

The administrative responsibility in the senior college or university.

NLN publications·1968
Same author

Universal embedding spaces for automata.

Progress in brain research·1965
Same journal

Computing Optimal Populations for Binary Problems using Logic Minimization.

Evolutionary computation·2026
Same journal

Enhancing Generalization and Scalability for Multi-Objective Optimization with Population Pre-Training.

Evolutionary computation·2026
Same journal

XCS for Sequential Perceptual Aliasing in Multi-Step Decision Making.

Evolutionary computation·2026
Same journal

A dynamic multi-objective evolutionary algorithm using dual-space prediction and surrogate-based sampling.

Evolutionary computation·2026
Same journal

Adapting MOEA/D to CMA-ES for Dealing with Ill-conditioned Multiobjective Problems.

Evolutionary computation·2026
Same journal

Editorial of the Special Issue: Parallel Problem Solving from Nature PPSN 2024 Extended Versions of Best Paper Candidates.

Evolutionary computation·2026
See all related articles

New cohort genetic algorithms (cGA's) offer robust advantages for exploring search spaces and exploiting building blocks. This advancement is validated using novel hyperplane-defined functions (hdf's) for performance tracing.

Area of Science:

  • Computational intelligence
  • Algorithm design
  • Machine learning

Background:

  • Building blocks are fundamental to human understanding and computational processes.
  • Genetic algorithms are designed to leverage these building blocks for problem-solving.
  • Existing genetic algorithms can be limited in exploring complex search spaces.

Purpose of the Study:

  • To introduce a more robust class of genetic algorithms: cohort genetic algorithms (cGA's).
  • To develop a new, general class of test functions, hyperplane-defined functions (hdf's), for algorithm evaluation.
  • To demonstrate the advantages of cGA's in search space exploration and building block exploitation.

Main Methods:

  • Development of cohort genetic algorithms (cGA's) as an enhancement to traditional genetic algorithms.

Related Experiment Videos

  • Design of hyperplane-defined functions (hdf's) to serve as a benchmark for evaluating algorithm performance.
  • Utilizing hdf's to trace the origin of performance improvements and assess algorithm robustness.

    • Main Results:

    • Cohort genetic algorithms (cGA's) demonstrate substantial advantages in exploring search spaces.
    • cGA's effectively exploit pre-existing building blocks within the search space.
    • The newly designed hdf's allow for detailed performance analysis and are resistant to reverse engineering.

    Conclusions:

    • Cohort genetic algorithms (cGA's) represent a significant advancement in computational search.
    • The hyperplane-defined functions (hdf's) provide a valuable tool for rigorous algorithm testing and validation.
    • This research enhances the capability of genetic algorithms in complex problem-solving scenarios.