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

Initialization strategies and diversity in evolutionary timetabling.

E K Burke1, J P Newall, R F Weare

  • 1Department of Computer Science, University of Nottingham, UK. ekb@cs.nott.ac.uk

Evolutionary Computation
|February 18, 1999
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 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

Heuristic initialization improves evolutionary timetabling algorithms by enhancing initial population quality. However, maintaining genetic diversity is crucial to avoid premature convergence and ensure optimal final solutions in timetabling problems.

Area of Science:

  • Computer Science
  • Artificial Intelligence
  • Optimization

Background:

  • Evolutionary algorithms (EAs) are widely used for complex optimization problems like timetabling.
  • Initialization strategies significantly impact EA performance, affecting convergence speed and solution quality.
  • Heuristic seeding aims to improve the initial population for EAs, but its effect on diversity needs careful consideration.

Purpose of the Study:

  • To establish a scientific framework for comparing initialization algorithms in evolutionary timetabling.
  • To investigate the trade-off between initial population quality and genetic diversity introduced by heuristic seeding.
  • To assess the long-term performance impact of heuristic initialization on evolutionary timetabling.

Main Methods:

  • Evaluating heuristic seeding methods by measuring population quality and diversity.

Related Experiment Videos

  • Testing initialization strategies on both random and real-world timetabling datasets.
  • Analyzing the long-term performance of a successful evolutionary algorithm with heuristic initialization.

    • Main Results:

    • Heuristic initialization can substantially improve the initial quality of populations for evolutionary timetabling.
    • A balance between quality and diversity in the initial population is essential for optimal evolutionary algorithm performance.
    • The choice of initialization strategy directly influences the final solution quality in timetabling problems.

    Conclusions:

    • Heuristic initialization strategies offer a significant advantage for evolutionary timetabling.
    • Careful consideration of genetic diversity alongside initial quality is key for effective evolutionary timetabling.
    • This study provides a basis for selecting superior initialization methods for evolutionary timetabling applications.