Classes of problems in the black box scenario

Authors:
Yossi Borenstein;Riccardo Poli
Affiliations:
University of Essex, Colchester, U.K;University of Essex, Colchester, U.K
Venue:
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Year:
2006

Citing 3
Cited 0

Information landscapes and problem hardness

GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Structure and metaheuristics

Proceedings of the 8th annual conference on Genetic and evolutionary computation
No free lunch theorems for optimization

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

The no-free-lunch theorems (NFLTs) do not consider explicitly the structure of problems. In [1] we gave a formal definition of structure. We showed that many metaheuristics have identical performance on problems which belong to the same structural class. In this paper, we define a notion of a distance between fitness functions. We argue that an algorithm cannot be efficient on a class of problems if the distance between the fitness function associated with instances of that class is too big. In [2] we corroborate our ideas using several problems.