IDEAS home Printed from https://ideas.repec.org/p/wop/safiwp/93-06-037.html
   My bibliography  Save this paper

When Will a Genetic Algorithm Outperform Hill-Climbing?

Author

Listed:
  • Melanie Mitchell
  • John H. Holland

Abstract

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.

Suggested Citation

  • Melanie Mitchell & John H. Holland, 1993. "When Will a Genetic Algorithm Outperform Hill-Climbing?," Working Papers 93-06-037, Santa Fe Institute.
    • Handle: RePEc:wop:safiwp:93-06-037
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below 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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Alexander V Spirov & Ekaterina M Myasnikova, 2022. "Heuristic algorithms in evolutionary computation and modular organization of biological macromolecules: Applications to in vitro evolution," PLOS ONE, Public Library of Science, vol. 17(1), pages 1-42, January.
    2. Rohit Salgotra & Nitin Mittal & Vikas Mittal, 2023. "A New Parallel Cuckoo Flower Search Algorithm for Training Multi-Layer Perceptron," Mathematics, MDPI, vol. 11(14), pages 1-25, July.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wop:safiwp:93-06-037. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Thomas Krichel (email available below). General contact details of provider: https://edirc.repec.org/data/epstfus.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.