Encoding scheme issues for open-ended artificial evolution

  • Nick Jakobi
Basic Concepts of Evolutionary Computation
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1141)


This paper examines the ways in which the encoding scheme that governs how phenotypes develop from genotypes may be used to improve the performance of open-ended artificial evolution for design. If an open-ended framework involving variable complexity genetic algorithms is adopted, then the vast majority of the evolutionary effort is spent exploring neutral flat areas of the search space. Domain-specific heuristics may be employed to reduce the time spent on searching these neutral areas, however, and the ways in which domain knowledge may be incorporated into the encoding scheme are examined. Experiments are reported in which different categories of scheme were tested against each other, and conclusions are offered as to the most promising type of encoding scheme for a viable open-ended artificial evolution.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    M. Eigen, J. McCaskill, and P. Schuster. Molecular quasi-species. Journal of Physical Chemistry, 92:6881–6891, 1988.CrossRefGoogle Scholar
  2. 2.
    P.J. Gage and I.M. Kroo. A role for genetic algorithms in a preliminary design environment. A.I.A.A., 1993.Google Scholar
  3. 3.
    P.J. Gage, I.M. Kroo, and I.P. Sobieski. A variable-complexity genetic algorithm for topological design. A.I.A.A., 33(11), 1995.Google Scholar
  4. 4.
    I. Harvey. Species adaptation genetic algorithms: the basis for a continuing saga. In F. J. Varela and P. Bourgine, editors, Toward a Practice of Autonomous Systems: Proceedings of the First European Conference on Artificial Life, pages 346–354, Cambridge, Massachusetts, 1992. M.I.T. Press / Bradford Books.Google Scholar
  5. 5.
    I. Harvey, P. Husbands, and D. Cliff. Seeing the light: Artificial evolution, real vision. In Proceedings of the Third International Conference on Simulation of Adaptive Behavior, 1994.Google Scholar
  6. 6.
    J. Koza. Genetic Programming: on the programming of computers by means of natural selection. MIT Press, Cambridge, Massachusetts, 1992.Google Scholar
  7. 7.
    Phil Husbands Malcolm McIlhagga and Robert Ives. A comparison of search techniques on a wing-box optimisation problem. In Proceedings of Parallel Problem Solving in Nature, Berlin, Germany, 1996. Springer-Verlag.Google Scholar
  8. 8.
    N.Jakobi. Facing the facts: Necessary requirements for the artificial evolution of complex behaviour. Cognitive Science Research Paper CSRP422, University of Sussex, 1996.Google Scholar
  9. 9.
    P. Schuster. Artificial life and molecular evolutionary biology. In Proceedings of the European Conference on Artificial Life, pages 3–19. Springer-Verlag, 1995.Google Scholar
  10. 10.
    D.W. Thompson. On Growth and Form. Cambride University Press, 1942.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Nick Jakobi
    • 1
  1. 1.School of Cognitive and Computing SciencesUniversity of SussexBrightonEngland

Personalised recommendations