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

Efficient genetic algorithms using discretization scheduling.

Laura A McLay1, David E Goldberg

  • 1Department of Mechanical and Industrial Engineering, University of Illinois, Urbana, Illinois 61801, USA. lalbert@uiuc.edu

Evolutionary Computation
|September 15, 2005
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

Determining minimum staffing levels during snowstorms using an integrated simulation, regression, and reliability model.

Health care management science·2012
Same author

Using simulation-optimization to construct screening strategies for cervical cancer.

Health care management science·2010
Same author

Evaluating emergency medical service performance measures.

Health care management science·2010
Same author

Dependency structure matrix, genetic algorithms, and effective recombination.

Evolutionary computation·2009
Same author

The crowding approach to niching in genetic algorithms.

Evolutionary computation·2008
Same author

Generalization in the XCSF classifier system: analysis, improvement, and extension.

Evolutionary computation·2007
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

Discretization scheduling optimizes genetic algorithm (GA) speed and accuracy by adjusting numerical methods. This approach reduces computation time for desired solution quality, outperforming constant discretization methods.

Area of Science:

  • Computational Science
  • Numerical Analysis
  • Optimization Algorithms

Background:

  • Genetic algorithms (GAs) often face a speed-accuracy tradeoff in fitness evaluations due to numerical methods.
  • Discretization errors in quadrature methods impact the cost and accuracy of function evaluations.

Purpose of the Study:

  • To investigate discretization scheduling for optimizing GA performance.
  • To determine how varying discretization within a GA impacts computation time and solution quality.

Main Methods:

  • Examined discretization scheduling strategies within genetic algorithms.
  • Incorporated population sizing, function evaluation time estimation, and convergence time analysis.
  • Conducted experiments in idealized one- and two-dimensional settings and a groundwater application.

Related Experiment Videos

Main Results:

  • Discretization scheduling demonstrated significant computational savings compared to constant discretization.
  • The effectiveness was validated through comparative analysis of computation times.
  • Successful application in an inverse groundwater problem showcased practical benefits.

Conclusions:

  • Discretization scheduling is an effective technique for enhancing GA efficiency.
  • This method allows for achieving desired solution quality with reduced computational resources.
  • The findings are applicable to various fields employing GAs with numerical fitness evaluations.