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

IEEE Transactions on Evolutionary Computation

Volumn 4, Issue 1, 2000, Pages 16-30

  Garnier, Josselin ^a   Kallel, Leila ^a  

^a ECOLE POLYTECHNIQUE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CONVERGENCE OF NUMERICAL METHODS; STATISTICAL METHODS;

EVOLUTIONARY ALGORITHMS; LONG-PATH PROBLEMS;

ALGORITHMS;

EID: 0033741429     PISSN: 1089778X     EISSN: None     Source Type: Journal    
DOI: 10.1109/4235.843492     Document Type: Article

References (17)

1. M. Abramowitz and I. Stegun, Handbook of Mathematical Functions, New York: Dover, 1965.
2. D. Chowdhury, Spin Glasses and Other Frustrated Systems. Singapore: World Scientific, 1986.
3. [31 W. Feller, An Introduction to Probability Theory and Its Applications, New York: Wiley, 1971.
4. S. Forrest and M. Mitchell, "Relative building-block fitness and the building-block hypothesis," in Foundations of Genetic Algorithms 2. San Mateo, CA: Morgan Kaufmann, 1993, pp. 109-126.
5. J. Garnier, L. Kallel, and M. Schoenauer, "Rigourous results of the first hitting times of some Markov chains," CMAP, Ecole Polytechnique, Tech. Rep. 389, June 1998.
6. D. E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning. Reading, MA: Addison-Wesley, 1989.
7. _, "Making genetic algorithms fly: A lesson from the Wright brothers," Adv. Technol. Developers, vol. 2, pp. 1-8, Feb. 1993.
8. I. Guikhman and A. Skorokhod, Introduction á la Théorie des Processus Aléatoires. Moscow, U.S.S.R.: Mir, 1986.
9. C. Höhn and C. Reeves, "Are long path problems hard for genetic algorithms?," in Proc. 4th Conf. Parallel Probl. Solving from Nature, H.-M. Voigt, W. Ebeling, I. Rechenberg, and H.-P. Schwefel, Eds. Berlin, Germany: Springer-Verlag, 1996, vol. LNCS 1141, pp. 134-143.
10. J. Horn, D. E. Goldberg, and K. Deb, "Long path problems," in Proc. 3rd Conf. Parallel Probl. Solving from Nature, Y. Davidor, H.-P. Schwefel, and R. Manner, Eds. Berlin, Germany: Springer-Verlag, 1994, pp. 149-158.
11. L. Kallel and B. Naudts, "Candidate long paths for the simple genetic algorithm," in Foundations of Genetic Algorithms 5, W. Banzhaf and C. Reeves, Eds. San Mateo, CA: Morgan Kaufmann, 1998.
12. L. Kallel and M. Schoenauer, "A priori predictions of operator efficiency," in Artif. Evol.'97, J.-K. Hao, E. Lutton, E. Ronald, M. Schoenauer, and D. Snyers, Eds. Berlin, Germany: Springer-Verlas, LNCS, Oct. 1997, pp. 287-299.
13. M. Mitchell, S. Forrest, and J. H. Holland, "The Royal Road for genetic algorithms: Fitness landscapes and GA performance," in Proc. 1st European Conf. Artif. Life'93, F. J. Varela and P. Bourgine, Eds. Cambridge, MA: M.I.T. Press/Bradford, 1993, pp. 245-254.
14. M. Mitchell and J. H. Holland, "When will a genetic algorithm outperform hill-climbing?," in Proc. 5th Int. Conf. Genetic Algorithms, S. Forrest, Ed. San Mateo, CA: Morgan Kaufmann, 1993, p. 647.
15. G. Rudolph, "Convergence of nonelitist strategies," in Proc. 1st IEEE Int. Conf. Evol. Comput., Z. Michalewicz, J. D. Schaffer, H.-P. Schwefel, D. B. Fogel, and H. Kitano, Eds. Piscataway, NJ: IEEE Press, 1994, pp. 63-66.
16. D. W. Stroock, An Introduction to the Theory of Large Deviations, New York: Springer, 1984.
17. J. Garnier, L. Kallel, and M. Schoenauer, "Rigourous results of the first hitting times of some Markov chains," Evol. Comput., vol. 7, pp. 143-203, 1999.