skip to main content
article

Developing a generic genetic algorithm

Published:08 December 2002Publication History
Skip Abstract Section

Abstract

Genetic and evolutionary algorithms, inspired by biological processes, provide a technique for programs to "automatically" improve their parameters. We discuss the basics of the algorithms and introduce our own hybrid. The development of this hybrid and its application to a simplified problem, evolving the coefficients for the sine function in a Taylor series, presents opportunities for computer science education with respect to model-building, data structures, and language features. Students must decide upon the representation of the chief mechanisms of genetic algorithms: mutation to alter the values of parameters directly and crossover to vary the groupings of co-evolved parameters in order to break away from local fitness maxima. They must examine the meaning of fitness itself as well as make many other modeling decisions. Ada itself provides both challenges and advantages: linked-lists must be well understood to be updated in an object-oriented context and hard-typing produces mixed reactions in students used to C++, but generics provide a powerful way to generalize the algorithm and incorporating different problem domains.

References

  1. Barnes, J. Programming in Ada95. Addison-Wesley, 1998, 2nd ed. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Dwight, H.B. Tables of Integrals and Other Mathematical Data. Macmillan, New York, 1957 (3rd ed).Google ScholarGoogle Scholar
  3. Fausett, L. Fundamentals of Neural Networks. Prentice-Hall, 1994. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Hines, J.W. Matlab Supplement to Fuzzy and Neural Approaches in Engineering. Wiley, 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Michalewicz, Z. Genetic Algorithms + Data Structures = Evolution Programs. Springer-Verlag, Berlin, Heidelberg, New York, 1996 (3rd ed). Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Neville, M., and Gray, L. Modeling the evolution of behavioral learning circuitry: Aplysia stage, CONIELECOMP 2001 (International Conference on Electronics and Computers), (Cholula, Mexico 2001).Google ScholarGoogle Scholar
  7. Sipper, M. On the origin of environments by means of natural selection. AI Magazine, 22(2001): 133--140. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Tsoukalas, L. , and Uhrig, R. Fuzzy and Neural Approaches in Engineering. Wiley, 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Developing a generic genetic algorithm

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in

        Full Access

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader
        About Cookies On This Site

        We use cookies to ensure that we give you the best experience on our website.

        Learn more

        Got it!