Bounds for probability of success of classical genetic algorithm based on Hamming distance

IEEE Transactions on Evolutionary Computation

Volumn 10, Issue 1, 2006, Pages 1-18

  Yuen, Shiu Yin ^a   Cheung, Bernard K S ^b  

^a CITY UNIVERSITY OF HONG KONG   (Hong Kong)

^b GERAD   (Canada)

Author keywords

Aggregation; Convergence rate; Evolutionary algorithms (EAs); First passage probability; First passage time; Genetic algorithms (GAs); Markov chain (MC); Perfect lumping; Probability of success

Indexed keywords

APPROXIMATION THEORY; BOUNDARY CONDITIONS; COMPUTER SIMULATION; CONVERGENCE OF NUMERICAL METHODS; GLOBAL OPTIMIZATION; MARKOV PROCESSES; MATHEMATICAL MODELS; PROBABILITY;

CONVERGENCE RATE; FIRST PASSAGE PROBABILITY; FIRST PASSAGE TIME; HAMMING DISTANCE; PERFECT LUMPING; PROBABILITY OF SUCCESS;

GENETIC ALGORITHMS;

EID: 31744445201     PISSN: 1089778X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TEVC.2005.851401     Document Type: Article

References (43)

1. J. H. Holland, Adaptation in Natural and Artificial Systems. Ann Arbor, MI: Univ. Michigan Press, 1975.
2. G. Rudolph, "Finite Markov chain results in evolutionary computation: A tour d'horizon," Fundamenta Informaticae, vol. 35, pp. 67-89, 1998.
3. G. Rudolph, "Convergence analysis of canonical genetic algorithms," IEEE Trans. Neural Netw., vol. 5, no. 1, pp. 96-101, Jan. 1994.
4. Y. Rabani, Y. Rabinovich, and A. Sinclair, "A computational view of population genetics;" Random Struct. Algorithms, vol. 12, no. 4, pp. 313-34, 1998.
5. D. Greenhalgh and S. Marshall, "Convergence criteria for genetic algorithms," SIAM J. Comput., vol. 30, no. 1, pp. 269-282, 2000.
6. H. Aytug and G. J. Koehler, "New stopping criterion for genetic algorithms," Eur. J. Oper Res., vol. 126, pp. 662-674, 2000.
7. O. Francois, "Large deviations, evolutionary computation and comparisons of algorithms," Lecture Notes in Computer Science, vol. 1917, pp. 79-88, 2000.
8. J. He and X. Yao, "Drift analysis and average time complexity of evolutionary algorithms," Artif. Intell., vol. 127, pp. 57-85, 2001.
9. J. He and X. Yao "From an individual to a population: An analysis of the first hitting time of population-based evolutionary algorithms," IEEE Trans. Evol. Comput., vol. 6, no. 5, pp. 495-511, Oct. 2002.
10. J. He and X. Yao "Toward an analytic framework for analyzing the computation time of evolutionary algorithms," Artif. Intell., vol. 145, pp. 59-97, 2003.
11. Y. Rabinovich and A. Wigderson, "Techniques for bounding the convergence rate of genetic algorithms," Random Structures and Algorithms, vol. 14, no. 2, pp. 111-138, 1999.
12. M. D. Vose, "Logarithmic convergence of random heuristic search," Evol. Comput., vol. 4, no. 4, pp. 395-404, 1997.
13. T. Bäck, "The interaction of mutation rate, selection and self-adaptation within a genetic algorithm," in Parallel Problem Solving from Nature, R. Manner and B. Manderick, Eds. Amsterdam, The Netherlands: North-Holland, 1992, vol. 2, pp. 85-94.
14. H. Mühlenbein, "How genetic algorithms really work: Mutation and hill climbing," ibid, pp. 15-25, 1992.
15. M. D. Vose and G. E. Liepins, "Punctuated equilibria in genetic search," Complex Syst., vol. 5, pp. 31-44, 1991.
16. A. E. Nix and M. D. Vose, "Modeling genetic algorithms with Markov chains," Ann. Math. Artif. Intell., vol. 5, pp. 79-88, 1992.
17. M. Iosifescu, Finite Markov Processes and their Applications. New York: Wiley, 1980.
18. A. E. Eiben and G. Rudolph, "Theory of evolutionary algorithms: A bird eye view," Theoret. Comput. Sci., vol. 229, pp. 3-9, 1999.
19. C. R. Reeves and J. E. Rowe, Genetic Algorithms - Principles and Perspectives: A Guide to GA Theory. Norwell, MA: Kluwer, 2003.
20. G. J. Koehler, "A proof of the Vose-Liepins conjecture," Ann. Math. Artif. Intell., vol. 10, pp. 409-422, 1994.
21. S. M. Ross, Introduction to Probability Models, 7th ed. New York: Academic, 2000.
22. T. E. Davis and J. C. Principe, "A Markov chain framework for the simple genetic algorithm," Evol. Comput., vol. 1, no. 3, pp. 269-288, 1993.
23. P. Vitányi, "A discipline of evolutionary programming," Theoret. Comput. Sci., vol. 241, pp. 3-23, 2000.
24. J. Suzuki, "A Markov chain analysis on simple genetic algorithms," IEEE Trans. Syst., Man, Cybern., vol. 25, no. 4, pp. 655-659, 1995.
25. H. Aytug and G. J. Koehler, "Stopping criteria for finite length genetic algorithms," Informs J. Comput., vol. 8, no. 2, pp. 183-191, 1996.
26. D. H. Wolpert and W. G. Macready, "No free lunch theorems for optimization," IEEE Trans. Evol. Comput., vol. 1, no. 1, pp. 67-82, Apr. 1997.
27. B. Hajek, "Hitting time and occupation time bounds implied by drift analysis with applications," Adv. Appl. Probab., vol. 14, pp. 502-525, 1982.
28. J. Garnier, L. Kallel, and M. Schoenauer, "Rigorous hitting times for binary mutations," Evol. Comput., vol. 7, no. 2, pp. 173-203, 1999.
29. M. D. Vose, The Simple Genetic Algorithm. Cambridge, MA: MIT Press, 1999.
30. H. Geiringer, "On the probability theory of linkage in Mendelian heredity" Ann. Math. Statist., vol. 15, pp. 25-37, 1944.
31. S. Y. Yuen, C. K. Fong, and H. S. Lam, "Guaranteeing the probability of success using repeated runs of genetic algorithms," Image and Vision Computing, vol. 19, no. 8, pp. 551-560, 2001. (The terminology originally used in [31] is somewhat confusing. In fact, the procedure is to estimate the lower confidence bound and the confidence level rather than testing a fixed hypothesis with a level of significance, though the two procedures turn out to be the same. For [32], it can be interpreted both ways. See [34, pp. 89-94] for statistical definitions.).
32. S. Y. Yuen, H. S. Lam, C. K. Fong, S. F. Chen, and C. K. Chow, "A robust iterative hypothesis testing design of the repeated genetic algorithm," Image Vision Comput., vol. 23, no. 11, pp. 972-980, 2005.
33. H. P. J. Bolton, A. A. Groenwold, and J. A. Snyman, "The application of a unified Bayesian stopping criterion in competing parallel algorithms for global optimization," Comput. Math. Applicat., vol. 48, pp. 549-560, 2004.
34. E. L. Lehmann, Testing Statistical Hypotheses, 2nd ed. New York: Wiley, 1986.
35. Handbook of Evolutionary Computation, T. Back, D. B. Fogel, and Z. Michalewicz, Eds., Oxford Univ. Press, London, U.K., 1997. G. Rudolph "Genetic algorithms," B.2.4.2.
36. W. M. Spears and K. A. De Jong, "Analyzing GA's using Markov models with semantically ordered and lumped states," in Foundations of Genetic Algorithms, R. K. Belew and M. D. Vose, Eds. San Francisco, CA: Morgan Kaufmann, 1997, vol. 4, pp. 85-100.
37. C. C. J. Moey and J. E. Rowe, "Population aggregation based on fitness," Natural Computing, vol. 3, pp. 5-19, 2004.
38. C. C. J. Moey, E. Rowe, "A reduced Markov model of GAs without the exact transition matrix," Lecture Notes in Computer Science, vol. 3242, pp. 72-80, 2004.
39. W. A. Kosters, J. N. Kok, and P. Floréen, "Fourier analysis of genetic algorithms," Theoret. Comput. Sci., vol. 229, pp. 143-75, 1999.
40. M. Srinivas and L. M. Patnaik, "On an exact populationary model of genetic algorithms," Inf. Sci., vol, 99, pp. 37-67, 1997.
41. M. Srinivas and L. M. Patnaik, "On modeling genetic algorithms for functions of unitation," IEEE Trans. Syst., Man, Cybern., pt. B, vol. 26, no. 6, pp. 809-821, Dec. 1996.
42. T. Jansen and I. Wegener, "The analysis of evolutionary algorithms - A proof that crossover really can help," Algorithmica, vol. 34, pp. 47-66, 2002.
43. J. Suzuki, "A farther result on the Markov chain model of genetic algorithms and its application to a simulated annealing-like strategy," IEEE Trans. Syst., Man, Cybern., pt. B, vol. 28, no. 1, pp. 95-102, Feb. 1998.