When is an estimation of distribution algorithm better than an evolutionary algorithm?

2009 IEEE Congress on Evolutionary Computation, CEC 2009

Volumn , Issue , 2009, Pages 1470-1477

  Chen, Tianshi ^a   Lehre, Per Kristian ^b   Tang, Ke ^a   Yao, Xin ^b  

^a UNIVERSITY OF SCIENCE AND TECHNOLOGY OF CHINA   (China)

^b UNIVERSITY OF BIRMINGHAM   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ESTIMATION OF DISTRIBUTION ALGORITHMS; FUNDAMENTAL RESEARCH; GAINING INSIGHTS; KEY FACTORS; OPTIMISATIONS; SUBSTRING; UNIVARIATE MARGINAL DISTRIBUTION ALGORITHMS;

COMPUTATIONAL EFFICIENCY; HEURISTIC ALGORITHMS; MULTIOBJECTIVE OPTIMIZATION; PARAMETERIZATION;

EVOLUTIONARY ALGORITHMS;

EID: 70449989345     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.2009.4983116     Document Type: Conference Paper

References (21)

1. P. Larrañaga and J. A. Lozano, Eds., Estimation of Distribution Algorithms. A New Tool for Evolutionary Computation. Boston: Kluwer Academic Publishers, 2002.
2. R. Sagarna, A. Arcuri, and X. Yao, "Estimation of distribution algorithms for testing object oriented software, " in Proceedings of 2007 IEEE Congress on Evolutionary Computation (CEC'07), 2007, pp. 438-444.
3. M. Pelikan, K. Sastry, and D. E. Goldberg, "Scalability of the bayesian optimization algorithm, " International Journal of Approximate Reasoning, vol.31, no.3, pp. 221-258, November 2002.
4. P. S. Oliveto, J. He, and X. Yao, "Time complexity of evolutionary algorithms for combinatorial optimization: A decade of results, " International Journal of Automation and Computing, vol.4, no.1, pp. 100-106, 2007.
5. S. Droste, T. Jansen, and I. Wegener, "On the analysis of the (1+1) Evolutionary Algorithm, " Theoretical Computer Science, vol.276, no.1-2, pp. 51-81, 2002.
6. 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. on Evolutionary Computation, vol.6, no.5, pp. 495-511, 2002.
7. J. He, X. Yao, and J. Li, "A comparative study of three evolutionary algorithms incorporating different amount of domain knowledge for node covering problems, " IEEE Trans. on Systems, Man and Cybernetics, Part C, vol.35, no.2, pp. 266-271, 2005.
8. P. S. Oliveto, J. He, and X. Yao, "Evolutionary algorithms and the vertex cover problem, " in In Proceedings of the IEEE Congress on Evolutionary Computation (CEC'07), 2007, pp. 1870-1877.
9. -, "Analysis of population-based evolutionary algorithms for the vertex cover problem, " in Proceedings of IEEE World Congress on Computational Intelligence (WCCI'08), Hong Kong, June 1-6, 2008, 2008, pp. 1563-1570.
10. S. Droste, "A rigorous analysis of the compact genetic algorithm for linear functions, " Natural Computing, vol.5, no.3, pp. 257-283, 2006.
11. T. Chen, K. Tang, G. Chen, and X. Yao, "On the analysis of average time complexity of estimation of distribution algorithms, " in Proceedings of 2007 IEEE Congress on Evolutionary Computation (CEC'07), September 2007, pp. 453-460.
12. -, "Rigorous time complexity analysis of univariate marginal distribution algorithm with margins, " in Proceedings of 2009 IEEE Congress on Evolutionary Computation (CEC'09), May 2009.
13. -, "Analysis of computational time of simple estimation of distribution algorithms, " submitted to IEEE Trans. on Evolutionary Computation on 26/11/2007.
14. C. Gonzáles, "Contributions on theoretical aspects of estimation of distribution algorithms, " Ph.D. dissertation, University of the Basque Country, November 2005.
15. R. Motwani and P. Raghavan, Randomized Algorithms. Cambridge University Press, 1995.
16. W. Hoeffding, "Probability inequalities for sums of bounded random variables, " Journal of the American Statistical Association, vol.58, no.301, pp. 13-30, 1963. [Online]. Available: http://www.jstor.org/stable/ 2282952
17. R. J. Serfling, "Probability inequalities for the sum in sampling without replacement, " Annals of Statistics, vol.2, no.1, pp. 39-48, 1974.
18. J. He and X. Yao, Drift analysis and average time complexity of evolutionary algorithms, " Artificial Intelligence, vol. 127, no. 1, pp. 57-85, March 2001. (Pubitemid 32264935)
19. T. Chen, J. He, G. Sun, G. Chen, and X. Yao, "A new approach to analyzing average time complexity of population-based evolutionary algorithms on unimodal problems, " IEEE Trans. on Systems, Man, and Cybernetics, Part B, accepted in December 2008.
20. J. He and X. Yao, "A study of drift analysis for estimating computation time of evolutionary algorithms, " Natural Computing, vol.3, no.1, pp. 21-35, 2004.
21. P. S. Oliveto and C. Witt, "Simplified drift analysis for proving lower bounds in evolutionary computation, " in Proceedings of Parallel Problem Solving from Nature (PPSN'X), ser. LNCS, no.5199, 2008, pp. 82-91.