A study of the neutrality of Boolean function landscapes in genetic programming

Authors:
Leonardo Vanneschi;Yuri Pirola;Giancarlo Mauri;Marco Tomassini;Philippe Collard;Sébastien Verel
Affiliations:
Dipartimento di Informatica Sistemistica e Comunicazione (D.I.S.Co.), University of Milano-Bicocca, Milan, Italy;Dipartimento di Informatica Sistemistica e Comunicazione (D.I.S.Co.), University of Milano-Bicocca, Milan, Italy;Dipartimento di Informatica Sistemistica e Comunicazione (D.I.S.Co.), University of Milano-Bicocca, Milan, Italy;Information Systems Department, HEC, University of Lausanne, Switzerland;I3S Laboratory, University of NiceSophia Antipolis, France;I3S Laboratory, University of NiceSophia Antipolis, France
Venue:
Theoretical Computer Science
Year:
2012

Citing 22
Cited 0

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
How neutral networks influence evolvability

Complexity
Foundations of genetic programming

Foundations of genetic programming
Neutral Networks and Evolvability with Complex Genotype-Phenotype Mapping

ECAL '01 Proceedings of the 6th European Conference on Advances in Artificial Life
Fitness Distance Correlation as a Measure of Problem Difficulty for Genetic Algorithms

Proceedings of the 6th International Conference on Genetic Algorithms
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
Towards an empirical measure of evolvability

GECCO '05 Proceedings of the 7th annual workshop 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-proportional negative slope coefficient as a hardness measure for genetic algorithms

Proceedings of the 9th annual conference on Genetic and evolutionary computation
Limitations of the fitness-proportional negative slope coefficient as a difficulty measure

Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Fitness landscapes and problem hardness in genetic programming

Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers
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
Using subtree crossover distance to investigate genetic programming dynamics

EuroGP'06 Proceedings of the 9th European conference on Genetic Programming
Operator-Based distance for genetic programming: subtree crossover distance

EuroGP'05 Proceedings of the 8th European conference on Genetic Programming
Crossover-Based Tree Distance in Genetic Programming

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	5.23

Visualization

Abstract

The neutrality of genetic programming Boolean function landscapes is investigated in this paper. Compared with some well-known contributions on the same issue, (i) we first define new measures which help in characterizing neutral landscapes; (ii) we use a new sampling methodology, which captures features that are disregarded by uniform random sampling; (iii) we introduce new genetic operators to define the neighborhood of tree structures; and (iv) we compare the fitness landscape induced by different sets of functional operators. This study indicates the existence of a relationship between our neutrality measures and the performance of genetic programming for the problems studied.