6533b822fe1ef96bd127ca71
RESEARCH PRODUCT
Design of Representations and Search Operators
Franz Rothlaufsubject
Theoretical computer sciencebusiness.industryComputer scienceEvolutionary algorithmLocal search (optimization)Genotype to phenotypebusinessRepresentation (mathematics)Travelling salesman problemdescription
Successful and efficient use of evolutionary algorithms depends on the choice of genotypes and the representation – that is, the mapping from genotype to phenotype – and on the choice of search operators that are applied to the genotypes. These choices cannot be made independently of each other. This chapter gives recommendations on the design of representations and corresponding search operators and discusses how to consider problem-specific knowledge. For most problems in the real world, similar solutions have similar fitness values. This fact can be exploited by evolutionary algorithms if they ensure that the representations and search operators used are defined in such a way that similarities between phenotypes correspond to similarities between genotypes. Furthermore, the performance of evolutionary algorithms can be increased by problem-specific knowledge. We discuss how properties of high-quality solutions can be exploited by biasing representations and search operators.
year | journal | country | edition | language |
---|---|---|---|---|
2015-01-01 |