- 1 Introduction
- 2 Redundant Representations
- 2.1 Redundant Representations and Neutral Networks in Evolutionary Computation
- 2.2 Synonymously and Non-Synonymously Redundant Representations
- 3 Population Sizing and Time to Convergence for SynonymouslyRedundant Representations
- 3.1 Characteristics of Redundant Representations
- 3.2 Population Sizing
- 3.3 Run Duration
- 3.4 Overall Problem Complexity
- 4 Trivial Voting Mapping for Binary Encoded Problems
- 4.1 The Trivial Voting Mapping
- 4.2 Experiments and Empirical Results
- 5 Link-biased Encoding for Encoding Trees
- 5.1 Functionality of the Link-biased Encoding
- 5.2 Redundancy of the Link-biased Encoding
- 5.3 Population Sizing Model for the One-Max Tree Problem
- 5.4 Population Sizing for the Link-Biased Encoding
- 6 Future Research
- 7 Conclusions
- References
Persistent link: https://www.econbiz.de/10005868351