DocumentCode :
1869967
Title :
Decision making in a hybrid genetic algorithm
Author :
Lobo, Fernando G. ; Goldberg, David E.
fYear :
1997
fDate :
13-16 Apr 1997
Firstpage :
121
Lastpage :
125
Abstract :
There are several issues that need to be taken into consideration when designing a hybrid problem solver. The paper focuses on one of them-decision making. More specifically, we address the following questions: given two different methods, how to get the most out of both of them? When should we use one and when should we use the other in order to get maximum efficiency? We present a model for hybridizing genetic algorithms (GAs) based on a concept that decision theorists call probability matching and we use it to combine an elitist selecto-recombinative GA with a simple hill climber (HC). Tests on an easy problem with a small population size match our intuition that both GA and HC are needed to solve the problem efficiently
Keywords :
decision theory; genetic algorithms; probability; decision making; decision theorists; elitist selecto-recombinative GA; hybrid genetic algorithm; hybrid problem solver; maximum efficiency; population size; probability matching; simple hill climber; Algorithm design and analysis; Decision making; Diversity reception; Expert systems; Genetic algorithms; Jet engines; Maintenance engineering; Mathematical analysis; Testing; Turbines;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Evolutionary Computation, 1997., IEEE International Conference on
Conference_Location :
Indianapolis, IN
Print_ISBN :
0-7803-3949-5
Type :
conf
DOI :
10.1109/ICEC.1997.592281
Filename :
592281
Link To Document :
بازگشت