Autocorrelation coefficient for the graph bipartitioning problem
Theoretical Computer Science
Learning Bayesian networks with local structure
Learning in graphical models
The Design of Innovation: Lessons from and for Competent Genetic Algorithms
The Design of Innovation: Lessons from and for Competent Genetic Algorithms
Greedy and Local Search Heuristics for Unconstrained Binary Quadratic Programming
Journal of Heuristics
Fitness Distance Correlation as a Measure of Problem Difficulty for Genetic Algorithms
Proceedings of the 6th International Conference on Genetic Algorithms
Finding Multimodal Solutions Using Restricted Tournament Selection
Proceedings of the 6th International Conference on Genetic Algorithms
Advanced fitness landscape analysis and the performance of memetic algorithms
Evolutionary Computation - Special issue on magnetic algorithms
Phase transition in a random NK landscape model
GECCO '05 Proceedings of the 7th annual conference on Genetic and 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
A polynomial time computation of the exact correlation structure of k-satisfiability landscapes
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Proceedings of the 11th 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
Advanced neighborhoods and problem difficulty measures
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Pairwise and problem-specific distance metrics in the linkage tree genetic algorithm
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
Distance-based bias in model-directed optimization of additively decomposable problems
Proceedings of the 14th annual conference on Genetic and evolutionary computation
Local optima networks and the performance of iterated local search
Proceedings of the 14th annual conference on Genetic and evolutionary computation
The lay of the land: a brief survey of problem understanding
Proceedings of the 14th annual conference companion on Genetic and evolutionary computation
Proceedings of the 15th annual conference on Genetic and evolutionary computation
Adaptation of a multiagent evolutionary algorithm to NK landscapes
Proceedings of the 15th annual conference companion on Genetic and evolutionary computation
A survey of techniques for characterising fitness landscapes and some possible ways forward
Information Sciences: an International Journal
| Hi-index | 0.00 |
This 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. As the target class of problems, the study considers two types of NK landscapes: (1) Standard, unrestricted NK landscapes and (2) shuffled NK landscapes with nearest-neighbor interactions. As problem difficulty measures, the paper considers the fitness distance correlation, the correlation coefficient, the distance of local and global optima, and the escape rate. Experimental results are presented, analyzed and discussed. Promising avenues for future work are also outlined.