Using multiple representations in evolutionary algorithms

Using multiple representations in evolutionary algorithms (2000)

by Thorsten Schnier

Venue:	Proceedings of the 2000 Congress on Evolutionary Computation
Citations:	9 - 6 self

Datum	Value	Source
TITLE	Using multiple representations in evolutionary algorithms	INFERENCE
AUTHOR NAME	Thorsten Schnier	SVM HeaderParse 0.2
AUTHOR AFFIL	School of Computer Science; University of Birmingham	SVM HeaderParse 0.2
ABSTRACT	Abstract- Although evolutionary algorithms are very different from other artificial intelligence search algorithms, they face similar fundamental issues — representation and search. There have been a large amount of work done in evolutionary computation on search, such as recombination operators, mutation operators, selection schemes and various specialised operators. In comparison, research in different representations has not been as active. Most of 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 search as much as a good search operator could. 1 1	SVM HeaderParse 0.2
YEAR	2000	INFERENCE
VENUE	Proceedings of the 2000 Congress on Evolutionary Computation	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	479--486	INFERENCE
VOLUME	1	INFERENCE
CITATIONS	6 found	ParsCit 1.0