IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v75y1997i0p49-6810.1023-a1018928017332.html
   My bibliography  Save this article

New directions in genetic algorithm theory

Author

Listed:
  • Gary Koehler

Abstract

Recently, several classical Genetic Algorithm principles have been challenged - including the Fundamental Theorem of Genetic Algorithms and the Principle of Minimal Alphabets. In addition, the recent No Free Lunch theorems raise further concerns. In this paper we review these issues and offer some new directions for GA researchers. Copyright Kluwer Academic Publishers 1997

Suggested Citation

  • Gary Koehler, 1997. "New directions in genetic algorithm theory," Annals of Operations Research, Springer, vol. 75(0), pages 49-68, January.
    • Handle: RePEc:spr:annopr:v:75:y:1997:i:0:p:49-68:10.1023/a:1018928017332
    DOI: 10.1023/A:1018928017332
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/A:1018928017332
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1023/A:1018928017332?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

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


    Cited by:

    1. Pendharkar, Parag C. & Koehler, Gary J., 2007. "A general steady state distribution based stopping criteria for finite length genetic algorithms," European Journal of Operational Research, Elsevier, vol. 176(3), pages 1436-1451, February.
    2. Aytug, Haldun & Koehler, Gary J., 2000. "New stopping criterion for genetic algorithms," European Journal of Operational Research, Elsevier, vol. 126(3), pages 662-674, November.
    3. Arsham H., 1998. "Techniques for Monte Carlo Optimizing," Monte Carlo Methods and Applications, De Gruyter, vol. 4(3), pages 181-230, December.
    4. Leung, T. W. & Chan, Chi Kin & Troutt, Marvin D., 2003. "Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem," European Journal of Operational Research, Elsevier, vol. 145(3), pages 530-542, March.
    5. Mak, Brenda & Blanning, Robert & Ho, Susanna, 2006. "Genetic algorithms in logic tree decision modeling," European Journal of Operational Research, Elsevier, vol. 170(2), pages 597-612, April.

    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:spr:annopr:v:75:y:1997:i:0:p:49-68:10.1023/a:1018928017332. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.