Spin-flip symmetry and synchronization
Evolutionary Computation
Real royal road functions for constant population size
Theoretical Computer Science
On the runtime analysis of the 1-ANT ACO algorithm
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Rigorous analyses of simple diversity mechanisms
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Computational complexity and evolutionary computation
Proceedings of the 10th annual conference companion on Genetic and evolutionary computation
Crossover can provably be useful in evolutionary computation
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Memetic algorithms with variable-depth search to overcome local optima
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Theoretical analysis of diversity mechanisms for global exploration
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Ignoble Trails - Where Crossover Is Provably Harmful
Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X
Crossover Can Be Constructive When Computing Unique Input Output Sequences
SEAL '08 Proceedings of the 7th International Conference on Simulated Evolution and Learning
Comparison of simple diversity mechanisms on plateau functions
Theoretical Computer Science
Computational complexity and evolutionary computation
Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers
Analysis of diversity-preserving mechanisms for global exploration*
Evolutionary Computation
Runtime analysis of an ant colony optimization algorithm for TSP instances
IEEE Transactions on Evolutionary Computation
The benefit of migration in parallel evolutionary algorithms
Proceedings of the 12th annual conference on Genetic and evolutionary computation
Computational complexity and evolutionary computation
Proceedings of the 12th annual conference companion on Genetic and evolutionary computation
Runtime analysis of the 1-ANT ant colony optimizer
Theoretical Computer Science
Analysis of (1+1) evolutionary algorithm and randomized local search with memory
Evolutionary Computation
How crossover helps in pseudo-boolean optimization
Proceedings of the 13th annual conference on Genetic and evolutionary computation
An analysis on recombination in multi-objective evolutionary optimization
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Running time analysis of Ant Colony Optimization for shortest path problems
Journal of Discrete Algorithms
Crossover can provably be useful in evolutionary computation
Theoretical Computer Science
Runtime analysis of convex evolutionary search
Proceedings of the 14th annual conference on Genetic and evolutionary computation
Crossover speeds up building-block assembly
Proceedings of the 14th annual conference on Genetic and evolutionary computation
An analysis on recombination in multi-objective evolutionary optimization
Artificial Intelligence
Hi-index | 0.00 |
Due to experimental evidence it is incontestable that crossover is essential for some fitness functions. However, theoretical results without assumptions are difficult. So-called real royal road functions are known where crossover is proved to be essential, i.e., mutation-based algorithms have an exponential expected runtime while the expected runtime of a genetic algorithm is polynomially bounded. However, these functions are artificial and have been designed in such a way that crossover is essential only at the very end (or at other well-specified points) of the optimization process.Here, a more natural fitness function based on a generalized Ising model is presented where crossover is essential throughout the whole optimization process. Mutation-based algorithms such as (μ+λ) EAs with constant population size are proved to have an exponential expected runtime while the expected runtime of a simple genetic algorithm with population size 2 and fitness sharing is polynomially bounded.