Information landscapes

Authors:
Yossi Borenstein;Riccardo Poli
Affiliations:
University of Essex;University of Essex
Venue:
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Year:
2005

Citing 8
Cited 9

Properties of fitness functions and search landscapes

Theoretical aspects of evolutionary computing
Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
Combinatorial Landscapes

SIAM Review
Fitness Distance Correlation as a Measure of Problem Difficulty for Genetic Algorithms

Proceedings of the 6th International Conference on Genetic Algorithms
Metaheuristics in combinatorial optimization: Overview and conceptual comparison

ACM Computing Surveys (CSUR)
Information landscapes and the analysis of search algorithms

GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Information landscapes and problem hardness

GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
GA-hardness revisited

GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartII

Information landscapes and the analysis of search algorithms

GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
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
Quantifying ruggedness of continuous landscapes using entropy

CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Practical model of genetic programming's performance on rational symbolic regression problems

EuroGP'08 Proceedings of the 11th European conference on Genetic programming
Practical performance models of algorithms in evolutionary program induction and other domains

Artificial Intelligence
Performance models for evolutionary program induction algorithms based on problem difficulty indicators

EuroGP'11 Proceedings of the 14th European conference on Genetic programming
Motif difficulty (md): A predictive measure of problem difficulty for evolutionary algorithms using network motifs

Evolutionary Computation
A survey of techniques for characterising fitness landscapes and some possible ways forward

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give a new interpretation to the concept of "landscape". This allows us to develop a new theoretical model to study search algorithms. Particularly, we are able to quantify the amount and quality of "information" embedded in a landscape and to predict the performance of a search algorithm over it. We conclude presenting empirical results for a simple genetic algorithm which strongly support this idea.