Statistical distribution of the convergence time of evolutionary algorithms for long-path problems

  title={Statistical distribution of the convergence time of evolutionary algorithms for long-path problems},
  author={Josselin Garnier and Leila Kallel},
  journal={IEEE Trans. Evolutionary Computation},
| The behavior of a (1+1)-ES process on Rudolph's binary long k-paths is investigated extensively in the asymptotic framework with respect to string length l. First, the case of k = l is addressed. For 1=2, we prove that the long k-path is a longpath for the (1+1)-ES, in the sense that the process follows the entire path with no shortcuts resulting in an exponential expected convergence time. For < 1=2, the expected convergence time is also exponential but some shortcuts occur meanwhile that… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.
26 Citations
16 References
Similar Papers


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


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

Handbook of mathematical func- tions

  • M. Abramowitz, I. Stegun
  • Dover publications,
  • 1965
Highly Influential
4 Excerpts

Rigourous results of the rst hitting times of some Markov chains

  • J. Garnier, L. Kallel, M. Schoenauer
  • Technical Re- port 389,
  • 1998

A priori predictions of operator ef- ciency

  • L. Kallel, M. Schoenauer
  • Arti cial Evolution'97,
  • 1997

Making genetic algorithms y: a lesson from the wright brothers

  • D. E. Goldberg
  • Advanced Technology for Developpers,
  • 1993
1 Excerpt

Similar Papers

Loading similar papers…