Optimizing one million variable NK landscapes by hybridizing deterministic recombination and local search
In gray-box optimization, the search algorithms have access to the variable interaction graph
(VIG) of the optimization problem. For Mk Landscapes (and NK Landscapes) we can use the …
(VIG) of the optimization problem. For Mk Landscapes (and NK Landscapes) we can use the …
Deconstructing the big valley search space hypothesis
G Ochoa, N Veerapen - … : 16th European Conference, EvoCOP 2016, Porto …, 2016 - Springer
The big valley hypothesis suggests that, in combinatorial optimisation, local optima of good
quality are clustered and surround the global optimum. We show here that the idea of a …
quality are clustered and surround the global optimum. We show here that the idea of a …
Modelling parameter configuration spaces with local optima networks
Most algorithms proposed for solving complex problems require the definition of some
parameter values. The process of finding suitable parameter values is an optimization …
parameter values. The process of finding suitable parameter values is an optimization …
PageRank centrality for performance prediction: the impact of the local optima network model
A local optima network (LON) compresses relevant features of fitness landscapes in a
complex network, where nodes are local optima and edges represent transition probabilities …
complex network, where nodes are local optima and edges represent transition probabilities …
The multi-funnel structure of TSP fitness landscapes: a visual exploration
Abstract We use the Local Optima Network model to study the structure of symmetric TSP
fitness landscapes. The 'big-valley'hypothesis holds that for TSP and other combinatorial …
fitness landscapes. The 'big-valley'hypothesis holds that for TSP and other combinatorial …
Local optima organize into lattices under recombination: an example using the traveling salesman problem
Local optima networks (LONs) model the global distribution and connectivity pattern of local
optima under given search operators. Recent research has looked at how recombination …
optima under given search operators. Recent research has looked at how recombination …
Tunnelling crossover networks for the asymmetric TSP
Local optima networks are a compact representation of fitness landscapes that can be used
for analysis and visualisation. This paper provides the first analysis of the Asymmetric …
for analysis and visualisation. This paper provides the first analysis of the Asymmetric …
Analysis of link failures and recoveries on 6to4 tunneling network with different routing protocol
Failure recovery is an essential discussion in communication to guarantee the network's
undisturbed and reliable service. Failed links have been affecting the communication …
undisturbed and reliable service. Failed links have been affecting the communication …
A memetic algorithm for the minimum conductance graph partitioning problem
D Chalupa - arXiv preprint arXiv:1704.02854, 2017 - arxiv.org
The minimum conductance problem is an NP-hard graph partitioning problem. Apart from
the search for bottlenecks in complex networks, the problem is very closely related to the …
the search for bottlenecks in complex networks, the problem is very closely related to the …
Predicting heuristic search performance with PageRank centrality in local optima networks
S Herrmann, F Rothlauf - Proceedings of the 2015 Annual Conference …, 2015 - dl.acm.org
Previous studies have used statistical analysis of fitness landscapes such as ruggedness
and deceptiveness in order to predict the expected quality of heuristic search methods …
and deceptiveness in order to predict the expected quality of heuristic search methods …