title: Geometric differential evolution for combinatorial and programs spaces.
abstract: Geometric differential evolution (GDE) is a recently introduced formal generalization of traditional differential evolution (DE) that can be used to derive specific differential evolution algorithms for both continuous and combinatorial spaces retaining the same geometric interpretation of the dynamics of the DE search across representations. In this article, we first review the theory behind the GDE algorithm, then, we use this framework to formally derive specific GDE for search spaces associated with binary strings, permutations, vectors of permutations and genetic programs. The resulting algorithms are representation-specific differential evolution algorithms searching the target spaces by acting directly on their underlying representations. We present experimental results for each of the new algorithms on a number of well-known problems comprising NK-landscapes, TSP, and Sudoku, for binary strings, permutations, and vectors of permutations. We also present results for the regression, artificial ant, parity, and multiplexer problems within the genetic programming domain. Experiments show that overall the new DE algorithms are competitive with well-tuned standard search algorithms.
authors.affiliation: School of Computer Science, University of Birmingham, UK A.Moraglio@cs.bham.ac.uk.
authors.forename: A
authors.initials: A
authors.lastname: Moraglio
authors.forename: J
authors.initials: J
authors.lastname: Togelius
authors.forename: S
authors.initials: S
authors.lastname: Silva
mesh_terms: D000465:Algorithms; D005716:Game Theory; D012984:Software