Elementary landscapes of frequency assignment problems
Proceedings of the 12th annual conference on Genetic and evolutionary computation
Elementary bit string mutation landscapes
Proceedings of the 11th workshop proceedings on Foundations of genetic algorithms
Partial neighborhoods of the traveling salesman problem
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Exact computation of the expectation curves of the bit-flip mutation using landscapes theory
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Elementary landscape decomposition of the frequency assignment problem
Theoretical Computer Science
Exploiting decomposability using recombination in genetic algorithms: an exploratory discussion
SSBSE'11 Proceedings of the Third international conference on Search based software engineering
A methodology to find the elementary landscape decomposition of combinatorial optimization problems
Evolutionary Computation
Quasi-elementary landscapes and superpositions of elementary landscapes
LION'12 Proceedings of the 6th international conference on Learning and Intelligent Optimization
Problem understanding through landscape theory
Proceedings of the 15th annual conference companion on Genetic and evolutionary computation
Hi-index | 0.00 |
This paper introduces a new component based model that makes it relatively simple to prove that certain types of landscapes are elementary. We use the model to reconstruct proofs for the Traveling Salesman Problem, Graph Coloring and Min-Cut Graph Partitioning. The same model is then used to efficiently compute the average values over particular partial neighborhoods for these same problems. For Graph Coloring and Min-Cut Graph Partitioning, this computation can be used to focus search on those moves that are most likely to yield an improving move, ignoring moves that cannot yield an improving move. Let x be a candidate solution with objective function value f(x). The mean value of the objective function over the entire landscape is denoted f. Normally in an elementary landscape one can only be sure that a neighborhood includes an improving move (assuming minimization) if f(x) f. However, by computing the expected value of an appropriate partial neighborhood it is sometimes possible to know that an improving move exists in the partial neighborhood even when f(x) f.