Skip to main content
SpringerLink
Log in

Evolution on Neutral Networks in Genetic Programming

  • Chapter
Genetic Programming Theory and Practice III

Part of the book series: Genetic Programming ((GPEM,volume 9))

Abstract

We examine the behavior of an evolutionary search on neutral networks in a simple linear genetic programming system of a Boolean function space problem. To this end we draw parallels between notions in RNA-folding problems and in Genetic Programming, observe parameters of neutral networks and discuss the population dynamics via the occupation probability of network nodes in runs on their way to the optimal solution.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover 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

  • Altenberg, Lee (1994a). Emergent phenomena in genetic programming. In Sebald, Anthony V. and Fogel, Lawrence J., editors, Evolutionary Programming — Proceedings of the Third Annual Conference, pages 233–241, San Diego, CA, USA. World Scientific Publishing.

    Google Scholar 

  • Altenberg, Lee (1994b). The evolution of evolvability in genetic programming. In Kinnear, Jr., Kenneth E., editor, Advances in Genetic Programming, chapter 3, pages 47–74. MIT Press.

    Google Scholar 

  • Angeline, Peter John (1994). Genetic programming and emergent intelligence. In Kinnear, Jr., Kenneth E., editor, Advances in Genetic Programming, chapter 4, pages 75–98. MIT Press.

    Google Scholar 

  • Babajide, A., Hofacker, I.L., Sippl, M.J., and Stadler, P.F. (1997). Neutral networks in protein space. Fold. Des., 2:261–269.

    Article  Google Scholar 

  • Banzhaf, W. and Langdon, W. B. (2002). Some considerations on the reason for bloat. Genetic Programming and Evolvable Machines, 3(1):81–91.

    Article  Google Scholar 

  • Banzhaf, W., Nordin, P., Keller, R., and Franconce, F. (1998). Genetic Programming-An Introduction. Morgan Kaufmann, San Francisco, CA.

    Google Scholar 

  • Banzhaf, Wolfgang (1994). Genotype-phenotype-mapping and neutral variation — A case study in genetic programming. In Davidor, Yuval, Schwefel, Hans-Paul, and Männer, Reinhard, editors, Parallel Problem Solving from Nature III, volume 866 of LNCS, pages 322–332, Jerusalem. Springer-Verlag.

    Google Scholar 

  • Barnett, Lionel (2001). Netcrawling-optimal evolutionary search with neutral networks. In Proceedings of the 2001 Congress on Evolutionary Computation, 2001, pages 30–37. IEEE Press.

    Google Scholar 

  • Brameier, Markus and Banzhaf, Wolfgang (2001). A comparison of linear genetic programming and neural networks in medical data mining. IEEE Transactions on Evolutionary Computation, 5(1):17–26.

    Article  Google Scholar 

  • Ebner, M., Shackleton, M., and Shipman, R. (2002). How neutral networks influence evolvability. Complexity, 7:19–33.

    Article  MathSciNet  Google Scholar 

  • Forst, C.V., Reidys, C, and Weber, J. (1995). Evolutionary dynamics and optimization: Neutral networks as model-landscapes for rna secondary-structure folding-landscapes. In Advances in Artificial Life, Proc ECAL 1995. Springer-Verlag, LNAI Vol 929.

    Google Scholar 

  • Gruener, W., Giegerich, R., Strothmann, D., Reidys, C.M., Weber, J., Hofacker, I.L., Stadler, P.F., and Schuster, P. (1996). Analysis of dna sequence structure maps by exhaustive enumeration-part i: Neutral networks. Monatsh. hemie, 127:355–377.

    Article  Google Scholar 

  • Huynen, M., Stadler, P.F., and Fontana, W. (1996). Smoothness within ruggedness: The role of neutrality in adaptation. Proc. Natl. Acad. Sci. USA, 93:397–401.

    Article  Google Scholar 

  • Kimura, Motoo (1983). The Neutral Theory of Molecular Evolution. Cambridge University Press.

    Google Scholar 

  • Kirschner, M. and Gerhart, J. (1998). Evolvability. Proc. Natl. Acad. Science (USA), 95:8420–8427.

    Article  Google Scholar 

  • Koza, John R. (1992). Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge, MA, USA.

    Google Scholar 

  • Langdon, W. B. and Poli, R. (1998). Fitness causes bloat: Mutation. In Banzhaf, Wolfgang, Poli, Riccardo, Schoenauer, Marc, and Fogarty, Terence C, editors, Proceedings of the First European Workshop on Genetic Programming, volume 1391 of LNCS, pages 37–48, Paris. Springer-Verlag.

    Google Scholar 

  • Langdon, W. B. and Poli, R. (1999). Boolean functions fitness spaces. In Poli, Riccardo, Nordin, Peter, Langdon, William B., and Fogarty, Terence C, editors, Genetic Programming, Proceedings of EuroGP’99, volume 1598 of LNCS, pages 1–14, Goteborg, Sweden. Springer-Verlag.

    Google Scholar 

  • Langdon, William B. and Banzhaf, Wolfgang (2005). Repeated sequences in linear genetic programming genomes. Complex Systems. in press.

    Google Scholar 

  • Lovacz, L. (1993). Random walks on graphs: A survey. Technical report, Department of Computer Science, Yale University, CT, USA.

    Google Scholar 

  • Nimwegen, E.v., Crutchfield, J.P., and Huynen, M. (1998). Neutral evolution of mutational robustness. Proc. Natl. Acad. Sci. USA, 96:9716–9720.

    Article  Google Scholar 

  • Noh, J.D. and Rieger, H. (2004). Random walks on complex networks. Phys. Rev. Lett., 92:118701-1–3.

    Article  Google Scholar 

  • Nordin, Peter and Banzhaf, Wolfgang (1995). Complexity compression and evolution. In Eshelman, L., editor, Genetic Algorithms: Proceedings of the Sixth International Conference (ICGA95), pages 310–317, Pittsburgh, PA, USA. Morgan Kaufmann.

    Google Scholar 

  • Reidys, C.M., Stadler, P.F., and Schuster, P. (1997). Generic properties of combinatory maps-neutral networks of rna secondary structures. Bull. Math. Biol, 59:339–397.

    Article  Google Scholar 

  • Schultes, E.A. and Bartel, D.P. (2000). One sequence, two ribozymes: Implications for the emergence of new ribozyme folds. Science, 289:448–452.

    Article  Google Scholar 

  • Schuster, P., Fontana, W., Stadler, P.F., and Hofacker, I.L. (1994). From sequences to shapes and back: A case study in rna secondary structures. Proc. Roy. Soc. Lond. B, 255:279–284.

    Google Scholar 

  • Schuster, Peter (1995). Extended molecular evolutionary biology: Articial life bridging the gap between chemistry and biology. In Langton, C.G., editor, Artificial Life: An Overview, pages 39–60. MIT Press, Cambridge, MA.

    Google Scholar 

  • Soule, Terence, Foster, James A., and Dickinson, John (1996). Code growth in genetic programming. In Koza, John R., Goldberg, David E., Fogel, David B., and Riolo, Rick L., editors, Genetic Programming 1996: Proceedings of the First Annual Conference, pages 215–223, Stanford University, CA, USA. MIT Press.

    Google Scholar 

  • Soule, Terence and Heckendorn, Robert B. (2002). An analysis of the causes of code growth in genetic programming. Genetic Programming and Evolvable Machines, 3(3):283–309.

    Article  Google Scholar 

  • Stephens, C. R. and Vargas, J. Mora (2000). Effective fitness as an alternative paradigm for evolutionary computation I: General formalism. Genetic Programming and Evolvable Machines, 1(4):363–378.

    Article  Google Scholar 

  • T. Smith, Ph. Husbands and O’Shea, M. (2001). Neutral networks in an evolutionary robotics search space. In Proceedings of the 2001 Congress on Evolutionary Computation, 2001, pages 136–145. IEEE Press.

    Google Scholar 

  • Vassilev, Vesselin K., Fogarty, Terence C, and Miller, Julian F. (2003). Smoothness, ruggedness and neutrality of fitness landscapes: from theory to application. In Ghosh, Ashish and Tsutsui, Shigeyoshi, editors, Advances in evolutionary computing: theory and applications, pages 3–44. Springer-Verlag New York, Inc.

    Google Scholar 

  • Vassilev, Vesselin K. and Miller, Julian F. (2000a). The advantages of landscape neutrality in digital circuit evolution. In Proceedings of the Third International Conference on Evolvable Systems, pages 252–263. Springer-Verlag.

    Google Scholar 

  • Vassilev, Vesselin K. and Miller, Julian F. (2000b). Embedding landscape neutrality to build a bridge from the conventional to a more efficient three-bit multiplier circuit. In Whitley, Darrell, Goldberg, David, Cantu-Paz, Erick, Spector, Lee, Parmee, Ian, and Beyer, Hans-Georg, editors, Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2000), page 539, Las Vegas, Nevada, USA. Morgan Kaufmann.

    Google Scholar 

  • Wagner, G.P. and Altenberg, L. (1996). Complex adaptations and the evolution of evolvability. Evolution, 50:967–976.

    Article  Google Scholar 

  • Yu, Tina and Miller, Julian (2001). Neutrality and the evolvability of boolean function landscape. In Miller, Julian F., Tomassini, Marco, Lanzi, Pier Luca, Ryan, Conor, Tettamanzi, Andrea G. B., and Langdon, William B., editors, Genetic Programming, Proceedings of EuroGP’2001, volume 2038 of LNCS, pages 204–217, Lake Como, Italy. Springer-Verlag.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Memorial University of Newfoundland, St. John’s, NL, A1B 3X5, Canada

    Wolfgang Banzhaf & Andre Leier

Authors
  1. Wolfgang Banzhaf
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andre Leier
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Chevron Information Technology Company, USA

    Tina Yu

  2. Center for the Study of Complex Systems, University of Michigan, USA

    Rick Riolo

  3. Genetics Squared, Inc., USA

    Bill Worzel

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer Science+Business Media, Inc.

About this chapter

Cite this chapter

Banzhaf, W., Leier, A. (2006). Evolution on Neutral Networks in Genetic Programming. In: Yu, T., Riolo, R., Worzel, B. (eds) Genetic Programming Theory and Practice III. Genetic Programming, vol 9. Springer, Boston, MA. https://doi.org/10.1007/0-387-28111-8_14

Download citation

  • DOI: https://doi.org/10.1007/0-387-28111-8_14

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-0-387-28110-0

  • Online ISBN: 978-0-387-28111-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation