Abstract
Measures of distance are essential to the development of many applications, but the need for these measures to be representative is often ignored - measures that truly represent the manner in which solution space is traversed are often disregarded in favour of simpler measures. With the genetic algorithm employing both unary and binary operators, it is difficult to quantify the distance between chromosomes with an approach that is truly representative of the distances traversed by the evolutionary mechanism. It is, however, possible to redefine the function of recombination to facilitate a more representative measure. The recursive approach presented here entails the redefinition of recombination as a set of unary operators determined by the current population. These operators replicate the behaviour of the original operator precisely and can be used to calculate the recombinational distance between chromosomes with a time complexity that is improved logarithmically over a simplistic approach.
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
Altenberg, L.: Fitness Distance Correlation Analysis: An Instructive Counterexample. In: Proceedings of the 7th International Conference on Genetic Algorithms, pp. 57–64 (1997)
Culberson, J.C.: Mutation-Crossover Isomorphisms and the Construction of Discriminating Functions. Evolutionary Computation 2, 279–311 (1995)
Dybowski, R., Collins, T.D., Weller, P.R.: Visualization of Binary String Convergence by Sammon Mapping. In: Proceedings of the 5th Annual Conference on Evolutionary Programming, pp. 377–383 (1996)
Gitchoff, P., Wagner, G.P.: Recombination Induced Hypergraphs. Complexity 2(1), 37–43 (1996)
Goldberg, D.E.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley Longman Publishing Co., Inc. (1989)
Hamming, R.: Error Detecting and Error Correcting Codes. Bell System Technical Journal 29(2), 147–160 (1950)
Jones, T.: Evolutionary Algorithms, Fitness Landscapes, and Search. Thesis Document. The University of New Mexico, Albuquerque (1995)
Jones, T.: One Operator, One Landscape. Working Paper. Santa Fe Institute (1995)
Merrell, D.J.: The Adaptive Seascape: The Mechanism of Evolution, p. 59 (1994)
Mitchell, M.: An Introduction To Genetic Algorithms. MIT Press, Cambridge (1996)
Sammon, J.W.: A Nonlinear Mapping for Data Structure Analysis. IEEE Transactions on Computers 18(5), 401–409 (1969)
Spears, W.M.: The Role of Mutation and Recombination in Evolutionary Algorithms. Thesis Document. George Mason University, Fairfax (1998)
Stadler, P.F.: Fitness Landscapes. Biological Evolution and Statistical Physics, 183–204 (2002)
Wijk, J.J.: The Value of Visualization. In: IEEE Visualization Conference, vol. 0, p. 11 (2005)
Vose, M.D.: Formalizing Genetic Algorithms. In: Proceedings of Genetic Algorithms, Neural Nets, and Simulated Annealing Applied to Problems in Signal and Image Processing (1990)
Wineberg, M., Oppacher, F.: The Underlying Similarity of Diversity Measures Used in Evolutionary Computation. In: Proceedings of the 5th Genetic and Evolutionary Computation Conference, pp. 1493–1504 (2003)
Wright, S.: The Roles of Mutation, Inbreeding, Crossbreeding and Selection in Evolution. In: Proceedings of the 11th International Congress of Genetics, vol. 8, pp. 209–222 (1932)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag GmbH Berlin Heidelberg
About this paper
Cite this paper
Collier, R., Wineberg, M. (2012). Investigating a Measure of the Recombinational Distance Traversed by the Genetic Algorithm. In: Madani, K., Dourado Correia, A., Rosa, A., Filipe, J. (eds) Computational Intelligence. IJCCI 2010. Studies in Computational Intelligence, vol 399. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27534-0_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-27534-0_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-27533-3
Online ISBN: 978-3-642-27534-0
eBook Packages: EngineeringEngineering (R0)