A comprehensive view of fitness landscapes with neutrality and fitness clouds

Authors:
Leonardo Vanneschi;Marco Tomassini;Philippe Collard;Sébastien Vérel;Yuri Pirola;Giancarlo Mauri
Affiliations:
Dipartimento di Informatica, Sistemistica e Comunicazione, University of Milan-Bicocca, Milan, Italy;Computer Systems Department, University of Lausanne, Lausanne, Switzerland;I3S Laboratory, University of Nice, Sophia Antipolis, France;I3S Laboratory, University of Nice, Sophia Antipolis, France;Dipartimento di Informatica, Sistemistica e Comunicazione, University of Milan-Bicocca, Milan, Italy;Dipartimento di Informatica, Sistemistica e Comunicazione, University of Milan-Bicocca, Milan, Italy
Venue:
EuroGP'07 Proceedings of the 10th European conference on Genetic programming
Year:
2007

Citing 12
Cited 5

Genetic programming (videotape): the movie

Genetic programming (videotape): the movie
The evolution of evolvability in genetic programming

Advances in genetic programming
Neutrality in fitness landscapes

Applied Mathematics and Computation
Foundations of genetic programming

Foundations of genetic programming
Neutrality and the Evolvability of Boolean Function Landscape

EuroGP '01 Proceedings of the 4th European Conference on Genetic Programming
Finding Needles in Haystacks Is Not Hard with Neutrality

EuroGP '02 Proceedings of the 5th European Conference on Genetic Programming
Synthetic Neutrality for Artificial Evolution

AE '99 Selected Papers from the 4th European Conference on Artificial Evolution
Finding needles in haystacks is harder with neutrality

GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
A quantitative study of neutrality in GP boolean landscapes

Proceedings of the 8th annual conference on Genetic and evolutionary computation
Neutrality: a necessity for self-adaptation

CEC '02 Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02
Fitness distance correlation in structural mutation genetic programming

EuroGP'03 Proceedings of the 6th European conference on Genetic programming
Negative slope coefficient: a measure to characterize genetic programming fitness landscapes

EuroGP'06 Proceedings of the 9th European conference on Genetic Programming

A fine-grained view of GP locality with binary decision diagrams as ant phenotypes

PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
Predicting problem difficulty for genetic programming applied to data classification

Proceedings of the 13th annual conference on Genetic and evolutionary computation
Estimating classifier performance with genetic programming

EuroGP'11 Proceedings of the 14th European conference on Genetic programming
Defining locality as a problem difficulty measure in genetic programming

Genetic Programming and Evolvable Machines
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 define a set of measures that capture some different aspects of neutrality in evolutionary algorithms fitness landscapes from a qualitative point of view. If considered all together, these measures offer a rather complete picture of the characteristics of fitness landscapes bound to neutrality and may be used as broad indicators of problem hardness. We compare the results returned by these measures with the ones of negative slope coefficient, a quantitative measure of problem hardness that has been recently defined and with success rate statistics on a well known genetic programming benchmark: the multiplexer problem. In order to efficaciously study the search space, we use a sampling technique that has recently been introduced and we show its suitability on this problem.