Enhancing efficiency of hierarchical BOA via distance-based model restrictions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5199 LNCS, Issue , 2008, Pages 417-427

  Hauschild, Mark ^a   Pelikan, Martin ^a  

^a UNIVERSITY OF MISSOURI ST LOUIS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ADDITIVELY DECOMPOSABLE PROBLEMS; DISTANCE METRIC; HIERARCHICAL BAYESIAN OPTIMIZATION ALGORITHM (HBOA); HIERARCHICAL BOAS; ISING SPIN GLASSES; MINIMUM VERTEX COVERS; PROBABILISTIC MODELS; SPECIFIC KNOWLEDGES; SPEED-UP; TEST PROBLEMS; DECOMPOSABLE PROBLEMS; DISTANCE METRICS; DISTANCE-BASED MODELS; HIERARCHICAL BAYESIAN OPTIMIZATION ALGORITHMS; ISING SPIN GLASS; MINIMUM VERTEX COVER; PROBLEM-SPECIFIC KNOWLEDGE;

EVOLUTIONARY ALGORITHMS; ISING MODEL; OPTIMIZATION; SPIN GLASS; THREE DIMENSIONAL; ALGORITHMS;

PROBLEM SOLVING;

EID: 56549124449     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-87700-4_42     Document Type: Conference Paper

References (34)

