15 search results - page 2 / 3 » Geometric crossover for the permutation representation |
GECCO
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. Topological crossovers are a class of representation-independent operators that are well-defined once a notion of distance over the solution space is defined. In this pap...
CEC
2005
IEEE
13 years 11 months ago
2005
IEEE
The relationship between search space, distances and genetic operators for syntactic trees is little understood. Geometric crossover and geometric mutation are representation-indep...
EUROGP
2006
Springer
13 years 9 months ago
2006
Springer
This paper extends a geometric framework for interpreting crossover and mutation [4] to the case of sequences. This representation is important because it is the link between artif...
CEC
2010
IEEE
13 years 6 months ago
2010
IEEE
The Nelder-Mead Algorithm (NMA) is an almost half-century old method for numerical optimization, and it is a close relative of Particle Swarm Optimization (PSO) and Differential Ev...
GECCO
2009
Springer
13 years 12 months ago
2009
Springer
Genetic algorithms are often applied to combinatorial optimization problems, the most popular one probably being the traveling salesperson problem. In contrast to permutations use...