In this paper we review some previously published experimental results in which a simple hill-climbing algorithm---Random Mutation Hill-Climbing (RMHC)---significantly outperforms a genetic algorithm on a simple ``Royal Road'' function. We present an analysis of RMHC followed by an analysis of an ``idealized'' genetic algorithm (IGA) that is in turn significantly faster than RMHC. We isolate the features of the IGA that allow for this speedup, and discuss how these features can be incorparated into a real GA and a fitness landscape, making the GA better approximate the IGA. We use these features to design a modified version of the previously published experiments, and give new experimental results comparing the GA and RMHC.
Download Info
To our knowledge, this item is not available for
download. To find whether it is available, there are three
options:
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page
whether it is in fact available.
3. Perform a search for a similarly titled item that would be
available.
Publisher Info
Paper provided by Santa Fe Institute in its series Working Papers with number
93-06-037.