Abstract
For problems where the evaluation of an individual is the dominant factor in the total computation time of the evolutionary process, minimizing the number of evaluations becomes critical. This paper introduces a new crossover operator for genetic programming, memetic crossover, that reduces the number of evaluations required to find an ideal solution. Memetic crossover selects individuals and crossover points by evaluating the observed strengths and weaknesses within areas of the problem. An individual that has done poorly in some parts of the problem may then imitate an individual that did well on those same parts. This results in an intelligent search of the feature-space and, therefore, fewer evaluations.
This is a preview of subscription content, log in via an institution to check access.
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
Nordin, P., Banzhaf, W.: Real time control of a Khepera robot using genetic programming. Cybernetics and Control 26, 533–561 (1997)
Dawkins, R.: The Selfish Gene. Oxford University Press, Oxford (1976)
Moscato, P.: On evolution, search, optimization, genetic algorithms and martial arts: Towards memetic algorithms. Technical Report C3P 826, California Institute of Technology, Pasadena, CA (1989)
Hougen, D.F., Carmer, J., Woehrer, M.: Memetic learning: A novel learning method for multi-robot systems. In: International Workshop on Multi-Robot Systems (2003), Avaliable at http://www.cs.ou.edu/~hougen/mrs2003.pdf
Eskridge, B.E., Hougen, D.F.: Imitating success: A memetic crossover operator for genetic programming. To appear in Proceedings of the Congress on Evolutionary Computation, IEEE (2004)
Koza, J.R.: Genetic programming: On the programming of computers by natural selection. MIT Press, Cambridge (1992)
Koza, J.R.: Genetic Programming II: Automatic Discovery of Reusable Programms. MIT Press, Cambridge (1994)
D’haeseleer, P.: Context preserving crossover in genetic programming. In: Proceedings of the 1994 IEEE World Congress on Computational Intelligence, Orlando, Florida, USA, vol. 1, pp. 256–261. IEEE Press, Los Alamitos (1994)
Langdon, B.: Genetic Programming and Data Structures. PhD thesis, University College, London (1996)
Rosca, J.P., Ballard, D.H.: Discovery of subroutines in genetic programming. In: Angeline, P.J., Kinnear Jr., K.E. (eds.) Advances in Genetic Programming 2, pp. 177–202. MIT Press, Cambridge (1996)
Coello, C.A.C.: A comprehensive survey of evolutionary-based multiobjective optimization techniques. Knowledge and Information Systems 1, 129–156 (1999)
Langdon, W.B., Poli, R.: Fitness causes bloat. In: Chawdhry, P.K., Roy, R., Pan, R.K. (eds.) Second On-line World Conference on Soft Computing in Engineering Design and Manufacturing, pp. 13–22. Springer, London (1997)
Montana, D.J.: Strongly typed genetic programming. Technical Report #7866, 10 Moulton Street, Cambridge, MA 02138, USA (1993)
Moriarty, D.E., Schultz, A.C., Grefenstette, J.J.: Evolutionary algorithms for reinforcement learning. Journal of Artificial Intelligence Research 11, 241–276 (1999)
Luke, S.: ECJ 10: A java-based evolutionary compuation and genetic programming research system, Avaliable at http://cs.gmu.edu/~eclab/projects/ecj/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Eskridge, B.E., Hougen, D.F. (2004). Memetic Crossover for Genetic Programming: Evolution Through Imitation. In: Deb, K. (eds) Genetic and Evolutionary Computation – GECCO 2004. GECCO 2004. Lecture Notes in Computer Science, vol 3103. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24855-2_57
Download citation
DOI: https://doi.org/10.1007/978-3-540-24855-2_57
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22343-6
Online ISBN: 978-3-540-24855-2
eBook Packages: Springer Book Archive