Rigorous Hitting Times for Binary Mutations

@article{Garnier1999RigorousHT,
  title={Rigorous Hitting Times for Binary Mutations},
  author={Josselin Garnier and Leila Kallel and Marc Schoenauer},
  journal={Evolutionary Computation},
  year={1999},
  volume={7},
  pages={173-203}
}
In the binary evolutionary optimization framework, two mutation operators are theoretically investigated. For both the standard mutation, in which all bits are flipped independently with the same probability, and the 1-bit-flip mutation, which flips exactly one bit per bitstring, the statistical distribution of the first hitting times of the target are thoroughly computed (expectation and variance) up to terms of order l (the size of the bitstrings) in two distinct situations: without any… CONTINUE READING
Highly Influential
This paper has highly influenced 13 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 106 extracted citations

Precise Runtime Analysis for Plateaus

View 4 Excerpts
Highly Influenced

Asymptotic Hitting Time for a Simple Evolutionary Model of Protein Folding

Claude Bernard Lyon
2005
View 4 Excerpts
Highly Influenced

On the analysis of a dynamic evolutionary algorithm

J. Discrete Algorithms • 2006
View 5 Excerpts
Highly Influenced

On the Optimization of Monotone Polynomials by Simple Randomized Search Heuristics

Combinatorics, Probability & Computing • 2005
View 3 Excerpts
Highly Influenced

References

Publications referenced by this paper.
Showing 1-10 of 32 references

Optimal Mutation Rates in Genetic Search

ICGA • 1993
View 4 Excerpts
Highly Influenced

Convergence of Non-Elitist Strategies

International Conference on Evolutionary Computation • 1994
View 4 Excerpts
Highly Influenced

Adaptation in natural and artzfiial systems, University of Michigan Press, Ann Arbor, Michigan

J. H. Holland
1975
View 4 Excerpts
Highly Influenced

A rigorous complexity analysis of the [ 1 + 1 ) evolutionary algorithm for linear Functions with boolean inputs

S. Droste, T. Jansen, I. Ii'egener
P ~ oreedings cif ' the Fzjfh IEEE lntet - nntional Conjiem 1 i . c 017 Edz 1 tio 11 n 7 y Cnniprrtirtio • 1998
View 1 Excerpt

Computation time of evolutionary operators

G. Rudolph, J. Ziegenhirt
997b). Convergence Properties of Evobtionaly Algorithms. Diploma thesis, • 1997

An as ! - mptotic theory of gcnctic algorithms

E. Lutton, E. Ronald, +4 authors h 1. Chakraborty
1996

Similar Papers

Loading similar papers…