On the scalability of real-coded Bayesian optimization algorithm

IEEE Transactions on Evolutionary Computation

Volumn 12, Issue 3, 2008, Pages 307-322

  Ahn, Chang Wook ^a,b   Ramakrishna, R S ^a  

^a Gwangju Institute of Science and Technology (GIST)   (South Korea)

^b Sungkyunkwan University   (South Korea)

Author keywords

Decomposable problems; Estimation of distribution algorithms (EDAs); Probabilistic models; Real coded Bayesian optimization algorithm (rBOA); Scalability

Indexed keywords

CONTINUOUS DOMAINS; CONVERGENCE TIME; DECOMPOSABLE PROBLEMS; ESTIMATION OF DISTRIBUTION ALGORITHMS (EDAS); EVOLUTIONARY OPTIMIZATIONS; NUMERICAL OPTIMIZATIONS; POPULATION SIZES; PROBABILISTIC MODELS; PROBLEM SIZES; REAL-CODED BAYESIAN OPTIMIZATION ALGORITHM (RBOA); REAL-VALUED VARIABLES; SCALE-UP; THEORETICAL BASIS;

BAYESIAN NETWORKS; ELECTRIC NETWORK ANALYSIS; ESTIMATION; FUNCTION EVALUATION; OPTIMIZATION; POPULATION STATISTICS; PROBABILITY DISTRIBUTIONS; SCALABILITY;

EVOLUTIONARY ALGORITHMS;

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

References (38)

