DocumentCode :
356782
Title :
Using multiple representations in evolutionary algorithms
Author :
Schnier, Thorsten ; Yao, Xin
Author_Institution :
Sch. of Comput. Sci., Birmingham Univ., UK
Volume :
1
fYear :
2000
fDate :
2000
Firstpage :
479
Abstract :
Although evolutionary algorithms are very different from other artificial intelligence search algorithms, they face similar fundamental issues-representation and searching. There has been a large amount of work done in evolutionary computation on searching, such as recombination operators, mutation operators, selection schemes and various specialised operators. In comparison, research on different representations has not been as active. Most such research has been focused on a single representation, e.g. bit strings, real-valued vectors using Cartesian coordinates, etc. This paper proposes and studies multiple representations in an evolutionary algorithm and shows empirically how multiple representations can benefit searches as much as a good search operator could
Keywords :
artificial intelligence; data structures; evolutionary computation; mathematical operators; search problems; Cartesian coordinates; artificial intelligence search algorithms; bit strings; evolutionary algorithms; multiple representations; mutation operators; real-valued vectors; recombination operators; search operators; selection schemes; specialised operators; Algorithm design and analysis; Artificial intelligence; Artificial neural networks; Chromosome mapping; Computer science; Couplings; Design optimization; Evolutionary computation; Genetic mutations; Stochastic processes;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Evolutionary Computation, 2000. Proceedings of the 2000 Congress on
Conference_Location :
La Jolla, CA
Print_ISBN :
0-7803-6375-2
Type :
conf
DOI :
10.1109/CEC.2000.870335
Filename :
870335
Link To Document :
بازگشت