Abstract
Geometric crossover is a representation-independent generalization of traditional crossover for binary strings. It is defined in a simple geometric way by using the distance associated with the search space. Many interesting recombination operators for the most frequently used representations are geometric crossovers under some suitable distance. Showing that a given recombination operator is a geometric crossover requires finding a distance for which offspring are in the metric segment between parents. However, proving that a recombination operator is not a geometric crossover requires excluding that one such distance exists. It is, therefore, very difficult to draw a clear-cut line between geometric crossovers and non-geometric crossovers. In this paper we develop some theoretical tools to solve this problem and we prove that some well-known operators are not geometric. Finally, we discuss the implications of these results.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bäck, T., Hammel, U., Schwefel, H.: Evolutionary computation: Comments on the history and current state. IEEE Transactions on Evolutionary Computation 1(1), 3–17 (1997)
Bäck, T., Fogel, D.B., Michalewicz, T.: Evolutionary Computation 1: Basic Algorithms and Operators. Institute of Physics Publishing (2000)
Blumental, L., Menger, K.: Studies in geometry. Freeman and Company, San Francisco (1970)
Deza, M., Laurent, M.: Geometry of cuts and metrics. Springer, Heidelberg (1991)
Jones, T.: Evolutionary Algorithms, Fitness Landscapes and Search. PhD dissertation, University of New Mexico (1995)
Kim, Y.H., Yoon, Y., Moraglio, A., Moon, B.R.: Geometric crossover for multiway graph partitioning. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 1217–1224 (2006)
Lucas, S., Moraglio, A., Li, H., Poli, R., Zhang, Q.: Alignment Crossover for Finite State Machines (in preparation)
Luke, S., Spector, L.: A Revised Comparison of Crossover and Mutation in Genetic Programming. In: Proceedings of Genetic Programming Conference (1998)
Moraglio, A., Poli, R.: Topological interpretation of crossover. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 1377–1388 (2004)
Moraglio, A., Poli, R.: Topological crossover for the permutation representation. In: Workshop on theory of representations at Genetic and Evolutionary Computation Conference (2005)
Moraglio, A., Poli, R.: Geometric Crossover for the Permutation Representation. In: Technical Report CSM-429, University of Essex (2005)
Moraglio, A., Poli, R.: Geometric Landscape of Homologous Crossover for Syntactic Trees. In: Proceedings of IEEE Congress of Evolutionary Computation, pp. 427–434 (2005)
Moraglio, A., Poli, R.: Product Geometric Crossover. In: Proceedings of Parallel Problem Solving from Nature, pp. 1018–1027 (2006)
Moraglio, A., Poli, R.: Geometric Crossover for Sets, Multisets and Partitions. In: Proceedings of Parallel Problem Solving from Nature, pp. 1038–1047 (2006)
Moraglio, A., Poli, R., Seehuus, R.: Geometric Crossover for Biological Sequences. In: Proceedings of Genetic Programming Conference, pp. 121–132 (2006)
Moraglio, A., Togelius, J., Lucas, S.: Product Geometric Crossover for the Sudoku Puzzle. In: Proceedings of IEEE Congress of Evolutionary Computation, pp. 470–476 (2006)
Pardalos, P.M., Resend, M.G.C.: Handbook of Applied Optimization. Oxford University Press, Oxford, UK (2002)
Radcliffe, N.: Equivalence Class Analysis of Genetic Algorithms. Journal of Complex Systems 5, 183–205 (1991)
Reidys, C.M., Stadler, P.F.: Combinatorial landscapes. SIAM Review 44, 3–54 (2002)
Seehuus, R., Moraglio, A.: Geometric Crossover for Protein Motif Discovery. In: Workshop on theory of representations at Genetic and Evolutionary Computation Conference (2006)
Syswerda, G.: Schedule Optimization Using Genetic Algorithms. In: Davis (ed.) Handbook of Genetic Algorithms, Van Nostrand Reinhold, New York (1990)
Van de Vel, M.L.J.: Theory of Convex Structures. North-Holland (1993)
Wright, S.: The roles of mutation, inbreeding, crossbreeding and selection in evolution. In: Jones, D.F. (ed.) Proceedings of the Sixth International Congress on Genetics, vol. 1, pp. 356–366 (1932)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Moraglio, A., Poli, R. (2007). Inbreeding Properties of Geometric Crossover and Non-geometric Recombinations. In: Stephens, C.R., Toussaint, M., Whitley, D., Stadler, P.F. (eds) Foundations of Genetic Algorithms. FOGA 2007. Lecture Notes in Computer Science, vol 4436. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73482-6_1
Download citation
DOI: https://doi.org/10.1007/978-3-540-73482-6_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73479-6
Online ISBN: 978-3-540-73482-6
eBook Packages: Computer ScienceComputer Science (R0)