Discover Community Create You

Loading publication...

Noodle always counts identifier-free feature events for service operation. With your permission, Google Analytics can also estimate audience and engagement. Search text, publication identifiers, cookies, IP addresses and browser fingerprints are never included in Noodle's first-party event counters.

Privacy details

Article

A study of fitness distance correlation as a difficulty measure in genetic programming.

Evolutionary computation - 1 Jan 2005

Tomassini Marco, Vanneschi Leonardo, Collard Philippe, Clergue Manuel

Abstract excerpt

We present an approach to genetic programming difficulty based on a statistical study of program fitness landscapes. The fitness distance correlation is used as an indicator of problem hardness and we empirically show that such a statistic is adequate in nearly all cases studied here. However, fitness distance correlation has some known problems and these are investigated by constructing an artificial landscape...

Read the complete abstract on PubMed

Topics

Share this publication in a Topic to start or enrich a Post.

Share to Algorithms
Share to Biological Evolution
Share to Computational Biology

Methodology Data sources Editorial policy Privacy Delete account & data About Contact Helena Bioinformatics

Share to Computer Simulation

Share to Mathematical Computing

Share to Mathematics

Share to Models, Statistical

Share to Software

Source

Identifiers

PMID: 15969901
DOI: 10.1162/1063656054088549

Provenance

PubMed metadata and Literature Corpus relationships. Corpus snapshot updated 7 Sept 2026. Manifest publication-graph-cohort-2026-09-08.1.

Source receipt: pubmed, retrieved 7 Sept 2026.

Related research

Semantic proximity does not establish scientific evidence. Graph snapshot: 2026-09-29.

Research trail→

Click a neighbor to travelStep 1 · 12 closest

A study of fitness distance correlation as a difficulty measure in genetic programming.PMID 15969901Read ↗

The genotypic complexity of evolved fault-tolerant and noise-robust circuits.Semantic proximity Read ↗

A survey of application: genomics and genetic programming, a new frontier.Semantic proximity Read ↗

Algebraic theory of recombination spaces.Semantic proximity Read ↗

Empirical analysis of locality, heritability and heuristic bias in evolutionary algorithms: a case study for the multidimensional knapsack problem.Semantic proximity Read ↗

On the Runtime Analysis of the Clearing Diversity-Preserving Mechanism.Semantic proximity Read ↗

A genetic engineering approach to genetic algorithms.Semantic proximity Read ↗

Fitness Probability Distribution of Bit-Flip Mutation.Semantic proximity Read ↗

RGFGA: an efficient representation and crossover for grouping genetic algorithms.Semantic proximity Read ↗

Reducing the number of fitness evaluations in graph genetic programming using a canonical graph indexed database.Semantic proximity Read ↗

Genetic Parallel Programming: design and implementation.Semantic proximity Read ↗

Bloat control operators and diversity in genetic programming: a comparative study.Semantic proximity Read ↗

Fitness distributions in evolutionary computation: motivation and examples in the continuous domain.Semantic proximity Read ↗

⌁Select a neighboring publication to make it the new centre.