A binary encoding supporting both mutation and recombination

Authors:
Karsten Weicker
Affiliations:
HTWK Leipzig Applied University, Leipzig, Germany
Venue:
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
Year:
2010

Citing 6
Cited 1

Using multiple representations to improve inductive bias: gray and binary coding for genetic algorithms

Proceedings of the sixth international workshop on Machine learning
Zen and the Art of Genetic Algorithms

Proceedings of the 3rd International Conference on Genetic Algorithms
Binary Representations of Integers and the Performance of Selectorecombinative Genetic Algorithms

PPSN VII Proceedings of the 7th International Conference on Parallel Problem Solving from Nature
An analysis of Gray versus binary encoding in genetic search

Information Sciences: an International Journal - Special issue: Evolutionary computation
Representations for Genetic and Evolutionary Algorithms

Representations for Genetic and Evolutionary Algorithms
Representation, search and genetic algorithms

AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence

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

There has been a long debate on the "most important" operator when applying genetic algorithms. This is very closely related to the favorite binary encoding, namely standard binary or Gray. Rather than confronting both approaches, this article is motivated by the search for an encoding that supports both mutation and recombination. For this purpose an encoding scheme is proposed and evaluated both using metrics and experiments.