Efficiency of Local Search with Multiple Local Optima
SIAM Journal on Discrete Mathematics
Memetic Algorithms and the Fitness Landscape of the Graph Bi-Partitioning Problem
PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
Takeover time curves in random and small-world structured populations
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Takeover times on scale-free topologies
Proceedings of the 9th annual conference on Genetic and evolutionary computation
The genetic programming collaboration network and its communities
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Where is evolutionary computation going? A temporal analysis of the EC community
Genetic Programming and Evolvable Machines
Effects of scale-free and small-world topologies on binary coded self-adaptive CEA
EvoCOP'06 Proceedings of the 6th European conference on Evolutionary Computation in Combinatorial Optimization
Centric selection: a way to tune the exploration/exploitation trade-off
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Fitness landscapes and graphs: multimodularity, ruggedness and neutrality
Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers
First-improvement vs. best-improvement local optima networks of NK landscapes
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
Local optima networks and the performance of iterated local search
Proceedings of the 14th annual conference on Genetic and evolutionary computation
Fitness landscapes and graphs: multimodularity, ruggedness and neutrality
Proceedings of the 14th annual conference companion on Genetic and evolutionary computation
Second order partial derivatives for NK-landscapes
Proceedings of the 15th annual conference on Genetic and evolutionary computation
Fitness landscapes and graphs: multimodularity, ruggedness and neutrality
Proceedings of the 15th annual conference companion 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
A study of redundancy and neutrality in evolutionary optimization
Evolutionary Computation
ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms
Journal of Heuristics
| Hi-index | 0.00 |
We propose a network characterization of combinatorial fitness landscapes by adapting the notion of inherent networks proposed for energy surfaces (Doye, 2002). We use the well-known family of $NK$ landscapes as an example. In our case the inherent network is the graph where the vertices are all the local maxima and edges mean basin adjacency between two maxima. We exhaustively extract such networks on representative small NK landscape instances, and show that they are 'small-worlds'. However, the maxima graphs are not random, since their clustering coefficients are much larger than those of corresponding random graphs. Furthermore, the degree distributions are close to exponential instead of Poissonian. We also describe the nature of the basins of attraction and their relationship with the local maxima network.