The Community for Technology Leaders
Parallel and Distributed Processing Symposium, International (2003)
Nice, France
Apr. 22, 2003 to Apr. 26, 2003
ISSN: 1530-2075
ISBN: 0-7695-1926-1
pp: 142a
Forbes J. Burkowski , University of Waterloo
In this paper, we describe an environment for evolutionary computation that supports the movement of information from genome to phenotype with the possibility of one or more intermediate transformations. Our notion of a phenotype is more than a simple alternate representation of the binary genome. The construction of a phenotype is sufficiently different from the genome as to require its generation by a procedure that we call a gene expression algorithm. We discuss various reasons why benefits should accrue when combining gene expression algorithms with conventional genetic algorithms and illustrate these ideas with an algorithm to generate approximate solutions to the Traveling Salesperson Problem. As in most genetic algorithms dealing with the TSP we run into the problem of an appropriate crossover operation for the strings that specify a permutation. To handle this issue we introduce a novel genome representation that admits a natural crossover operation and produces a permutation vector as an intermediate representation.
Forbes J. Burkowski, "Proximity and Priority: Applying a Gene Expression Algorithm to the Traveling Salesperson Problem", Parallel and Distributed Processing Symposium, International, vol. 00, no. , pp. 142a, 2003, doi:10.1109/IPDPS.2003.1213270
95 ms
(Ver 3.3 (11022016))