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 Concept Videos

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving01:29

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

Mechanistic models play a crucial role in algorithms for numerical problem-solving, particularly in nonlinear mixed effects modeling (NMEM). These models aim to minimize specific objective functions by evaluating various parameter estimates, leading to the development of systematic algorithms. In some cases, linearization techniques approximate the model using linear equations.
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Evolutionary Relationships through Genome Comparisons02:54

Evolutionary Relationships through Genome Comparisons

Genome comparison is one of the excellent ways to interpret the evolutionary relationships between organisms. The basic principle of genome comparison is that if two species share a common feature, it is likely encoded by the DNA sequence conserved between both species. The advent of genome sequencing technologies in the late 20th century enabled scientists to understand the concept of conservation of domains between species and helped them to deduce evolutionary relationships across diverse...

You might also read

Related Articles

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

Sort by
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

Related Experiment Video

Updated: Jun 9, 2026

High-Throughput Metabolic Profiling for Model Refinements of Microalgae
11:07

High-Throughput Metabolic Profiling for Model Refinements of Microalgae

Published on: December 4, 2021

Modeling the performance of evolutionary algorithms on the root identification problem: a case study with PBIL and

Enrique Yeguas1, Robert Joan-Arinyo, Mar A Victoria Luz N

  • 1Departamento de Informática y Análisis Numérico, Universidad de Córdoba, Córdoba, 14071, Spain. eyeguas@uco.es

Evolutionary Computation
|September 3, 2010
PubMed
Summary

A new statistical model measures evolutionary algorithm performance for complex problems. This model predicts solution quality based on runtime or estimates iterations needed for a desired solution quality, aiding computational research.

More Related Videos

Spatial Multiobjective Optimization of Agricultural Conservation Practices using a SWAT Model and an Evolutionary Algorithm
11:53

Spatial Multiobjective Optimization of Agricultural Conservation Practices using a SWAT Model and an Evolutionary Algorithm

Published on: December 9, 2012

Heuristic Mining of Hierarchical Genotypes and Accessory Genome Loci in Bacterial Populations
08:03

Heuristic Mining of Hierarchical Genotypes and Accessory Genome Loci in Bacterial Populations

Published on: December 7, 2021

Related Experiment Videos

Last Updated: Jun 9, 2026

High-Throughput Metabolic Profiling for Model Refinements of Microalgae
11:07

High-Throughput Metabolic Profiling for Model Refinements of Microalgae

Published on: December 4, 2021

Spatial Multiobjective Optimization of Agricultural Conservation Practices using a SWAT Model and an Evolutionary Algorithm
11:53

Spatial Multiobjective Optimization of Agricultural Conservation Practices using a SWAT Model and an Evolutionary Algorithm

Published on: December 9, 2012

Heuristic Mining of Hierarchical Genotypes and Accessory Genome Loci in Bacterial Populations
08:03

Heuristic Mining of Hierarchical Genotypes and Accessory Genome Loci in Bacterial Populations

Published on: December 7, 2021

Area of Science:

  • Computer Science
  • Computational Mathematics

Background:

  • Measuring evolutionary algorithm performance is crucial for computationally intensive problems.
  • A performance model can predict solution quality versus runtime or estimate iterations for a target quality.

Purpose of the Study:

  • To develop a statistical model for evaluating PBIL and CHC evolutionary algorithms.
  • To apply this model to the root identification problem in constraint-based modeling.

Main Methods:

  • Developed a statistical performance model.
  • Empirically validated the model using a benchmark with large search spaces.
  • Focused on Population-Based Incremental Learning (PBIL) and CHC algorithms.

Main Results:

  • The statistical model accurately describes the performance of PBIL and CHC algorithms.
  • The model's predictions were validated on extensive benchmarks.
  • Demonstrated the model's utility for the root identification problem.

Conclusions:

  • The developed statistical model provides a reliable method for assessing evolutionary algorithm performance.
  • This model is valuable for problems requiring high computational resources, such as root identification.
  • Empirical validation confirms the model's effectiveness across large search spaces.