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
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.