The Royal Road functions: description, intent and experimentation

  • R. J. Quick
  • V. J. Rayward-Smith
  • G. D. Smith
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1143)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1996

Authors and Affiliations

  • R. J. Quick
    • 1
  • V. J. Rayward-Smith
    • 1
  • G. D. Smith
    • 1
  1. 1.University of East AngliaNorwichUK

Personalised recommendations