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

Properties of gray and binary representations.

Jonathan Rowe1, Darrell Whitley, Laura Barbulescu

  • 1Computer Science Department, University of Birmingham, Birmingham B15 2TT, UK. J.E.Rowe@cs.bham.ac.uk

Evolutionary Computation
|April 21, 2004
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

Engagement of adolescents with ADHD in a narrative-centered game-based behavior change environment to reduce alcohol use.

Frontiers in education·2025
Same author

Narrative Play-Promoting Adolescent Health With Interactive Games.

JAMA·2024
Same author

Supporting Adolescent Engagement with Artificial Intelligence-Driven Digital Health Behavior Change Interventions.

Journal of medical Internet research·2023
Same author

"What's Important to You, Max?": The Influence of Goals on Engagement in an Interactive Narrative for Adolescent Health Behavior Change.

Interactive storytelling : 14th International Conference on Interactive Digital Storytelling, ICIDS 2021, Tallinn, Estonia, December 7-10, 2021, Proceedings. Joint International Conference on Interactive Digital Storytelling (14th : 202...·2022
Same author

Models of Intervention: Helping Agents and Human Users Avoid Undesirable Outcomes.

Frontiers in artificial intelligence·2022
Same author

Titanium industrial residues surface modification towards its reuse as antimicrobial surfaces.

Environmental science and pollution research international·2021
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

This study explores Gray codes for optimization, proving their efficiency for steepest ascent bit climbers. Shifting Gray codes enhances performance in genetic and local search algorithms.

Area of Science:

  • Computer Science
  • Artificial Intelligence
  • Optimization Algorithms

Background:

  • Representations in optimization are encodings mapping search spaces to graph vertices.
  • Gray codes are a type of encoding frequently used with genetic algorithms and bit-climbing for parameter optimization.

Purpose of the Study:

  • To analyze Gray codes and their properties in optimization.
  • To introduce and analyze the 'shifting' mechanism for Gray code representations.
  • To provide new convergence proofs for bit-climbing algorithms using Gray codes.

Main Methods:

  • Formal definition of bit equivalent encodings and conservation of Walsh coefficients.
  • Review of Gray code properties and their application in optimization.
  • Development of new convergence proofs for steepest ascent bit climbers on unimodal functions.

Related Experiment Videos

  • Theoretical analysis of the shifting mechanism for Gray codes, including neighborhood exploration.

    • Main Results:

    • Bit equivalent encodings conserve Walsh coefficients.
    • Steepest ascent bit climbers using reflected Gray codes achieve linear convergence to the global optimum for specific unimodal functions.
    • Shifting Gray codes provides a mechanism to escape local optima.
    • New theoretical insights into Gray code neighborhoods accessible via shifting and their structural changes.
    • Demonstrated performance improvement of local search and genetic algorithms using the shifting mechanism.

    Conclusions:

    • Gray codes offer efficient representations for optimization problems.
    • The shifting mechanism significantly enhances the performance of search algorithms by enabling exploration of diverse neighborhoods.
    • This work deepens the theoretical understanding of Gray codes and their practical application in advanced optimization techniques.