Abstract
A new model for evolving crossover operators for evolutionary function optimization is proposed in this paper. The model is a hybrid technique that combines a Genetic Programming (GP) algorithm and a Genetic Algorithm (GA). Each GP chromosome is a tree encoding a crossover operator used for function optimization. The evolved crossover is embedded into a standard Genetic Algorithm which is used for solving a particular problem. Several crossover operators for function optimization are evolved using the considered model. The evolved crossover operators are compared to the human-designed convex crossover. Numerical experiments show that the evolved crossover operators perform similarly or sometimes even better than standard approaches for several well-known benchmarking problems.
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
Angeline, P.J.: Two self-adaptive crossover operators for genetic programming. In: Advances in Genetic Programming II, pp. 89–110. MIT Press, Cambridge (1996)
Bremermann, H.J.: Optimization through evolution and recombination. In: Yovits, M.C., Jacobi, G.T., Goldstein, G.D. (eds.) Proceedings of the Conference on Self-Organizing Systems, Chicago, Illinois, May 22-24, Self-Organizing Systems 1962, pp. 93–106 (1962)
Chang, T.-J., Meade, N., Beasley, J.E., Sharaiha, Y.M.: Heuristics for cardinality constrained portfolio optimisation, Comp. & Opns. Res, vol. 27, pp. 1271–1302 (2000)
Edmonds, B.: Meta-genetic programming: coevolving the operators of variation. Electrik on AI 9, 13–29 (2001)
Goldberg, D.: Genetic algorithms in search, optimization and machine learning. Addison-Wesley, Reading (1989)
Koza, J.R.: Genetic programming, On the programming of computers by means of natural selection. MIT Press, Cambridge (1992)
Markowitz, H.: Portfolio Selection. Journal of Finance 7, 77–91 (1952)
Oltean, M., Grosan, C.: Evolving EAs using Multi Expression Programming. In: European Conference on Artificial Life, pp. 651–658. Springer, Heidelberg (2003)
Schwefel, H.-P.: Numerical optimization of computer models. John Wiley & Sons, New York (1981)
Spector, L., Robinson, A.: Genetic Programming and Autoconstructive Evolution with the Push Programming Language. In: Genetic Programming and Evolvable Machines, (1), pp. 7–40. Kluwer, Dordrecht (2002)
Streichert, F., Ulmer, H., Zell, A.: Comparing discrete and continuous genotypes on the constrained portfolio selection problem. In: Deb, K., et al. (eds.) GECCO 2004. LNCS, vol. 3103, pp. 1239–1250. Springer, Heidelberg (2004)
Tavares, J., Machado, P., Cardoso, A., Pereira, F.-B., Costa, E.: On the evolution of evolutionary algorithms. In: Keijzer, M., et al. (eds.) European Conference on Genetic Programming, pp. 389–398. Springer, Berlin (2004)
Teller, A.: Evolving programmers: the co-evolution of intelligent recombination operators. In: Advances in Genetic Programming II, pp. 45–68. MIT Press, USA (1996)
Yao, X., Liu, Y., Lin, G.: Evolutionary programming made faster. IEEE Transaction on Evolutionary Computation, 82–102 (1999)
Wolpert, D.H., McReady, W.G.: No Free Lunch Theorems for Search., Technical Report SFI-TR-05-010, Santa Fe Institute, USA (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dioşan, L., Oltean, M. (2006). Evolving Crossover Operators for Function Optimization. In: Collet, P., Tomassini, M., Ebner, M., Gustafson, S., Ekárt, A. (eds) Genetic Programming. EuroGP 2006. Lecture Notes in Computer Science, vol 3905. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11729976_9
Download citation
DOI: https://doi.org/10.1007/11729976_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-33143-8
Online ISBN: 978-3-540-33144-5
eBook Packages: Computer ScienceComputer Science (R0)