Abstract
This research demonstrates that evolutionary pressure favoring robust solutions has a significant impact on the evolutionary process. More robust solutions are solutions that are less likely to be degraded by the genetic operators. This pressure for robust solutions can be used to explain a number of evolutionary behaviors. The experiments examine the effect of different types and rates of genetic operators on the evolution of robust solutions. Previously robustness was observed to occur through an increase in inoperative genes (introns). This work shows that alternative strategies to increase robustness can evolve. The results also show that different genetic operators lead to different strategies for improving robustness. These results can be useful in designing genetic operators to encourage particular evolutionary behaviors.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Blickle, T. and Thiele, L. (1994). Genetic programming and redundancy. In Genetic Algorithms within the Framework of Evolutionary Computation (Workshop at KI-94, Saarbrücken), Hopf, J. (Ed. ), pp. 33–38, Im Stadtwald, Building 44, D-66123 Saarbrücken, Germany. Max-Planck- Institut für Informatik (MPI-I-94–241).
Igel C. and Chellapilla K. (1999). Investigating the Influence of Depth and Degree of Genotypic Change on Fitness. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 1999), pp 1061–1068, Orlando, Florida. Morgan Kaufmann.
Koza, John (1992). Genetic Programming: On the Programming of Computers by Natural Selection. MIT Press, Cambridge, MA, USA.
Langdon, W. B. (1997). Fitness causes bloat: Simulated annealing, hill climbing and populations. Technical Report CSRP-97–22, The University of Birmingham, Birmingham, UK.
Langdon, W. B. (1999). Size fair and homologous tree genetic programming crossovers. In Proceedings of the Genetic and Evolutionary Computation Conference 1999, Banzhaf, W. et al (Eds. ), pp. 1092–1097. Morgan Kaufmann.
Langdon, W. B., Soule, T., Poli, R. and Foster, J. A. (1999). The evolution of size and shape. In Advances in Genetic Programming III, Spector, L. et al. (Eds. ), pp. 163–190. Cambridge, MA: The MIT Press.
Luke, S. (2000c). Code growth is not caused by introns. In Late Breaking Papers, Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2000), pp. 228–235.
McPhee, N. F. and Miller, J. D. (1995). Accurate replication in genetic programming. In Proceedings of the Sixth International Conference on Genetic Algorithms, Eshelman, L. J. (Ed. ), pp. 303–309. Morgan Kaufmann.
Nordin, P. (1997). Evolutionary Program Induction of Binary Machine Code and its Application. Muenster: Krehl Verlag.
Nordin, P. and Banzhaf, W. (1995). Complexity compression and evolution. In Proceedings of the Sixth International Conference on Genetic Algorithms, Eshelman, L. J. (Ed. ), pp. 310–317. San Francisco, CA: Morgan Kaufmann.
Nordin, P., Banzhaf, W. and Francone, F. D. (1997). Introns in nature and in simulated structure evolution. In Proceedings Bio-Computing and Emergent Computation, Lundh, D., Olsson, B., and Narayanan, A. (Eds. ), pp. 22–35. Springer.
Poli, R. and Langdon, W. B. (1997). A new schema theory for genetic programming with one-point crossover and mutation. In Genetic Programming 1997: Proceedings of the Second Annual Conference, J. Koza et al. (Eds. ), pp 278–285. San Francisco, CA: Morgan Kaufmann.
Rosea, J. P. and Ballard, D. H. (1996a). Complexity drift in evolutionary computation with tree representations. Technical Report NRL5, University of Rochester, Computer Science Department, Rochester, NY, USA.
Smith, P. and Harries, K. (1998). Code growth, explicitly defined introns, and alternative selection schemes. Evolutionary Computation 6(4): 339–360.
Soule, T. (1998). Code Growth in Genetic Programming. PhD thesis, University of Idaho, University of Idaho.
Soule, T. (2002). Exons and code growth in genetic programming. In Genetic Programming, 5th European Conference, EuroGP 2002, J. Foster et al (Eds. ), pp. 142–151.
Soule, T. and Foster, J. A. (1997). Code size and depth flows in genetic programming. In Genetic Programming 1997: Proceedings of the Second Annual Conference, J. Koza et al. (Eds. ), pp. 313–320. San Francisco, CA: Morgan Kaufmann.
Soule T. and Foster J. A. (1998). Removal Bias: a New Cause of Code Growth in Tree Based Evolutionary Programming. In IEEE International Conference on Evolutionary Computation, pp. 178–186, Anchorage, Alaska, IEEE Press.
Soule, T. and Heckendorn, R. B. (2002). An analysis of the causes of code growth in genetic programming. Genetic Programming and Evolvable Machines 3(3): 283–309.
Soule, T., Foster, J. A. and Dickinson, J. (1996). Code growth in genetic programming. In Genetic Programming 1996: Proceedings of the First Annual Conference, J. Koza et al. (Eds. ), pp. 215–223. Cambridge, MA: MIT Press.
Soule, T., Heckendorn, R. and Shen, J. (2002). Solution stability in evolutonary computation. In Proceedings of the 17th International Symposium on Computer and Information Systems, I. Cicekli et al (Eds. ), pp. 237–241.
Streeter, M. J. (2002). The root causes of code growth in genetic programming. In Genetic Programming, 6th European Conference, EuroGP 2003, C. Ryan et al (Eds. ), pp. 443–454.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer Science+Business Media New York
About this chapter
Cite this chapter
Soule, T. (2003). Operator Choice and the Evolution of Robust Solutions. In: Riolo, R., Worzel, B. (eds) Genetic Programming Theory and Practice. Genetic Programming Series, vol 6. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-8983-3_16
Download citation
DOI: https://doi.org/10.1007/978-1-4419-8983-3_16
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-4747-7
Online ISBN: 978-1-4419-8983-3
eBook Packages: Springer Book Archive