Skip to main content

No Coercion and No Prohibition, a Position Independent Encoding Scheme for Evolutionary Algorithms – The Chorus System

  • Conference paper
  • First Online:

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

Abstract

We describe a new encoding system, Chorus, for grammar based Evolutionary Algorithms. This scheme is coarsely based on the manner in nature in which genes produce proteins that regulate the metabolic pathways of the cell. The phenotype is the behaviour of the cells metabolism, which corresponds to the development of the computer program in our case. In this procedure, the actual protein encoded by a gene is the same regardless of the position of the gene within the genome.

We show that the Chorus system has a very convenient Regular Expression – type schema notation that can be used to describe the presence of various phenotypes or phenotypic traits. This schema notation is used to demonstrate that massive areas of neutrality can exist in the search landscape, and the system is also shown to be able to dispense with large areas of the search space that are unlikely to contain useful solutions.

Other factors are also responsible for the regulation of metabolism, our current model focuses on one of the major factors– the concentration of specific regulatory enzymes/proteins.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J.J. Freeman, “A Linear Representation for GP using Context Free Grammars” in Genetic Programming 1998: Proc. 3rd Annu. Conf., J.R. Koza, W. Banzhaf, K. Chellapilla, K. Deb, M. Dorigo, D.B. Fogel, M.H. Garzon, D.E. Goldberg, H. Iba, R.L. Riolo, Eds. Madison, Wisconsin: MIT Press, 1998, pp. 72–77.

    Google Scholar 

  2. H. Horner, A C++ class library for Genetic Programming: The Vienna University of Economics Genetic Programming Kernel. Release 1.0, Operating instruction. Vienna University of Economics, 1996.

    Google Scholar 

  3. R. Keller and W. Banzhaf, “GP using mutation, reproduction and genotype-phenotype mapping from linear binary genomes into linear LALR phenotypes” in Genetic Programming 1996: Proc. 1st Annu. Conf., J.R. Koza, D.E. Goldberg, D.B. Fogel, and R.L. Riolo, Eds. Stanford, CA: MIT Press 1996, pp. 116–122.

    Google Scholar 

  4. O’Neill M., Ryan C. Grammatical Evolution. IEEE Transactions on Evolutionary Computation. 2001.

    Google Scholar 

  5. N. Paterson and M. Livesey, “Evolving caching algorithms in C by GP” in Genetic Programming 1997: Proc. 2nd Annu. Conf., MIT Press, 1997, pp. 262–267. MIT Press.

    Google Scholar 

  6. C. Ryan, J.J. Collins and M. O’Neill, “Grammatical Evolution: Evolving Programs for an Arbitrary Language”, in EuroGP’98: Proc. of the First EuropeanWorkshop on Genetic Programming (Lecture Notes in Computer Science 1391), Paris, France: Springer 1998, pp. 83–95.

    Google Scholar 

  7. P. Whigham, “Grammatically-based Genetic Programming” in Proceedings of theWorkshop on GP: From Theory to Real-World Applications, Morgan Kaufmann, 1995, pp. 33–41.

    Google Scholar 

  8. J. Koza. “Genetic Programming”. MIT Press, 1992.

    Google Scholar 

  9. Goldberg D E, Korb B, Deb K. Messy genetic algorithms: motivation, analysis, and first results. Complex Syst. 3

    Google Scholar 

  10. Gruau, F. 1994. Neural Network synthesis using cellular encoding and the genetic algorithm. PhD Thesis from Centre d’etude nucham, P. 1995. Inductive bias and genetic programming. In First International Conference on Genetic Algorithms in Engineering Systems: Innovations and Applications, pages 461–466. UK:IEE.

    Google Scholar 

  11. Lewin B. Genes VII. Oxford University Press, 1999.

    Google Scholar 

  12. Wong, M. and Leung, K. 1995. Applying logic grammars to induce subfunctions in genetic prorgramming. In Proceedings of the 1995 IEEE conference on Evolutionary Computation, pages 737–740. USA:IEEE Press.

    Google Scholar 

  13. Zubay G. Biochemistry. Wm. C. Brown Publishers, 1993

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ryan, C., Azad, A., Sheahan, A., O’Neill, M. (2002). No Coercion and No Prohibition, a Position Independent Encoding Scheme for Evolutionary Algorithms – The Chorus System. In: Foster, J.A., Lutton, E., Miller, J., Ryan, C., Tettamanzi, A. (eds) Genetic Programming. EuroGP 2002. Lecture Notes in Computer Science, vol 2278. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45984-7_13

Download citation

  • DOI: https://doi.org/10.1007/3-540-45984-7_13

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43378-1

  • Online ISBN: 978-3-540-45984-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics