Abstract
This paper describes an analysis of a set of experiments on the Royal Road functions, aimed at developing a GA that was robust for a set of such functions. The Royal Road functions were designed to be easy for Genetic Algorithms to solve and it was expected that other techniques would have difficulty in finding good solutions. However, it is discovered that a simple thresholding algorithm was able to produce comparable results on the basic Royal Road function and remained robust when applied to variations of the function. The GA required modification to compete on some variations and suffered severe performance deterioration on others.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Dan Adler. Genetic algorithms and simulated annealing: A marriage proposal. In IEEL International conference on neural networks, 1993.
J.F Dockx, K. Lutsko. Survival of the fittest in Alaska. In The Fourth International Workshop Artificial Intelligence and Statistics. Fort Lauderdale, 1993.
Kathryn A. Dowsland. Simulated annealing. In Modern Heuristic Techniques for Combinatorial Problems. Blackwell Scientific Publications, 1993.
Gunter Dueck and Tobias Scheuer. Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing. In Journal of Computational Physics, 1989.
Stephanie Forrest and Melanie Mitchell. Relative building-block fitness and the building-block hypothesis. In Foundations of Genetic Algorithms-2. Fort Lauderdale, 1993.
David E. Goldburg. Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley Publishing Company, Inc., 1989.
David E. Goldburg. A note on boltzmann tournament selection for genetic algorithms and population-oriented simulated annealing. In Complex Systems, 1990.
John J. Grefenstette. Deception considered harmful. In Foundations of Genetic Algorithms-2. Morgan Kaufmann, 1993.
John H. Holland. Royal road functions. In Internet Genetic Algorithms Digest, 7∶22. Massachusetts Insitue of Technology, 1993.
Melanie Mitchell John H. Holland and Stephanie Forrest. The royal road for genetic algorithms: Fitness landscapes and G.A. performance. In Proceedings of the First European Conference on Artificial Life. Massachusetts Insitue of Technology, 1992.
Terry Jones. A description of Hollands's Royal Road function. Massachusetts Institute of Technology, 1995.
John H. Holland Melanie Mitchell and Stephanie Forrest. When will a genetic algorithm outperform hill climbing ? In Advances in Neural Information Processing Systems 6. Morgan Kaufmann, 1993.
George D. Smith. Economic applications of genetic algorithms. In Applications of Modern Heuristic Methods, edited V.J. Rayward-Smith, Alfred Waller, 1995.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Quick, R.J., Rayward-Smith, V.J., Smith, G.D. (1996). The Royal Road functions: description, intent and experimentation. In: Fogarty, T.C. (eds) Evolutionary Computing. AISB EC 1996. Lecture Notes in Computer Science, vol 1143. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0032786
Download citation
DOI: https://doi.org/10.1007/BFb0032786
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61749-5
Online ISBN: 978-3-540-70671-7
eBook Packages: Springer Book Archive