Skip to main content

Evolving Genotype to Phenotype Mappings with a Multiple-Chromosome Genetic Algorithm

  • Conference paper
Genetic and Evolutionary Computation – GECCO 2004 (GECCO 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3102))

Included in the following conference series:

Abstract

This paper presents an evolutionary coding method that maps genotype to phenotype in a genetic algorithm. Unlike traditional genetic algorithms, the proposed algorithm involves mating and reproduction of cells that have multiple chromosomes instead of single chromosomes. The algorithm also evolves the mapping from genotype to phenotype rather than using a fixed mapping that is associated with one particular encoding method. The genotype-to-phenotype mapping is conjectured to explicitly capture important schema information. Some empirical results are presented to demonstrate the efficacy of the algorithm with some GA-Hard problems.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Whitley, L.D.: Fundamental principles of deception in genetic search. In: Rawlins, G. (ed.) Foundations of Genetic Algorithms, pp. 221–241. Morgan Kaufmann, San Mateo (1991)

    Google Scholar 

  2. Goldberg, D.: Genetic Algorithms and Walsh Functions: Part II, Deception and its Analysis. Complex Systems 3, 153–171 (1989)

    MATH  MathSciNet  Google Scholar 

  3. Holland, J.H.: Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor (1975)

    Google Scholar 

  4. Mathias, K., Whitley, L.D.: Transforming the search space with gray coding. In: Proc. IEEE Int’l Conference on Evolutionary Computation, pp. 513–518 (1994)

    Google Scholar 

  5. Yokose, Y., Cingoski, V., Kaneda, K., Yamashita, H.: Performance Comparison Between Gray Coded and Binary Coded Genetic Algorithms for Inverse Shape Optimization of Magnetic Devices. Applied Electromagnetics, 115–120 (2000)

    Google Scholar 

  6. Wolfram, Gray Code, http://mathworld.wolfram.com/GrayCode.html

  7. Goldberg, D.: Genetic Algorithms and Walsh Functions: Part I, A Gentle Introduction. Complex Systems 3, 129–152 (1989)

    MATH  MathSciNet  Google Scholar 

  8. Goldberg, D., Bridges, C.: An Analysis of a Reordering Operator on a GA-Hard Problem. Biological Cybernetics 62, 397–405 (1990)

    Article  MATH  Google Scholar 

  9. Dasgupta, D.: Handling deceptive problems using a different genetic search. In: Proceedings of the First IEEE Conference on Evolutionary Computation, pp. 807–811 (1994)

    Google Scholar 

  10. Shackleton, M., Shipman, R., Ebner, M.: An investigation of redundant genotypephenotype mappings and their role in evolutionary search. In: Proceedings of Congress on Evolutionary Computation, pp. 493–500 (2000)

    Google Scholar 

  11. Whitley, D., Rana, S., Heckendorn, R.B.: Exploiting Separability in Search: The Island Model Genetic Algorithm. Journal of Computing and Information Technology 7(1), 33–47 (1999); Special Issue on Evolutionary Computing

    Google Scholar 

  12. Sehitoglu, O.T., Ucoluk, G.: A building block favoring reordering method for gene positions in genetic algorithms. In: Spector, L., Goodman, E.D., Wu, A., et al. (eds.) Proceedings of the Genetic and Evolutionary Computation Conference, pp. 571–575 (2001)

    Google Scholar 

  13. De Jong, K.A.: An Analysis of the Behavior of a Class of Genetic Adaptive Systems, Ph.D. Thesis, University of Michigan (1975)

    Google Scholar 

  14. Digalakis, J., Konstantinos, M.: An Experimental study of Benchmarking Functions for Evolutionary Algorithms. International Journal of Computer Mathemathics 79, 403–416 (2002)

    Article  MATH  Google Scholar 

  15. Salomon, R.: Reevaluating Genetic Algorithm Performance under Coordinate Rotation of Benchmark Functions. BioSystems 39, 263–278 (1995)

    Article  Google Scholar 

  16. Collard, P., Aurand, J.-P.: DGA: an efficient Genetic Algorithm. In: Proceedings of the 11th European Conference on Artificial Intelligence (ECAI 1994), pp. 487–492 (1994)

    Google Scholar 

  17. Collard, P., Clergue, M., Defoin, P.M.: Artificial Evolution. In: Fonlupt, C., Hao, J.-K., Lutton, E., Schoenauer, M., Ronald, E. (eds.) AE 1999. LNCS, vol. 1829, pp. 254–265. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chow, R. (2004). Evolving Genotype to Phenotype Mappings with a Multiple-Chromosome Genetic Algorithm. In: Deb, K. (eds) Genetic and Evolutionary Computation – GECCO 2004. GECCO 2004. Lecture Notes in Computer Science, vol 3102. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24854-5_100

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24854-5_100

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22344-3

  • Online ISBN: 978-3-540-24854-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics