Crossover can provably be useful in evolutionary computation
From MaRDI portal
The authors try to prove that the use of the crossover operator in evolutionary computation is beneficial. They use the all-pairs shortest (APSP) problem to prove that the use of crossover made a natural evolutionary algorithm significantly faster. Under these circumstances, it seems that this is the first non-artificial approach to answer the question: ``How important is the crossover in evolutionary computation?
Recommendations
- scientific article; zbMATH DE number 1405791
- The analysis of evolutionary algorithms -- A proof that crossover really can help
- Real royal road functions -- where crossover provably is essential
- More effective crossover operators for the all-pairs shortest path problem
- scientific article; zbMATH DE number 2013530
Cites work
- A Theorem on Boolean Matrices
- Automata, Languages and Programming
- Efficient Algorithms for Shortest Paths in Sparse Networks
- Equation of state calculations by fast computing machines
- scientific article; zbMATH DE number 3497315 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1263184 (Why is no real title available?)
- scientific article; zbMATH DE number 1368469 (Why is no real title available?)
- scientific article; zbMATH DE number 1405791 (Why is no real title available?)
- Introduction to algorithms
- Optimization by simulated annealing
- Real royal road functions -- where crossover provably is essential
- Real royal road functions for constant population size
- Techniques for bounding the convergence rate of genetic algorithms
- The analysis of evolutionary algorithms -- A proof that crossover really can help
- The analysis of evolutionary algorithms on sorting and shortest paths problems
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
Cited in
(29)- Optimal static and self-adjusting parameter choices for the (1+( , )) genetic algorithm
- The analysis of evolutionary algorithms -- A proof that crossover really can help
- More effective crossover operators for the all-pairs shortest path problem
- A simple ant colony optimizer for stochastic shortest path problems
- Fixed-parameter evolutionary algorithms and the vertex cover problem
- A rigorous runtime analysis of the \((1 + (\lambda, \lambda))\) GA on jump functions
- Tight bounds on the expected runtime of a standard steady state genetic algorithm
- On the benefits of populations for the exploitation speed of standard steady-state genetic algorithms
- Memetic algorithms outperform evolutionary algorithms in multimodal optimisation
- Lower bounds on the runtime of crossover-based algorithms via decoupling and family graphs
- Reducing the arity in unbiased black-box complexity
- Real royal road functions -- where crossover provably is essential
- A tight runtime analysis for the \((\mu + \lambda)\) EA
- Fixed-parameter tractability of crossover: steady-state GAs on the closest string problem
- Crossover can be constructive when computing unique input-output sequences
- scientific article; zbMATH DE number 1962037 (Why is no real title available?)
- scientific article; zbMATH DE number 1405791 (Why is no real title available?)
- scientific article; zbMATH DE number 2243393 (Why is no real title available?)
- A generic construction for crossovers of graph-like structures and its realization in the Eclipse Modeling Framework
- (1+1) genetic programming with functionally complete instruction sets can evolve Boolean conjunctions and disjunctions with arbitrarily small error
- An extended jump functions benchmark for the analysis of randomized search heuristics
- A crossover operator that uses Pareto optimality in its definition
- A Generic Construction for Crossovers of Graph-Like Structures
- Crossover can guarantee exponential speed-ups in evolutionary multi-objective optimisation
- Fourier analysis meets runtime analysis: precise runtimes on plateaus
- Many-objective problems where crossover is provably essential
- Global versus local search: the impact of population sizes on evolutionary algorithm performance
- Runtime analysis of evolutionary neural architecture search for binary classification
- Evolutionary algorithms and matroid optimization problems
This page was built for publication: Crossover can provably be useful in evolutionary computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q418021)
