Abstract
Recombination operators with high positional bias are less disruptive against adjacent genes. Therefore, it is ideal for the encoding to position epistatic genes adjacent to each other and aid GA search through genetic linkage. To produce an encoding that facilitates genetic linkage is problematic. This study focuses on selective crossover, which is an adaptive recombination operator. We propose three alternative encodings for the Royal Road problem. We use these encodings to analyse the performance of selective crossover with respect to different encodings. This study shows that the performance of selective crossover is consistent and is not affected by alternative encodings of a problem, unlike two-point crossover. The encodings are also used to understand the behaviour of selective crossover in terms of schema propagation. Experimental results indicate that selective crossover provides a better balance between exploration and exploitation than conventional recombination operators.
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
Baker, J.E. (1987) Reducing Bias and Inefficiency in the Selection Algorithm. In J.J Grefenstette, editor, Proceedings of the 2nd International Conference on Genetic Algorithms, 14-21. Lawrence Erlbaum Associates.
Eshelman, L. J., Caruana, R. A., & Schaffer J. D. (1989) Biases in the Crossover Landscape. In J. David Schaffer, (editor), Proceedings of the Third International Conference on Genetic Algorithms, 10-19. Morgan Kaufmann.
Forrest, S. & Mitchell, M. (1993) Relative Building-Block Fitness and the Building Block Hypothesis. In L. D. Whitley, editor, Foundations of Genetic Algorithms 2, 109–126. San Francisco, CA: Morgan Kaufmann.
Goldberg, D. E. (1989) Genetic Algorithms in search, optimization and machine learning, Addison-Wesley.
Goldberg, D. E., Korb, B. & Deb, K. (1989) Messy Genetic Algorithms: Motivation, Analysis, and First Results. In Complex Systems, Vol. 3. 493–530.
Harik, G. R. (1997) Learning gene linkage to efficiently solve problems of bounded difficulty using genetic algorithms. Doctoral dissertation, University of Michigan, Ann Harbor.
Holland, J. H. (1975) Adaptation in Natural and Artificial Systems. MIT Press.
Kargupta, H. (1996) The Gene Expression Messy Genetic Algorithm. In Proceedings of the IEEE International Conference on Evolutionary Computation, 814-819 IEEE Press.
Mitchell, M. & Forrest, S. & Holland, John H. (1991) The Royal Road for Genetic Algorithms: Fitness Landscapes and GA Performance. In F. J. Verala & P. Bourgine (eds.), Toward a Practice of Autonomous Systems: Proceedings of the First European Conference on artificial Life, 245–254. Cambridge, MA: MIT Press.
Mitchell, M. (1996) An Introduction to Genetic Algorithms. MIT Press.
Schaffer, J. D. & Eshelman, L. J. (1991) On Crossover as an Evolutionary Viable Strategy. In In R. Belew and L. Booker (eds.), Proceedings of the Fourth International Conference on Genetic Algorithms, 61-68. Morgan Kaufmann.
Spears, W. M. (1993). Crossover or Mutation? In L. Darrell Whitley, editor, Proceedings of Foundations of Genetic Algorithms 2, 221-237. Morgan Kaufmann.
Spears, W. M. (1997), Recombination Parameters. In T. Bäck, D. Fogel and Z. Michalewicz (ed.), The Handbook of Evolutionary Computation, Oxford University Press.
Spears, W. M. (1998) The Role of Mutation and Recombination in Evolutionary Algorithms. Doctoral dissertation, George Mason University, Virginia.
Vekaria K. & Clack C. (1998). Selective Crossover in Genetic Algorithms: An Empirical Study. In Eiben et al. (eds.). Proceedings of the 5th Conference on Parallel Problem Solving from Nature, 438-447. Springer-Verlag.
Vekaria K. & Clack C. (1999). Biases Introduced by Adaptive Recombination Operators. In Banzhaf et al. (editors.) Proceedings of the Genetic and Evolutionary Computation Conference, CA: Morgan Kaufmann.
Wu, S., Lindsay, R. K. & Riolo, R. L. (1997) Empirical Observations on the Role of Crossover and Mutation. In Thomas Bäck (editor), Proceedings of the Seventh International Conference on Genetic Algorithms, 362-369. Morgan Kaufmann.
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
Vekaria, K., Clack, C. (2000). Royal Road Encodings and Schema Propagation in Selective Crossover. In: Suzuki, Y., Ovaska, S., Furuhashi, T., Roy, R., Dote, Y. (eds) Soft Computing in Industrial Applications. Springer, London. https://doi.org/10.1007/978-1-4471-0509-1_23
Download citation
DOI: https://doi.org/10.1007/978-1-4471-0509-1_23
Publisher Name: Springer, London
Print ISBN: 978-1-4471-1155-9
Online ISBN: 978-1-4471-0509-1
eBook Packages: Springer Book Archive