1. Pelikan, M., Goldberg, D.E.: Escaping hierarchical traps with competent genetic algorithms. In: Genetic and Evolutionary Computation Conf (GECCO 2001), pp. 511-518 (2001)
2. Pelikan, M.: Hierarchical Bayesian optimization algorithm: Toward a new generation of evolutionary algorithms. Springer, Heidelberg (2005)
3. Sastry, K., Goldberg, D.E., Pelikan, M.: Don't evaluate, inherit. In: Genetic and Evolutionary Computation Conf (GECCO 2001), pp. 551-558 (2001)
4. Pelikan, M., Sastry, K.: Fitness inheritance in the Bayesian optimization algorithm. In: Genetic and Evolutionary Computation Conf (GECCO 2004), vol. 2, pp. 48-59 (2004)
5. Lima, CF., Pelikan, M., Sastry, K., Butz, M.V., Goldberg, D.E., Lobo, F.G.: Sub-structural neighborhoods for local search in the Bayesian optimization algorithm. Parallel Problem Solving from Nature, 232-241 (2006)
6. Pelikan, M., Sastry, K., Goldberg, D.E.: Sporadic model building for efficiency enhancement of hierarchical BOA. In: Genetic and Evolutionary Computation Conf (GECCO 2006), pp. 405-412 (2006)
7. Sastry, K., Pelikan, M., Goldberg, D.E.: Efficiency enhancement of estimation of distribution algorithms. In: Pelikan, M., Sastry, K., Cantú-Paz, E. (eds.) Scalable Optimization via Probabilistic Modeling: From Algorithms to Applications, pp. 161-185. Springer, Heidelberg (2006)
8. Baluja, S.: Population-based incremental learning: A method for integrating genetic search based function optimization and competitive learning. Tech. Rep. No. CMUCS-94-163, Carnegie Mellon University, Pittsburgh, PA (1994)
9. Mühlenbein, H., Paaß, G.: From recombination of genes to the estimation of distributions 1. Binary parameters. Parallel Problem Solving from Nature, 178-187 (1996)
10. Larranaga, P., Lozano, J.A. (eds.): Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation. Springer, Heidelberg (2001)
11. Schwarz, J., Ocenasek, J.: A problem-knowledge based evolutionary algorithm KBOA for hypergraph partitioning, Personal communication (2000)
12. Mühlenbein, H., Mahnig, T.: Evolutionary optimization and the estimation of search distributions with applications to graph bipartitioning. International Journal on Approximate Reasoning 31(3), 157-192 (2002)
13. Baluja, S.: Incorporating a priori knowledge in probabilistic-model based optimization. In: Pelikan, M., Sastry, K., Cantú-Paz, E. (eds.) Scalable optimization via probabilistic modeling: From algorithms to applications, pp. 205-219. Springer, Heidelberg (2006)
14. Santana, R., Larrañaga, P., Lozano, J.A.: The role of a priori information in the minimization of contact potentials by means of estimation of distribution algorithms. In: Marchiori, E., Moore, J.H., Rajapakse, J.C. (eds.) EvoBIO 2007. LNCS, vol. 4447, pp. 247-257. Springer, Heidelberg (2007)
15. Hauschild, M., Pelikan, M., Sastry, K., Goldberg, D.E.: Analyzing probabilistic models in hierarchical boa on traps and spin glasses. In: Genetic and Evolutionary Computation Conference (GECCO 2008), vol. I, pp. 523-530 (2008)
16. Larrañaga, P., Lozano, J.A. (eds.): Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation. Kluwer, Boston (2002)
17. Pelikan, M., Goldberg, D.E., Lobo, F.: A survey of optimization by building and using probabilistic models. Computational Optimization and Applications 21(1), 5-20 (2002)
18. Harik, G.R.: Finding multimodal solutions using restricted tournament selection. In: International Conference on Genetic Algorithms (ICGA 1995), pp. 24-31 (1995)
19. Howard, R.A., Matheson, J.E.: Influence diagrams. In: Howard, R.A., Matheson, J.E. (eds.) Readings on the principles and applications of decision analysis, vol. II, pp. 721-762. Strategic Decisions Group, Menlo Park (1981)
20. Pearl, J.: Probabilistic reasoning in intelligent systems: Networks of plausible inference. Morgan Kaufmann, San Mateo (1988)
21. Chickering, D.M., Heckerman, D., Meek, C: A Bayesian approach to learning Bayesian networks with local structure. Technical Report MSR-TR-97-07, Microsoft Research, Redmond, WA (1997)
22. Friedman, N., Goldszmidt, M.: Learning Bayesian networks with local structure. In: Jordan, M.I. (ed.) Graphical models, pp. 421-459. MIT Press, Cambridge (1999)
23. Pelikan, M., Kalapala, R., Hartmann, A.K.: Hybrid evolutionary algorithms on minimum vertex cover for random graphs. In: Genetic and Evolutionary Computation Conference (GECCO 2007), pp. 547-554 (2007)
24. Hauschild, M., Pelikan, M., Lima, C., Sastry, K.: Analyzing probabilistic models in hierarchical boa on traps and spin glasses. In: Genetic and Evolutionary Computation Conference (GECCO 2007), vol. I, pp. 523-530 (2007)
25. Barahona, F.: On the computational complexity of Ising spin glass models. Journal of Physics A: Mathematical, Nuclear and General 15(10), 3241-3253 (1982)
26. Pelikan, M., Sastry, K., Butz, M.V., Goldberg, D.E.: Performance of evolutionary algorithms on random decomposable problems. Parallel Problem Solving from Nature (PPSN IX), 788-797 (2006)
27. Sastry, K., Pelikan, M., Goldberg, D.E.: Empirical analysis of ideal recombination on random decomposable problems. In: Genetic and Evolutionary Computation Conference (GECCO 2007), pp. 1388-1395 (2007)
28. Pelikan, M., Sastry, K., Butz, M.V., Goldberg, D.E.: Hierarchical BOA on random decomposable problems. MEDAL Report No. 2006001, Missouri Estimation of Distribution Algorithms Laboratory, Univ. of Missouri-St. Louis (2006)
29. Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85-103. Plenum Press (1972)
30. Bollobas, B.: Random Graphs. Cambridge University Press, Cambridge (2001)
31. Weigt, M., Hartmann, A.K.: Minimal vertex covers on finite-connectivity random graphs - a, hard-sphere lattice-gas picture. Physical Review E 63, 056127 (2001)
32. Sastry, K.: Evaluation-relaxation schemes for genetic and evolutionary algorithms. Master's thesis, University of Illinois at Urbana-Champaign, Department of General Engineering, Urbana, IL (2001)
33. Pelikan, M., Sastry, K., Goldberg, D.E.: Scalability of the Bayesian optimization algorithm. International Journal of Approximate Reasoning 31(3), 221-258 (2002)
34. Goldberg, D.E.: The design of innovation: Lessons from and for competent genetic algorithms. Kluwer, Dordrecht (2002)