.png){kind=icon}
Return
Learning with case-injected genetic algorithms
.png){kind=icon}
PRE
AI
DOI：10.1109/TEVC.2004.823466.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper presents a new approach to acquiring and using problem specific knowledge during a genetic algorithm (GA) search. A GA augmented with a case-based memory of past problem solving attempts learns to obtain better performance over time on sets of similar problems. Rather than starting anew on each problem, we periodically inject a GA's population with appropriate intermediate solutions to similar previously solved problems. Perhaps, counterintuitively, simply injecting solutions to previously solved problems does not produce very good results. We provide a framework for evaluating this GA-based machine-learning system and show experimental results on a set of design and optimization problems. These results demonstrate the performance gains from. our approach and indicate that our system learns to take less time to provide quality solutions to a new problem as it gains experience from solving other similar problems in design and optimization.
Keywords:
case-based reasoning
genetic algorithm (GA)
optimization
Journal
IF:
12
Papers:
1.9K
Citations:
2.4W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSaveShareSave
ShareSaveShareSaveShareSave
View more