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

On the design and analysis of competent selecto-recombinative GAs.

Steven van Dijk1, Dirk Thierens, Mark de Berg

  • 1Institute of Information and Computing Sciences, Utrecht University, P.O. Box 80.089, 3508 TB Utrecht, The Netherlands. steven@cs.uu.nl

Evolutionary Computation
|June 16, 2004
PubMed
Summary

This study enhances genetic algorithms (GAs) by analyzing theoretical models to create design rules for practical problems. These rules improve GA performance, as demonstrated by successful application to the map-labeling challenge.

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

A Clique-Based Separator for Intersection Graphs of Geodesic Disks in [Formula: see text].

Algorithmica·2025
Same author

A data management system for precision medicine.

PLOS digital health·2025
Same author

Parameterless Gene-Pool Optimal Mixing Evolutionary Algorithms.

Evolutionary computation·2023
Same author

A semi-supervised decision support system to facilitate antibiotic stewardship for urinary tract infections.

Computers in biology and medicine·2022
Same author

Computational comparison of common event-based differential splicing tools: practical considerations for laboratory researchers.

BMC bioinformatics·2021
Same author

Finding Pairwise Intersections Inside a Query Range.

Algorithmica·2019

Area of Science:

  • Computer Science
  • Artificial Intelligence
  • Computational Theory

Background:

  • Theoretical models like population-sizing and convergence models offer insights into genetic algorithm (GA) performance.
  • Understanding the assumptions of these models is crucial for optimizing GA effectiveness.

Purpose of the Study:

  • To analyze theoretical models of selecto-recombinative genetic algorithms (GAs).
  • To derive design rules for developing competent GAs for practical applications.
  • To validate these design rules using a case study.

Main Methods:

  • Examination of assumptions in population-sizing and convergence models for GAs.
  • Formulation of design rules based on theoretical insights.
  • Case study using the NP-hard map-labeling problem to test GA performance.

Related Experiment Videos

  • Comparison of theoretical model predictions with empirical GA performance.

    • Main Results:

    • The study identified conditions under which selecto-recombinative GAs perform effectively.
    • Derived design rules were formulated to enhance GA competence.
    • Experimental results for the map-labeling problem confirmed the accuracy of theoretical model predictions regarding GA scale-up behavior.

    Conclusions:

    • The developed design rules effectively guide the creation of competent selecto-recombinative GAs.
    • The findings support the practical applicability of theoretical models in GA design.
    • This research contributes to improving GA performance on complex, real-world problems.