Locality, Distance Distortion,and Binary Representations of Integers

This paper investigates how the performance of evolutionary search is inuenced by thelocality and distance distortion of the used representation. The locality of a representationdescribes how well neighboring phenotypes correspond to neighboring genotypes. The distancedistortion measures whether the distances between individuals are preserved when mapping thephenotypes onto the genotypes. When using mutation as the main search operator, perfectlocality ensures that the difficulty of the problem is not changed by the representation. Inanalogy, representations that preserve the distances between individuals guarantee that thedifficulty of the problem remains unchanged for crossover-based search.[...]

MoreLess

Year of publication:	2003-07-20
Authors:	Rothlauf, Franz
Institutions:	Betriebswirtschaftliches Institut <Mannheim> ; Universität <Mainz> / Lehrstuhl für Wirtschaftsinformatik und BWL
Subject:	Lokalität <Informatik> \| Repräsentation \| Streuung \| price dispersion

1 Introduction
2 Representations for Evolutionary Algorithms
2.1 Genotype-Phenotype Mappings and Phenotype-Fitness Mappings
2.2 Properties of Representations
3 Binary Representations of Integers
3.1 Integer Optimization Problems
3.2 Binary Encoding
3.3 Gray Encoding
4 Experiments
4.1 Mutation-Based Search Using Simulated Annealing
4.2 Crossover-Based Search Using Genetic Algorithms
5 Conclusions
References

Persistent link: https://ebvufind01.dmz1.zbw.eu/10005868154