Learning with Genetic Algorithms: An Overview

447Citations
Citations of this article
184Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Genetic algorithms represent a class of adaptive search techniques that have been intensively studied in recent years. Much of the interest in genetic algorithms is due to the fact that they provide a set of efficient domain-independent search heuristics which are a significant improvement over traditional “weak methods” without the need for incorporating highly domain-specific knowledge. There is now considerable evidence that genetic algorithms are useful for global function optimization and NP-hard problems. Recently, there has been a good deal of interest in using genetic algorithms for machine learning problems. This paper provides a brief overview of how one might use genetic algorithms as a key element in learning systems. © 1988, Kluwer Academic Publishers. All rights reserved.

Cite

CITATION STYLE

APA

de Jong, K. (1988). Learning with Genetic Algorithms: An Overview. Machine Learning, 3(2), 121–138. https://doi.org/10.1023/A:1022606120092

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free