Abstract
The recognition of useful information, its retention in memory, and subsequent use plays an important part in the behaviour of many biological species. Information gained by experience in one generation can be propagated to subsequent generations by some form of teaching. Each generation can then supplement its taught learning by its own experience. In this paper we explore the role of memorized information in the performance of a Genetic Programming (GP) system that uses a tree structure as its representation. Memory is implemented in the form of a set of sub-trees derived from successful members of each generation. The memory is used by a genetic operator similar to the mutation operator but with the following difference. In a tree-structured system the mutation operator replaces randomly selected sub-trees by new randomly-generated sub-trees. The memory operator replaces randomly selected sub-trees by sub-trees randomly selected from the memory. To study the memory operator’s impact a GP system is used to evolve a well-known expression from classical kinetics using fitness-based selection. The memory operator is used together with the common crossover and mutation operators. It is shown that the addition of a memory operator increases the probability of a successful evolution for this particular problem. At this stage we make no claim for its impact on other problems that have been successfully addressed by Genetic Programming.
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
Koza J R, 1992. Genetic Programming: On the programming of computers by means of natural selection. MIT Press, Cambridge, MA.
Koza J R, 1994. Genetic Programming II: Automatic discovery of reusable programs. MIT Press, Cambridge, MA.
Angeline P J and Pollack J B, 1993. Proceedings of the 5th International Conference on Genetic Algorithms pp 264–270
Banzhaf W, Nordin P, Keller R E and Francone F D,1998. Genetic Programming - an introduction Morgan Kaufmann, San Francisco, CA.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag London
About this paper
Cite this paper
Bearpark, K., Keane, A.J. (2000). Short Term Memory in Genetic Programming. In: Parmee, I.C. (eds) Evolutionary Design and Manufacture. Springer, London. https://doi.org/10.1007/978-1-4471-0519-0_25
Download citation
DOI: https://doi.org/10.1007/978-1-4471-0519-0_25
Publisher Name: Springer, London
Print ISBN: 978-1-85233-300-3
Online ISBN: 978-1-4471-0519-0
eBook Packages: Springer Book Archive