Many-objective problems where crossover is provably essential
From MaRDI portal
Cites work
- A study of drift analysis for estimating computation time of evolutionary algorithms
- An analysis on recombination in multi-objective evolutionary optimization
- Analyzing randomized search heuristics via stochastic domination
- Applications of Multi-Objective Evolutionary Algorithms
- Black-box Complexity of Parallel Search with Distributed Populations
- Concentration of first hitting times under additive drift
- Crossover can guarantee exponential speed-ups in evolutionary multi-objective optimisation
- Crossover can provably be useful in evolutionary computation
- Design and analysis of diversity-based parent selection schemes for speeding up evolutionary multi-objective optimisation
- Drift analysis and evolutionary algorithms revisited
- Fixed-parameter tractability of crossover: steady-state GAs on the closest string problem
- From black-box complexity to designing new genetic algorithms
- scientific article; zbMATH DE number 1975091 (Why is no real title available?)
- scientific article; zbMATH DE number 7158131 (Why is no real title available?)
- Maximizing submodular or monotone approximately submodular functions by multi-objective evolutionary algorithms
- More effective crossover operators for the all-pairs shortest path problem
- Multi-objective optimization using evolutionary algorithms
- Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems
- Optimal static and self-adjusting parameter choices for the (1+( , )) genetic algorithm
- Optimised crossover genetic algorithm for capacitated vehicle routing problem
- Real royal road functions -- where crossover provably is essential
- Real royal road functions for constant population size
- Simplified drift analysis for proving lower bounds in evolutionary computation
- The analysis of evolutionary algorithms -- A proof that crossover really can help
- The one-dimensional Ising model: mutation versus recombination
- Toward a unifying framework for evolutionary processes
- Upper bounds on the running time of the univariate marginal distribution algorithm on OneMax
This page was built for publication: Many-objective problems where crossover is provably essential
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6869563)
