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.
- Barnes, J. Programming in Ada95. Addison-Wesley, 1998, 2nd ed. Google Scholar
Digital Library
- Dwight, H.B. Tables of Integrals and Other Mathematical Data. Macmillan, New York, 1957 (3rd ed).Google Scholar
- Fausett, L. Fundamentals of Neural Networks. Prentice-Hall, 1994. Google Scholar
Digital Library
- Hines, J.W. Matlab Supplement to Fuzzy and Neural Approaches in Engineering. Wiley, 1997. Google Scholar
Digital Library
- Michalewicz, Z. Genetic Algorithms + Data Structures = Evolution Programs. Springer-Verlag, Berlin, Heidelberg, New York, 1996 (3rd ed). Google Scholar
Digital Library
- 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 Scholar
- Sipper, M. On the origin of environments by means of natural selection. AI Magazine, 22(2001): 133--140. Google Scholar
Digital Library
- Tsoukalas, L. , and Uhrig, R. Fuzzy and Neural Approaches in Engineering. Wiley, 1997. Google Scholar
Digital Library
Index Terms
Developing a generic genetic algorithm
Recommendations
Developing a generic genetic algorithm
SIGAda '02: Proceedings of the 2002 annual ACM SIGAda international conference on Ada: The engineering of correct and reliable software for real-time & distributed systems using Ada and related technologiesGenetic 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 ...
Evaluating the Seeding Genetic Algorithm
Proceedings of the 26th Australasian Joint Conference on AI 2013: Advances in Artificial Intelligence - Volume 8272In this paper, we present new experimental results supporting the Seeding Genetic Algorithm (SGA). We evaluate the algorithm's performance with various parameterisations, making comparisons to the Canonical Genetic Algorithm (CGA), and use these as ...
Adaptive life-cycle and viability based paramecium-imitated evolutionary algorithm
This paper proposes a sim-paramesium genetic algorithm to enhance the searching and optimizing speed of classical genetic algorithms. Based upon classical genetic algorithms, the sim-paramesium genetic algorithm employs additional operators, such as ...







Comments