Advertisement

The evolution of hierarchical representations

  • Franz Oppacher
  • Dwight Deugo
2. Origins of Life and Evolution
Part of the Lecture Notes in Computer Science book series (LNCS, volume 929)

Abstract

In the areas of Genetic Algorithms and Artificial Life, genetic material is often represented by fixed-length chromosomes. The simplification of a fixed size, sequential sequence of genes is in accord with the ‘principle of meaningful building blocks’. The principle suggests that epistatically related genes should be positioned close to one another. However, in situations in which gene dependency information cannot be determined a priori, a Genetic Algorithm that uses static list-structured chromosomes will often not work. The problem of determining gene dependencies is itself a search problem, and seems well suited for the application of a Genetic Algorithm. In this paper, we propose a Genetic Algorithm that evolves a hierarchical representation in which gene dependencies and values of a chromosome coevolve.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Ackley, D.H., An Empirical Study of Bit Vector Function Optimization. In Lawrence Davis (Ed.), Genetic Algorithms and Simulated Annealing, Morgan Kaufmann, 170–204, 1987.Google Scholar
  2. 2.
    Calloway, D.L., Using a Genetic Algorithm to Design Binary Phase-Only Filters for Pattern Recognition, Proceedings of the fourth International Conference on Genetic Algorithms, Morgan Kaufmann, 422–427, 1991.Google Scholar
  3. 3.
    Deugo, D.L. & Oppacher, F., Explicitly Schema-Based Genetic Algorithms. Proceedings of the Ninth Biennial Conference of the Canadian Society for Computational Studies of Intelligence, Morgan Kaufmann, 46–53, 1992.Google Scholar
  4. 4.
    Gabbert, P.S., Brown, D.E., Huntley, C.L., Markowicz, B.P., and Sappington, D.E., A System for Learning Routes and Schedules with Genetic Algorithms, Proceedings of the fourth International Conference on Genetic Algorithms, Morgan Kaufmann, 430–436, 1991.Google Scholar
  5. 5.
    Goldberg, D.E., Genetic Algorithms in Search, Optimization, and Machine Learning, Addison-Wesley, 1989.Google Scholar
  6. 6.
    Grefenstette, J.J., A System for Learning Control Strategies with Genetic Algorithms, Proceedings of the third International Conference on Genetic Algorithms, Morgan Kaufmann, 183–190, 1989.Google Scholar
  7. 7.
    Knuth, D.E., The Art of Computer Programming: Fundamental Algorithms. V:1, Addison-Wesley Publishing Company, 391, 1973.Google Scholar
  8. 8.
    Nakano, R., Conventional Genetic Algorithm for Job Shop Problem, Proceedings of the fourth International Conference on Genetic Algorithms, Morgan Kaufmann, 474–479, 1991.Google Scholar
  9. 9.
    Rizki, M.M. & Conrad, M., Computing The Theory of Evolution, Physica D, 22, 83–89, 1986.Google Scholar
  10. 10.
    Simon, Herbert, A., The Organization of Complex Systems, In H.H. Pattee (Ed.) Hierarchy Theory, 7, 1973.Google Scholar
  11. 11.
    Syswerda, G., Uniform Crossover in Genetic Algorithms, Proceedings of the Third International Conference on Genetic Algorithms, Morgan Kaufmann, 2–9, 1989.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Franz Oppacher
    • 1
  • Dwight Deugo
    • 1
  1. 1.Intelligent Systems Group, School of Computer ScienceCarleton UniversityOttawaCanada

Personalised recommendations