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

Network random keys - a tree representation scheme for genetic and evolutionary algorithms.

Franz Rothlauf1, David E Goldberg, Armin Heinzl

  • 1Department of Information Systems, University of Bayreuth, Universitätsstr. 30, D-95440 Bayreuth, Germany. rothlauf@uni-bayreuth.de

Evolutionary Computation
|March 26, 2002
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

Anonymization of Electronic Health Records by the Use of Dimensionality Reduction Techniques.

Studies in health technology and informatics·2026
Same author

Using Machine Learning for the Fusion of Tumor Records on a Real-World Dataset.

Studies in health technology and informatics·2025
Same author

Evaluating robustly standardized explainable anomaly detection of implausible variables in cancer data.

Journal of the American Medical Informatics Association : JAMIA·2025
Same author

Mobile stroke units services in Germany: A cost-effectiveness modeling perspective on catchment zones, operating modes, and staffing.

European journal of neurology·2024
Same author

Comparison of Imputation Methods for Categorical Real-World Prostate Cancer Data with Natural Order.

Studies in health technology and informatics·2024
Same author

On Entity Embeddings for Ordinal Features as Representation Learning in Recurrence Prediction of Urothelial Bladder Cancer.

Studies in health technology and informatics·2024
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

Network random keys (NetKeys) offer an improved genotype representation for genetic algorithms in network design. This method enhances performance, especially for complex tree encoding problems, outperforming traditional characteristic vectors.

Area of Science:

  • Computational Intelligence
  • Network Design
  • Evolutionary Computation

Background:

  • Genetic algorithms (GAs) are widely used for network design, with genotype representation significantly impacting performance.
  • The characteristic vector is a common but problematic representation for encoding trees, often leading to invalid individuals.
  • Existing methods struggle to differentiate link importance when repairing invalid tree structures.

Purpose of the Study:

  • To investigate the efficacy of network random keys (NetKeys) as a genotype representation for encoding trees in genetic algorithms.
  • To compare the performance of simple genetic algorithms (SGAs) using NetKeys against those using characteristic vectors for network design problems.

Main Methods:

  • Implementation of a simple genetic algorithm (SGA) utilizing network random keys (NetKeys) for tree encoding.

Related Experiment Videos

  • Evaluation of NetKeys performance on both a one-max tree problem and a real-world network design problem.
  • Comparative analysis against the traditional characteristic vector representation, considering factors like stealth mutation.

    • Main Results:

    • Selectorecombinative SGAs with NetKeys show advantages in small, simple optimization problems.
    • For complex network design problems, SGAs employing NetKeys significantly outperform those using characteristic vectors.
    • NetKeys enable genetic algorithms to solve complex tree encoding problems more efficiently than characteristic vectors.

    Conclusions:

    • Network random keys provide a viable and effective method for encoding trees in genetic algorithms.
    • The NetKeys representation facilitates faster and more successful solutions for complex tree-based optimization problems.
    • Researchers and practitioners should consider adopting NetKeys for tree representation in genetic algorithm-based network design.