Analysis of estimation of distribution algorithms and genetic algorithms on NK landscapes

GECCO'08: Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation 2008

Volumn , Issue , 2008, Pages 1033-1040

  Pelikan, Martin ^a  

^a UNIVERSITY OF MISSOURI ST LOUIS   (United States)

Author keywords

Algorithms; Performance

Indexed keywords

ALGORITHMS; BRANCH AND BOUND METHOD;

BRANCH-AND-BOUND ALGORITHMS; CROSSOVER OPERATOR; ESTIMATION OF DISTRIBUTION ALGORITHMS; HIERARCHICAL BAYESIAN OPTIMIZATION ALGORITHMS; PERFORMANCE; PROBLEM INSTANCES; SIMPLE GENETIC ALGORITHM; UNIVARIATE MARGINAL DISTRIBUTION ALGORITHMS;

GENETIC ALGORITHMS;

EID: 57349116040     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1389095.1389287     Document Type: Conference Paper

References (23)

1. H. E. Aguirre and K. Tanaka. Genetic algorithms on nk-landscapes: Effects of selection, drift, mutation, and recombination. In G. R. Raidi et al., editors, Applications of Evolutionary Computing: Evo Workshops 2003, pages 131-142, 2003.
2. L. Altenberg. NK landscapes. In T. Bäck, D. B. Fogel, and Z. Michalewicz, editors, Handbook of Evolutionary Computation, pages B2.7:5-10. Institute of Physics Publishing and Oxford University Press, Bristol, New York, 1997.
3. S. Baluja. Population-based incremental learning: A method for integrating genetic search based function optimization and competitive learning. Tech. Rep. No. CMU-CS-94-163, Carnegie Mellon University, Pittsburgh, PA, 1994.
4. P. A. N. Bosnian and D. Thierens. Continuous iterated density estimation evolutionary algorithms within the IDEA framework. Workshop Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2000), pages 197-200, 2000.
5. D. M. Chickering, D. Heckerman, and C. Meek. A Bayesian approach to learning Bayesian networks with local structure. Technical Report MSR-TR-97-07, Microsoft Research, Redmond, WA, 1997.
6. S.-S. Choi, K. Jung, and J. H. Kim. Phase transition in a random NK landscape model. pages 1241-1248, 2005.
7. N. Friedman and M. Goldszmidt. Learning Bayesian networks with local structure. In M. I. Jordan, editor, Graphical models, pages 421-459. MIT Press, Cambridge, MA, 1999.
8. Y. Gao and J. C. Culberson. An analysis of phase transition in NK landscapes. Journal of Artificial Intelligence Research (JAIR), 17:309-332, 2002.
9. D. E. Goldberg. Genetic algorithms in search, optimization, and machine learning. Addison-Wesley, Reading, MA, 1989.
10. G. R. Harik. Finding multimodal solutions using restricted tournament selection. Proceedings of the International Conference on Genetic Algorithms (ICGA-95), pages 24-31, 1995.
11. D. Heckerman, D. Geiger, and D. M. Chickering. Learning Bayesian networks: The combination of knowledge and statistical data. Technical Report MSR-TR-94-09, Microsoft Research, Redmond, WA, 1994.
12. J. H. Holland. Adaptation in natural and artificial systems. University of Michigan Press, Ann Arbor, MI, 1975.
13. S. Kauffman. Adaptation on rugged fitness landscapes. In D. L. Stein, editor, Lecture Notes in the Sciences of Complexity, pages 527-618. Addison Wesley, 1989.
14. S. Kauffman. The origins of Order: Self-organization and election in evolution. Oxford University Press, 1993.
15. P. Larrañaga and J. A. Lozano, editors. Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation. Kluwer, Boston, MA, 2002.
16. H. Mühlenbein and G. Paaß. From recombination of genes to the estimation of distributions I. Binary parameters. Parallel Problem Solving from Nature, pages 178-187, 1996.
17. M. Pelikan. Hierarchical Bayesian optimization algorithm: Toward a new generation of evolutionary algorithms. Springer, 2005.
18. M. Pelikan and D. E. Goldberg. Escaping hierarchical traps with competent genetic algorithms. Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2001), pages 511-518, 2001.
19. M. Pelikan and D. E. Goldberg. Hierarchical BOA solves Ising spin glasses and maxsat. Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2003), 11:1275-1286, 2003.
20. M. Pelikan, D. E. Goldberg, and F. Lobo. A survey of optimization by building and using probabilistic models. Computational Optimization and Applications, 21(1):5-20, 2002.
21. M. Pelikan, H. G. Katzgraber, and S. Kobe. Finding ground states of Sherrington-Kirkpatrick spin glasses with hierarchical BOA and genetic algorithms. MEDAL Report No. 2008004, Missouri Estimation of Distribution Algorithms Laboratory, University of Missouri-St. Louis, St. Louis, MO, 2008.
22. K. Sastry. Evaluation-relaxation schemes for genetic and evolutionary algorithms. Master's thesis, University of Illinois at Urbana-Champaign, Department of General Engineering, Urbana, IL, 2001.
23. A. H. Wright, R. K. Thompson, and J. Zhang. The computational complexity of N-K fitness functions. IEEE Transactions Evolutionary Computation, 4(4):373-379, 2000.