A Survey of Problem Difficulty in Genetic Programming

This paper presents a study of fitness distance correlation and negative slope coefficient as measures of problem hardness for genetic programming. Advantages and drawbacks of both these measures are presented both from a theoretical and empirical point of view. Experiments have been performed on a set of well-known hand-tailored problems and “real-life-like” GP benchmarks