Abstract
In nature, sexually reproducing organisms do not mate indiscriminately — the choice of mate has an impact upon their offspring’s fitness. The investigation described here shows that, for a wide range of problems in the literature, using sexual selection proved to be a robust method for enhancing genetic algorithm performance. In addition, this investigation provides evidence for which parameters are important for a successful implementation.
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
A. Brindle. Genetic Algorithms for Function Optimization. PhD thesis, University of Alberta, 1981.
K.A. De Jong. An Analysis of the Behavior of a Class of Genetic Adaptive Systems. PhD thesis, University of Michigan, 1975.
K. Deb. Genetic algorithms in multimodal function optimization. Master’s thesis, University of Alabama, Department of Engineering Mechanics, 1989. TCGA Report No. 89002.
L.J. Eshelman and J.D. Schaffer. Preventing premature convergence in genetic algorithms by preventing incest. In R.K. Belew and L.B. Booker, editors, Proceedings of the Fourth International Conference on Genetic Algorithms. Morgan Kaufmann, 1991.
D.M. Himmelblau. Applied Nonlinear Programming. McGraw-Hill, 1972.
J.H. Holland. Adaptation in Natural and Artificial Systems. Ann Arbor: The University of Michigan Press, 1975.
G.F. Miller. Exploiting mate choice in evolutionary computation: Sexual selection as a process of search, optimization, and diversification. In T.C. Fogarty, editor, Proceedings of the 1994 AISB Workshop on Evolutionary Computing. Springer-Verlag, 1994.
M. Mitchell, S. Forrest, and J.H. Holland. The Royal Road for Genetic Algorithms: Fitness Landscapes and GA Performance. In Toward a Practice of Autonomous Systems: Proceedings of the First European Conference on Artificial Life, Cambridge, MA, 1991. MIT Press.
M. Ratford. The Single Chromosome’s Guide To Dating. Master’s thesis, Department of Artificial Intelligence, University of Edinburgh, 1996.
E. Ronald. When Selection Meets Seduction. In Larry J. Eshelman, editor, Proceedings of the Sixth International Conference on Genetic Algorithms, San Francisco, CA, 1995. Morgan Kaufmann.
P. Ross. Personal communication, 1996.
J.D. Schaffer, R.A. Canina, L.J. Eshelman, and R. Das. A study of control parameters affecting online performance of genetic algorithms for function optimization. In J.D. Schaffer, editor, Proceedings of the Third International Conference on Genetic Algorithms. Morgan Kaufmann, 1989.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Wien
About this paper
Cite this paper
Ratford, M., Tuson, A., Thompson, H. (1998). The Single Chromosome’s Guide to Dating. In: Artificial Neural Nets and Genetic Algorithms. Springer, Vienna. https://doi.org/10.1007/978-3-7091-6492-1_37
Download citation
DOI: https://doi.org/10.1007/978-3-7091-6492-1_37
Publisher Name: Springer, Vienna
Print ISBN: 978-3-211-83087-1
Online ISBN: 978-3-7091-6492-1
eBook Packages: Springer Book Archive