Abstract
This paper investigates how the use of the trivial voting (TV) mapping influences the performance of genetic algorithms (GAs). The TV mapping is a redundant representation for binary phenotypes. A population sizing model is presented that quantitatively predicts the influence of the TV mapping and variants of this encoding on the performance of GAs. The results indicate that when using this encoding GA performance depends on the influence of the representation on the initial supply of building blocks. Therefore, GA performance remains unchanged if the TV mapping is uniformly redundant that means on average a phenotype is represented by the same number of genotypes. If the optimal solution is overrepresented, GA performance increases, whereas it decreases if the optimal solution is underrepresented. The results show that redundant representations like the TV mapping do not increase GA performance in general. Higher performance can only be achieved if there is specific knowledge about the structure of the optimal solution that can beneficially be used by the redundant representation.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Ackley, D. H. (1987). A connectionist machine for genetic hill climbing. Boston: Kluwer Academic.
Banzhaf, W. (1994). Genotype-phenotype-mapping and neutral variation — A case study in genetic programming. In Davidor, Y., Schwefel, H.-P., & Männer, R. (Eds.), Parallel Problem Solving from Nature-PPSN III (pp. 322–332). Berlin: Springer.
Barnett, L. (1997). Tangled webs: Evolutionary dynamics on fitness landscapes with neutrality. Master’s thesis, School of Cognitive Sciences, University of East Sussex, Brighton.
Dasgupta, D. (1995). Incorporating redundancy and gene activation mechanisms in genetic search for adapting to non-stationary environments. In Chambers, L. (Ed.), Practical Handbook of Genetic Algorithms (Chapter 13, pp. 303–316). CRC Press.
Deb, K., & Goldberg, D.E. (1993). Analyzing deception in trap functions. In Whitley, L.D. (Ed.), Foundations of Genetic Algorithms 2 (pp. 93–108). San Mateo, CA: Morgan Kaufmann.
Ebner, M., Langguth, P., Albert, J., Shackleton, M., & Shipman, R. (2001, 27–30 May). On neutral networks and evolvability. In Proceedings of the 2001 Congress on Evolutionary Computation CEC2001 (pp. 1–8). COEX, World Trade Center, 159 Samseong-dong, Gangnam-gu, Seoul, Korea: IEEE Press.
Harik, G., Cantú-Paz, E., Goldberg, D.E., & Miller, B.L. (1999). The gambler’s ruin problem, genetic algorithms, and the sizing of populations. Evolutionary Computation, 7(3), 231–253.
Knowles, J.D., & Watson, R.A. (2002). On the utility of redundant encodings in mutation-based evolutionary search. In Merelo, J.J., Adamidis, P., Beyer, H.-G., Fernandez-Villacanas, J.-L., & Schwefel, H.-P. (Eds.), Parallel Problem Solving from Nature, PPSN VII (pp. 88–98). Berlin: Springer-Verlag.
Rothlauf, F. (2002). Representations for genetic and evolutionary algorithms. Studies on Soft Computing and Fuzziness. Berlin: Springer Verlag.
Shackleton, M., Shipman, R., & Ebner, M. (2000, 6–9 July). An investigation of redundant genotype-phenotype mappings and their role in evolutionary search. In Proceedings of the 2000 Congress on Evolutionary Computation CEC00 (pp. 493–500). La Jolla Marriott Hotel La Jolla, California, USA: IEEE Press.
Shipman, R. (1999). Genetic redundancy: Desirable or problematic for evolutionary adaptation? In Proceedings of the 4th International Conference on Artificial Neural Networks and Genetic Algorithms (ICANNGA) (pp. 1–11). Springer Verlag.
Shipman, R., Shackleton, M., & Harvey, L. (2000). The use of neutral genotype-phenotype mappings for improved evoutionary search. British Telecom Technology Journal, 18(4), 103–111.
Smith, T., Husbands, P., & M., O. (2001). Neutral networks and evolvability with complex genotype-phenotype mapping. In Proceedings of the European Converence on Artificial Life: ECAL2001 (pp. 272–281).
Toussaint, M., & Igel, C. (2002). Neutrality: A necessity for self-adaptation. In Fogel, D.B., El-Sharkawi, M.A., Yao, X., Greenwood, G., Iba, H., Marrow, P., & Shackleton, M. (Eds.), Proceedings of the 2002 Congress on Evolutionary Computation CEC2002 (pp. 1354–1359). IEEE Press.
Yu, T., & Miller, J. (2001). Neutrality and evolvability of Boolean function landscapes. In Proceedings of the 4th European Conference on Genetic Programming (EuroGP), Volume LNCS 2038 (pp. 204–217). Springer.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rothlauf, F. (2003). Population Sizing for the Redundant Trivial Voting Mapping. In: Cantú-Paz, E., et al. Genetic and Evolutionary Computation — GECCO 2003. GECCO 2003. Lecture Notes in Computer Science, vol 2724. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45110-2_6
Download citation
DOI: https://doi.org/10.1007/3-540-45110-2_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40603-7
Online ISBN: 978-3-540-45110-5
eBook Packages: Springer Book Archive