Title :
Hybrid genetic algorithms and random linkage
Author :
Joines, Jeffrey A. ; Kay, Michael G.
Author_Institution :
Dept. of Textile Eng., North Carolina State Univ., Raleigh, NC, USA
fDate :
6/24/1905 12:00:00 AM
Abstract :
Hybridizing evolutionary algorithms with local search has been quite successful. EAs are designed to exponentially exploit promising regions of the search space; however, by doing so may waste computation effort by duplicating local searches. Therefore, an adaptive memory method is used to determine when to apply a local search
Keywords :
genetic algorithms; optimisation; search problems; adaptive memory method; evolutionary algorithms; hybrid genetic algorithms; local search; random linkage; search space; Algorithm design and analysis; Convergence; Couplings; Evolutionary computation; Genetic algorithms; Lips; Sampling methods; Stochastic processes; Testing; Textiles;
Conference_Titel :
Evolutionary Computation, 2002. CEC '02. Proceedings of the 2002 Congress on
Conference_Location :
Honolulu, HI
Print_ISBN :
0-7803-7282-4
DOI :
10.1109/CEC.2002.1004504
