Neutrality through Transcription & Translation in Genetic Algorithm Representation

Seamus Hill, Colm O'Riordan

Abstract

This paper examines the use of the biological concepts of transcription and translation, to introduce neutrality into the representation of a genetic algorithm (GA). The aim of the paper is to attempt to identify problem characteristics which may benefit from the inclusion of neutrality, through a basic adaptation of the concepts of transcription and translation, to create a genotype-phenotype map (GP-map) which introduces phenotypic variability. Neutrality can be viewed as a situation where a number of different genotypes represent the same phenotype. A modification of De Jong’s classic test suite was used to compare the performance of a simple generic algorithm (SGA) and a multi layered mapping genetic algorithm (MMGA), which incorporates the concepts of transcription and translation into its GP-map. The modified De Jong test suite was chosen as it is well understood and has been used in numerous comparisons over the years, thus allowing us to contrast the performance of the MMGA against other GA variations as well as attempting to identify problem characteristics in isolation. Initial results indicate that the neutrality introduced through the multi-layered mapping can prove beneficial for problems containing certain characteristics, in particular multidimensional, multimodal, continuous and deterministic.

References

  1. Ashlock, D., Schonfeld, J., and McNicholas, P. D. (2011). Translation tables: A genetic code in a evolutionary algorithm. In IEEE Congress on Evolutionary Computation, pages 2685-2692.
  2. De Jong, K. A. (1975). An analysis of the behavior of a class of genetic adaptive systems. PhD thesis, University of Michigan, Ann Arbor. Dissertation Abstracts International 36(10), 5140B; UMI 76-9381.
  3. Ebner, M., Shackleton, M., and Shipman, R. (2001). How neutral networks influence evolvability. Complex., 7(2):19-33.
  4. Eiben, A. E. and Smith, J. E. (2003). Introduction to Evolutionary Computing. Springer.
  5. Harvey, I. and Thompson, A. (1996). Through the labyrinth evolution finds a way: A silicon ridge. In Proceedings of the First International Conference on Evolvable Systems: From Biology to Hardware, volume 1259, pages 406-422. Springer Verlag.
  6. Hill, S. and O'Riordan, C. (2010). Solving fully deceptive problems in changing environments. In Artificial Intelligence Cognative Studies (AICS), pages 87-95.
  7. Hill, S. and O'Riordan, C. (2011). Examining the use of a non-trivial fixed genotype-phenotype mapping in genetic algorithms to induce phenotypic variability over deceptive uncertain landscapes. In Proceedings of the 2011 Congress of Evolutionary Computation (CEC 2011). New Orleans, USA.
  8. Holland, J. H. (1975). Adaptation in natural artificial systems. University of Michigan Press, Ann Arbor.
  9. Kimura, M. (1968). Evolutionary Rate at the Molecular Level. Nature, 217(1):624-626.
  10. Shackleton, M. A., Shipman, R., and Ebner, M. (2000). An investigation of redundant genotype-phenotype mappings and their role in evolutionary search. In Proceedings of the International Congress on Evolutionary Computation (CEC 2000), pages 493-500. IEEE Press.
  11. Shipman, R. (1999). Genetic Redundancy: Desirable or Problematic for Evolutionary Adaption. In Dobnikar, A., Steele, N., Pearson, D. W., and Albrecht, R. F., editors, Proceedings of the 4th international Conference on Artificial Neural Networks and Genetic Algorithms (ICANNGA 7899), pages 337-344, Berlin. Springer.
  12. Shipman, R., Shackleton, M., and Harvey, I. (2000). The use of neutral genotype-phenotype mappings for improved evolutionary search. BT Technology Journal, 18:103-111.
Download


Paper Citation


in Harvard Style

Hill S. and O'Riordan C. (2012). Neutrality through Transcription & Translation in Genetic Algorithm Representation . In Proceedings of the 4th International Joint Conference on Computational Intelligence - Volume 1: ECTA, (IJCCI 2012) ISBN 978-989-8565-33-4, pages 220-225. DOI: 10.5220/0004156702200225


in Bibtex Style

@conference{ecta12,
author={Seamus Hill and Colm O'Riordan},
title={Neutrality through Transcription & Translation in Genetic Algorithm Representation},
booktitle={Proceedings of the 4th International Joint Conference on Computational Intelligence - Volume 1: ECTA, (IJCCI 2012)},
year={2012},
pages={220-225},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004156702200225},
isbn={978-989-8565-33-4},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 4th International Joint Conference on Computational Intelligence - Volume 1: ECTA, (IJCCI 2012)
TI - Neutrality through Transcription & Translation in Genetic Algorithm Representation
SN - 978-989-8565-33-4
AU - Hill S.
AU - O'Riordan C.
PY - 2012
SP - 220
EP - 225
DO - 10.5220/0004156702200225