Martin Pelikan
ABSTRACT
This study analyzes performance of several genetic and evolutionary algorithms on randomly generated NK fitness landscapes with various values of n and k. A large number of NK problem instances are first generated for each n and k, and the global optimum of each instance is obtained using the branch-and-bound algorithm. Next, the hierarchical Bayesian optimization algorithm (hBOA), the univariate marginal distribution algorithm (UMDA), and the simple genetic algorithm (GA) with uniform and two-point crossover operators are applied to all generated instances. Performance of all algorithms is then analyzed and compared, and the results are discussed.
- H. E. Aguirre and K. Tanaka. Genetic algorithms on nk-landscapes: Effects of selection, drift, mutation, and recombination. In G. R. Raidl et al., editors, Applications of Evolutionary Computing: EvoWorkshops 2003, pages 131--142, 2003. Google Scholar
Digital Library
- 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.Google Scholar
- 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. Google ScholarDigital Library
- P. A. N. Bosman 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.Google Scholar
- 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.Google Scholar
- S.-S. Choi, K. Jung, and J. H. Kim. Phase transition in a random NK landscape model. pages 1241--1248, 2005. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- Y. Gao and J. C. Culberson. An analysis of phase transition in NK landscapes. Journal of Artificial Intelligence Research (JAIR), 17:309--332, 2002. Google ScholarDigital Library
- D. E. Goldberg. Genetic algorithms in search, optimization, and machine learning. Addison-Wesley, Reading, MA, 1989. Google ScholarDigital Library
- G. R. Harik. Finding multimodal solutions using restricted tournament selection. Proceedings of the International Conference on Genetic Algorithms (ICGA-95), pages 24--31, 1995. Google ScholarDigital Library
- 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.Google ScholarDigital Library
- J. H. Holland. Adaptation in natural and artificial systems. University of Michigan Press, Ann Arbor, MI, 1975. Google ScholarDigital Library
- 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.Google Scholar
- S. Kauffman. The origins of Order: Self-and selection in evolution. Oxford University Press, 1993.Google Scholar
- P. Larrañaga and J. A. Lozano, editors. Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation. Kluwer, Boston, MA, 2002.Google ScholarCross Ref
- 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. Google ScholarDigital Library
- M. Pelikan. Hierarchical Bayesian optimization algorithm: Toward a new generation of evolutionary algorithms. Springer, 2005.Google Scholar
- 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.Google Scholar
- M. Pelikan and D. E. Goldberg. Hierarchical BOA solves Ising spin glasses and maxsat. Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2003), II:1275--1286, 2003. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- 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.Google Scholar
- 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.Google Scholar
- 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. Google ScholarDigital Library
Index Terms
- Analysis of estimation of distribution algorithms and genetic algorithms on NK landscapes
Recommendations
NK landscapes, problem difficulty, and hybrid evolutionary algorithms
GECCO '10: Proceedings of the 12th annual conference on Genetic and evolutionary computationThis paper presents an experimental study of NK landscapes with the main focus on the relationship between (1) problem parameters, (2) various measures of problem difficulty of fitness landscapes, and (3) performance of hybrid evolutionary algorithms. ...
Performance of evolutionary algorithms on NK landscapes with nearest neighbor interactions and tunable overlap
GECCO '09: Proceedings of the 11th Annual conference on Genetic and evolutionary computationThis paper presents a class of NK landscapes with nearest-neighbor interactions and tunable overlap. The considered class of NK landscapes is solvable in polynomial time using dynamic programming; this allows us to generate a large number of random ...
Using holey fitness landscapes to counteract premature convergence in evolutionary algorithms
GECCO '08: Proceedings of the 10th annual conference companion on Genetic and evolutionary computationPremature convergence is a persisting problem in evolutionary optimisation, in particular - genetic algorithms. While a number of methods exist to approach this issue, they usually require problem specific calibration or only partially resolve the issue,...
Comments