DMCA
Case-Based Initialization of Genetic Algorithms (1993)
| Citations: | 83 - 6 self |
BibTeX
@MISC{Ramsey93case-basedinitialization,
author = {Connie Loggia Ramsey and John J. Grefenstette},
title = {Case-Based Initialization of Genetic Algorithms},
year = {1993}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
In this paper, we introduce a case-based method of initializing genetic algorithms that are used to guide search in changing environments. This is incorporated in an anytime learning system. Anytime learning is a general approach to continuous learning in a changing environment. The agent's learning module continuously tests new strategies against a simulation model of the task environment, and dynamically updates the knowledge base used by the agent on the basis of the results. The execution module includes a monitor that can dynamically modify the simulation model based on its observations of the external environment; an update to the simulation model causes the learning system to restart learning. Previous work has shown that genetic algorithms provide an appropriate search mechanism for anytime learning. This paper extends the approach by including strategies, which are learned under similar environmental conditions, in the initial population of the genetic algorithm. Experiments s...
Keyphrases
genetic algorithm simulation model case-based initialization anytime learning similar environmental condition previous work continuous learning general approach learning system anytime learning system case-based method new strategy execution module learning module task environment external environment initial population appropriate search mechanism knowledge base changing environment
