An analysis of Gray versus binary encoding in genetic search

Authors:
Uday K. Chakraborty;Cezary Z. Janikow
Affiliations:
Department of Mathematics and Computer Science, University of Missouri, 8001 Natural Bridge Road, St. Louis, MO;Department of Mathematics and Computer Science, University of Missouri, 8001 Natural Bridge Road, St. Louis, MO
Venue:
Information Sciences: an International Journal - Special issue: Evolutionary computation
Year:
2003

Citing 11
Cited 4

A connectionist machine for genetic hillclimbing

A connectionist machine for genetic hillclimbing
Finite Markov chain analysis of genetic algorithms

Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application
A study of control parameters affecting online performance of genetic algorithms for function optimization

Proceedings of the third international conference on Genetic algorithms
Finite Markov chain results in evolutionary computation: a tour d'horizon

Fundamenta Informaticae
Practical genetic algorithms

Practical genetic algorithms
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
A Markov Chain Analysis on A Genetic Algorithm

Proceedings of the 5th International Conference on Genetic Algorithms
Global Convergence of Genetic Algorithms: A Markov Chain Analysis

PPSN I Proceedings of the 1st Workshop on Parallel Problem Solving from Nature
An analysis of the behavior of a class of genetic adaptive systems.

An analysis of the behavior of a class of genetic adaptive systems.
Analysis of selection algorithms: A markov chain approach

Evolutionary Computation
No free lunch theorems for optimization

IEEE Transactions on Evolutionary Computation

A binary encoding supporting both mutation and recombination

PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
Gray coding in evolutionary multicriteria optimization: application in frame structural optimum design

EMO'05 Proceedings of the Third international conference on Evolutionary Multi-Criterion Optimization
Evolutionary computation and its applications in neural and fuzzy systems

Applied Computational Intelligence and Soft Computing
ReactGA --- the search space transformation for the local optimum escaping

HAIS'12 Proceedings of the 7th international conference on Hybrid Artificial Intelligent Systems - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper employs a Markov model to study the relative performance of binary and Gray coding in genetic algorithms. The results indicate that while there is not much difference between the two for all possible functions, Gray coding does not necessarily improve performance for functions which have fewer local optima in the Gray representation than in binary.