Fitness landscapes and graphs
Sebástien Vérel · 2009
The performances of evolutionary algorithms (genetics algorithms, genetic programming, etc.) or local search algotihms (Simulated annealing, tabu search, etc.) depends on the properties of seach space structure. One concept to analyse the search space is the fitness landscapes in which the problem to optimize and the search algorithm are taken into account. The fitness landscape is a graph where the nodes are the potential solutions. The study of the fitness landscape consists in analysing this graph or a relevant partition of this graph according to the dynamic or search difficulty.