New directions in genetic algorithm theory

Gary Koehler

Annals of Operations Research, 1997, vol. 75, issue 0, 49-68

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

Date: 1997
References: Add references at CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1018928017332 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:75:y:1997:i:0:p:49-68:10.1023/a:1018928017332

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1023/A:1018928017332

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().