Improved time complexity analysis of the simple genetic algorithm
From MaRDI portal
Recommendations
- On the runtime analysis of the simple genetic algorithm
- On the benefits of populations for the exploitation speed of standard steady-state genetic algorithms
- The effect of multiple optima on the simple GA run-time complexity
- Population size versus runtime of a simple evolutionary algorithm
- A tight runtime analysis for the \((\mu + \lambda)\) EA
Cites work
- Analyzing evolutionary algorithms. The computer science perspective.
- Bioinspired computation in combinatorial optimization. Algorithms and their computational complexity
- Black-box search by unbiased variation
- Hitting-time and occupation-time bounds implied by drift analysis with applications
- scientific article; zbMATH DE number 194544 (Why is no real title available?)
- scientific article; zbMATH DE number 5686753 (Why is no real title available?)
- scientific article; zbMATH DE number 3349081 (Why is no real title available?)
- On the runtime analysis of the simple genetic algorithm
- Optimizing expected path lengths with ant colony optimization using fitness proportional update
- Probability with Martingales
- Real royal road functions -- where crossover provably is essential
- Simplified drift analysis for proving lower bounds in evolutionary computation
Cited in
(31)- Finite-time performance analysis for genetic algorithms
- Upper bounds on the running time of the univariate marginal distribution algorithm on OneMax
- On the choice of the update strength in estimation-of-distribution algorithms and ant colony optimization
- How to escape local optima in black box optimisation: when non-elitism outperforms elitism
- Tight bounds on the expected runtime of a standard steady state genetic algorithm
- Does comma selection help to cope with local optima?
- Analysis of the (1 + 1) EA on subclasses of linear functions under uniform and linear constraints
- Lower bounds on the run time of the univariate marginal distribution algorithm on OneMax
- On the benefits of populations for the exploitation speed of standard steady-state genetic algorithms
- Exponential upper bounds for the runtime of randomized search heuristics
- Runtime analysis of evolutionary algorithms via symmetry arguments
- Multiplicative up-drift
- Lower bounds on the runtime of crossover-based algorithms via decoupling and family graphs
- On the runtime analysis of the simple genetic algorithm
- Artificial immune systems can find arbitrarily good approximations for the NP-hard number partitioning problem
- Stochastic runtime analysis of a cross-entropy algorithm for traveling salesman problems
- The complex parameter landscape of the compact genetic algorithm
- When move acceptance selection hyper-heuristics outperform metropolis and elitist evolutionary algorithms and when not
- How majority-vote crossover and estimation-of-distribution algorithms cope with fitness valleys
- The time complexity analysis of a class of gene expression programming
- scientific article; zbMATH DE number 6469919 (Why is no real title available?)
- Self-adjusting population sizes for the (1, )-EA on monotone functions
- FSPL: a meta-learning approach for a filter and embedded feature selection pipeline
- Two-dimensional drift analysis: optimizing two functions simultaneously can be hard
- Choosing the right algorithm with hints from complexity theory
- Self-adjusting population sizes for non-elitist evolutionary algorithms: why success rates matter
- How fitness aggregation methods affect the performance of competitive CoEAs on bilinear problems
- Runtime analysis with variable cost
- A causal framework for stochastic local search optimization algorithms
- The compact genetic algorithm struggles on cliff functions
- The effect of multiple optima on the simple GA run-time complexity
This page was built for publication: Improved time complexity analysis of the simple genetic algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q888423)