1. P. Larrañaga and J. A. Lozano, Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation. Norwell, MA: Kluwer, 2002.
2. M. Pelikan, D. E. Goldberg, and F. G. Lobo, "A survey of optimization by building and using probabilistic models," Comput. Opt. Appl., vol. 21, no. 1, pp. 5-20, 2002.
3. M. Pelikan, "Bayesian optimization algorithm: From single level to hierarchy," Ph.D. dissertation, Univ. Illinois at Urbana-Champaign, Urbana, IL, 2002.
4. J. Ocenasek, "Parallel estimation of distribution algorithms," Ph.D. dissertation, Brno Univ. Technology, Brno, Czech, 2002.
5. P. A. N. Bosman, "Design and application of iterated density-estimation evolutionary algorithms," Ph.D. dissertation, Utrecht Univ., TB Utrecht, The Netherlands, 2003.
6. C. W. Ahn, D. E. Goldberg, and R. S. Ramakrishna, "Real-coded Bayesian optimization algorithm: Bringing the strength of BOA into the continuous world," in Proc. Genetic Evol. Comput. Conf. - GECCO 2004, 2004, vol. 3102, Lecture Notes in Computer Science, pp. 840-851.
7. C. W. Ahn, Advances in Evolutionary Algorithms: Theory, Design and Practice. New York: Springer, 2006.
8. H. Mühlenbein and T. Mahnig, "FDA - A scalable evolutionary algorithm for the optimization of additively decomposed function," Evol. Comput., vol. 7, no. 4, pp. 353-376, 1999.
9. P. Larrañaga, R. Etxeberria, J. A. Lozano, and J. M. Peña, "Combinatorial optimization by learning and simulation of Bayesian networks," in Proc. 16th Conf. Uncertainty Artif. Intell., 2000, pp. 343-352.
10. M. Pelikan, D. E. Goldberg, and E. Cantú-Paz, "BOA - The Bayesian optimization algorithm," in Proc. Genetic Evol. Comput. Conf., 1999, pp. 525-532.
11. P. Larrañaga, J. A. Lozano, and E. Bengoetxea, "Estimation of distribution algorithms based on multivariate normal and Gaussian networks," Dept. Comput. Sci. Artif. Intel., Univ. Basque Country, Vizcaya, Spain, Tech. Rep. KZZA-1K-1-01, 2001.
12. P. A. N. Bosman and D. Thierens, "Advancing continuous IDEAs with mixture distributions and factorization selection metrics," in Proc. OBUPM Workshop Genectic Evol. Comput. Conf., 2001, pp. 208-212.
13. J. Ocenasek and J. Schwarz, "Estimation of distribution algorithm for mixed continuous-discrete optimization problems," in Proc. 2nd Int. Symp. Comput. Intell., 2002, pp. 115-120.
14. S. Kern, S. D. Müller, N. Hansen, D. Buche, J. Ocenasek, and P. Koumoutsakos, "Learning probability distributions in continuous evolutionary algorithms - A comparative review," Natural Computing vol. 3, no. 1, pp. 77-112, 2004.
15. G. Rudolph, Convergence Properties of Evolutionary Algorithms. Hamburg, Germany: Verlag Dr. Kovac, 1997.
16. S. Droste, T. Jansen, and I. Wegener, "A rigorous complexity analysis of (1 + 1) evolutionary algorithm for linear functions with Boolean input," Evol. Comput., vol. 6, no. 2, pp. 185-196, 1998.
17. 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.
18. J. He and X. Yao, "Towards an analytic framework for analyzing the computation time of evolutionary algorithms," Artif. Intell., vol. 145, pp. 59-97, 2003.
19. J. He and X. Yao, "A study of drift analysis for estimating computation time of evolutionary algorithms," Natural Comput., vol. 3, pp. 21-35, 2004.
20. Q. Zhang, "On stability of fixed points of limit models of univariate marginal distribution algorithm and factorized distribution algorithm," IEEE Trans. Evol. Comput., vol. 8, no. 1, pp. 80-93, Feb. 2004.
21. M. Pelikan, K. Sastry, and D. E. Goldberg, "Scalability of the Bayesian optimization algorithm," Int. J. Approximate Reasoning, vol. 31, no. 3, pp. 221-258, 2002.
22. X. Qi and F. Palmieri, "Theoretical analysis of evolutionary algorithms with an infinite population size in continuous space, Part I: Basic properties of selection and mutation," IEEE Trans. Neural Netw., vol. 5, no. 1, pp. 102-119, 1994.
23. X. Qi and F. Palmieri, "Theoretical analysis of evolutionary algorithms with an infinite population size in continuous space, Part II: Analysis of the diversification role of crossover," IEEE Trans. Neural Netw. vol. 5, no. 1, pp. 120-129, 1994.
24. H. Kita, I. Ono, and S. Kobayashi, "Theoretical analysis of the unimodal normal distribution crossover for real-coded genetic algorithms," in Proc. IEEE ICEC, 1998, pp. 529-534.
25. C. González, J. A. Lozano, and P. Larrañaga, "Mathematical modelling of UMDA algorithm with tournament selection. Behavior on linear and quadratic functions," Int. J. Approximate Reasoning, vol. 31, no. 3, pp. 313-340, 2002.
26. Q. Zhang and H. Mühlenbein, "On the convergence of a class of estimation of distribution algorithms," IEEE Trans. Evol. Comput. vol. 8, no. 2, pp. 127-136, Apr. 2004.
27. Q. Zhang, "On the convergence of a factorized distribution algorithm with truncation selection," Complexity, vol. 9, no. 4, pp. 17-23, 2004.
28. G. McLachlan and D. Peel, Finite Mixture Models. New York: Wiley, 2000.
29. J. Hartigan, Clustering Algorithms. New York: Wiley, 1975.
30. S. L. Lauritzen, Graphical Models. Oxford, U.K.: Clarendon Press, 1996.
31. D. Heckerman, D. Geiger, and D. M. Chickering, "Learning Bayesian networks: The combination of knowledge and statistical data," Microsoft Research, Redmond, WA, Tech. Rep. MSR-TR-94-09, 1994.
32. M. Henrion, "Propagating uncertainty in Bayesian networks by probabilistic logic sampling," in Uncertainty in Artificial Intelligence 2. New York: Elsevier Science, 1988, pp. 149-163.
33. C. W. Ahn and R. S. Ramakrishna, "A genetic algorithm for shortest path routing problem and the sizing of populations," IEEE Trans. Evol. Comput., vol. 6, no. 6, pp. 566-579, Dec. 2002.
34. D. E. Goldberg, The Design of Innovation: Lessons From and for Competent Genetic Algorithms. Norwell, MA: Kluwer.
35. C. W. Ahn and R. S. Ramakrishna, "Building-block supply in realcoded genetic algorithms: A first step on the population-sizing model," IEICE Trans. Fundamentals of Electron., Commun., Comput. Sci., vol. E89-A, no. 7, pp. 2072-2078, 2006.
36. G. Harik, E. Cantú-Paz, D. E. Goldberg, and B. L. Miller, The gambler's ruin problem, genetic algorithms, and the sizing of populations," Evol. Comput., vol. 7, no. 3, pp. 231-253, 1999.
37. D. Thierens, D. E. Goldberg, and A. G. Pereira, "Domino convergence, drift, and the temporal-silence structure of problems," in Proc. IEEE World Congr. Comput. Intell., 1998, pp. 535-540.
38. H. H. Rosenbrock, "An automatic method for finding the greatest or least value of a function," Comput. J., vol. 3, no. 3, pp. 175-184, 1960.