NK landscapes, problem difficulty, and hybrid evolutionary algorithms

Proceedings of the 12th Annual Genetic and Evolutionary Computation Conference, GECCO '10

Volumn , Issue , 2010, Pages 665-672

  Pelikan, Martin ^a  

^a UNIVERSITY OF MISSOURI ST LOUIS   (United States)

Author keywords

Algorithms; Performance

Indexed keywords

CORRELATION COEFFICIENT; ESCAPE RATE; EXPERIMENTAL STUDIES; FITNESS LANDSCAPE; FITNESS-DISTANCE CORRELATION; GLOBALOPTIMUM; HYBRID EVOLUTIONARY ALGORITHM; NEAREST-NEIGHBOR INTERACTIONS; PERFORMANCE; PROBLEM DIFFICULTY; PROBLEM PARAMETERS; TARGET CLASS;

EVOLUTIONARY ALGORITHMS;

EID: 77955866788     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1830483.1830606     Document Type: Conference Paper

References (30)

1. H. E. Aguirre andK. Tanaka. Genetic algorithms on NK-landscapes: Effects of selection, drift, mutation, and recombination. In G. R. Raidi et al., editors, Applications of Evol. Comp.: Evo Workshops 2003, pages 131-142, 2003.
2. L. Altenberg. NK landscapes. In T. Back, D. B. Fogel, and Z. Michalewicz, editors, Handbook of Evolutionary Computation, pages B2.7:5-10. Institute of Physics Publishing and Oxford University Press, 1997.
3. E. Angel andV. Zissimopoulos. Autocorrelation coefficient for the graph partitioning problem. Theoretical Computer Science, 191:229-243, 1998.
4. D. M. Chickering, D. Heckerman, andC. Meek. A Bayesian approach to learning Bayesian networks with local structure. Technical Report MSR-TR-97-07, Microsoft Research, Redmond, WA, 1997.
5. S.-S. Choi, K. Jung, andJ. H. Kim. Phase transition in a random NK landscape model. Genetic and Evolutionary Comp. Conf. (GECCO-2005), pages 1241-1248, 2005.
6. N. Friedman andM. Goldszmidt. Learning Bayesian networks with local structure. In M. I. Jordan, editor, Graphical models, pages 421-459. MIT Press, 1999.
7. Y. Gao andJ. C. Culberson. An analysis of phase transition in NK landscapes. Journal of Artificial Intelligence Research (JAIR), 17:309-332, 2002.
8. D. E. Goldberg. The design of innovation: Lessons from and for competent genetic algorithms, volume 7 of Genetic Algorithms and Evolutionary Computation. Kluwer, 2002.
9. D. E. Goldberg, K. Deb, andJ. H. Clark. Genetic algorithms, noise, and the sizing of populations. Complex Systems, 6:333-362, 1992.
10. G. R. Harik. Finding multimodal solutions using restricted tournament selection. Proc. of the Int. Conf. on Genetic Algorithms (ICGA-95), pages 24-31, 1995.
11. G. R. Harik, E. Cantú-Paz, D. E. Goldberg, andB. L. Miller. The gambler's ruin problem, genetic algorithms, and the sizing of populations. Proc. of the Int. Conf. on Evolutionary Computation (ICEC-97), pages 7-12, 1997.
12. D. Heckerman, D. Geiger, andD. M. Chickering. Learning Bayesian networks: The combination of knowledge and statistical data. Technical Report MSR-TR-94-09, Microsoft Research, Redmond, WA, 1994.
13. T. Jones andS. Forrest. Fitness distance correlation as a measure of problem difficulty for genetic algorithms. Proc. of the Int. Conf. on Genetic Algorithms (ICGA-95), pages 184-192, 1995.
14. 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.
15. S. Kauffman. The origins of Order: Self-organization and selection in evolution. Oxford University Press, 1993.
16. P. Merz. Advanced fitness landscape analysis and the performance of memetic algorithms. Evolutionary Computation, 12(3):303-325, 2004.
17. P. Merz andB. Freisleben. Greedy and local search heuristics for unconstrained binary quadratic programming. Journal of Heuristics, 8(2):197-213, 2002.
18. M. Pelikan. Hierarchical Bayesian optimization algorithm: Toward a new generation of evolutionary algorithms. Springer, 2005.
19. M. Pelikan andD. E. Goldberg. Escaping hierarchical traps with competent genetic algorithms. Genetic and Evolutionary Comp. Conf. (GECCO-2001), pages 511-518, 2001.
20. M. Pelikan andD. E. Goldberg. A hierarchy machine: Learning to optimize from nature and humans. Complexity, 8(5):36-45, 2003.
21. M. Pelikan, J. Ocenasek, S. Trebst, M. Troyer, andF. Alet. Computational complexity and simulation of rare events of ising spin glasses. Genetic and Evolutionary Comp. Conf. (GECCO-2004), 2:36-47, 2004.
22. M. Pelikan, K. Sastry, M. V. Butz, andD. E. Goldberg. Performance of evolutionary algorithms on random decomposable problems. Parallel Problem Solving from Nature, pages 788-797, 2006.
23. M. Pelikan, K. Sastry, M. V. Butz, andD. E. Goldberg. Analysis of estimation of distribution algorithms and genetic algorithms on NK landscapes. Genetic and Evolutionary Comp. Conf. (GECCO-2008), pages 1033-1040, 2008.
24. M. Pelikan, K. Sastry, D. E. Goldberg, M. V. Butz, andM. Hauschild. Performance of evolutionary algorithms on NK landscapes with nearest neighbor interactions and tunable overlap. Genetic and Evolutionary Comp. Conf. (GECCO-2009), pages 851-858, 2009.
25. 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.
26. P. F. Stadler. Landscapes and their correlation functions. Journal of Mathematical Chemistry, 20:1-45, 1996.
27. A. M. Sutton, L. D. Whitley, andA. E. Howe. A polynomial time computation of the exact correlation structure of k-satisfiability landscapes. Genetic and Evolutionary Comp. Conf. (GECCO-2009), pages 365-372, 2009.
28. D. Thierens, D. E. Goldberg, andA. G. Pereira. Domino convergence, drift, and the temporal-salience structure of problems. Proc. of the Int. Conf. on Evolutionary Computation (ICEC-98), pages 535-540, 1998.
29. E. Weinberger. Correlated and uncorrelated fitness landscapes and how to tell the difference. Biological Cybernetics, 63(5):325-336, 1990.
30. A. H. Wright, R. K. Thompson, andJ. Zhang. The computational complexity of N-K fitness functions. IEEE Trans. on Evolutionary Computation, 4(4):373-379, 2000.