Performance of evolutionary algorithms on NK landscapes with nearest neighbor interactions and tunable overlap

Authors:
Martin Pelikan;Kumara Sastry;David E. Goldberg;Martin V. Butz;Mark Hauschild
Affiliations:
University of Missouri in St. Louis, St. Louis, MO, USA;Intel Corp., Hillsboro, OR, USA;University of Illinois at Urbana-Champaign, Urbana, IL, USA;University of Wuerzburg, Wuerzburg, Germany;University of Missouri in St. Louis, St. Louis, MO, USA
Venue:
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Year:
2009

Citing 17
Cited 15

Adaptation in natural and artificial systems

Adaptation in natural and artificial systems
Learning Bayesian networks with local structure

Learning in graphical models
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
The Design of Innovation: Lessons from and for Competent Genetic Algorithms

The Design of Innovation: Lessons from and for Competent Genetic Algorithms
Mixing in Genetic Algorithms

Proceedings of the 5th International Conference on Genetic Algorithms
Finding Multimodal Solutions Using Restricted Tournament Selection

Proceedings of the 6th International Conference on Genetic Algorithms
Phase transition in a random NK landscape model

GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Representations for Genetic and Evolutionary Algorithms

Representations for Genetic and Evolutionary Algorithms
Population sizing for entropy-based model building in discrete estimation of distribution algorithms

Proceedings of the 9th annual conference on Genetic and evolutionary computation
Why is parity hard for estimation of distribution algorithms?

Proceedings of the 9th annual conference on Genetic and evolutionary computation
Empirical analysis of ideal recombination on random decomposable problems

Proceedings of the 9th annual conference on Genetic and evolutionary computation
Scalability problems of simple genetic algorithms

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

Proceedings of the 10th annual conference on Genetic and evolutionary computation
An analysis of phase transition in NK landscapes

Journal of Artificial Intelligence Research
Genetic algorithms on NK-landscapes: effects of selection, drift, mutation, and recombination

EvoWorkshops'03 Proceedings of the 2003 international conference on Applications of evolutionary computing
Performance of evolutionary algorithms on random decomposable problems

PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
The computational complexity of N-K fitness functions

IEEE Transactions on Evolutionary Computation

NK landscapes, problem difficulty, and hybrid evolutionary algorithms

Proceedings of the 12th annual conference on Genetic and evolutionary computation
The linkage tree genetic algorithm

PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
Optimal mixing evolutionary algorithms

Proceedings of the 13th annual conference on Genetic and evolutionary computation
Analysis of epistasis correlation on NK landscapes with nearest-neighbor interactions

Proceedings of the 13th annual conference on Genetic and evolutionary computation
The roles of local search, model building and optimal mixing in evolutionary algorithms from a bbo perspective

Proceedings of the 13th annual conference companion on Genetic and evolutionary computation
A test problem with adjustable degrees of overlap and conflict among subproblems

Proceedings of the 14th annual conference on Genetic and evolutionary computation
Predetermined versus learned linkage models

Proceedings of the 14th annual conference on Genetic and evolutionary computation
Linkage neighbors, optimal mixing and forced improvements in genetic algorithms

Proceedings of the 14th annual conference on Genetic and evolutionary computation
On measures to build linkage trees in LTGA

PPSN'12 Proceedings of the 12th international conference on Parallel Problem Solving from Nature - Volume Part I
Evolvability analysis of the linkage tree genetic algorithm

PPSN'12 Proceedings of the 12th international conference on Parallel Problem Solving from Nature - Volume Part I
Learning the neighborhood with the linkage tree genetic algorithm

LION'12 Proceedings of the 6th international conference on Learning and Intelligent Optimization
Effects of discrete hill climbing on model building forestimation of distribution algorithms

Proceedings of the 15th annual conference on Genetic and evolutionary computation
Design of test problems for discrete estimation of distribution algorithms

Proceedings of the 15th annual conference on Genetic and evolutionary computation
More concise and robust linkage learning by filtering and combining linkage hierarchies

Proceedings of the 15th annual conference on Genetic and evolutionary computation
Second order partial derivatives for NK-landscapes

Proceedings of the 15th annual conference on Genetic and evolutionary computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

This 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 problem instances with known optima. Several genetic and evolutionary algorithms are then applied to the generated problem instances. The results are analyzed and related to scalability theory for genetic algorithms and estimation of distribution algorithms.