What Makes a Problem GP-Hard? Analysis of a Tunably Difficult Problem in Genetic Programming
Genetic Programming and Evolvable Machines
Fitness landscapes and evolvability
Evolutionary Computation
Spin-flip symmetry and synchronization
Evolutionary Computation
Neutral Networks and Evolvability with Complex Genotype-Phenotype Mapping
ECAL '01 Proceedings of the 6th European Conference on Advances in Artificial Life
EMCL '01 Proceedings of the 12th European Conference on Machine Learning
A Study of Fitness Distance Correlation as a Difficulty Measure in Genetic Programming
Evolutionary Computation
Using quotient graphs to model neutrality in evolutionary search
Proceedings of the 10th annual conference companion on Genetic and evolutionary computation
Real options approach to evaluating genetic algorithms
Applied Soft Computing
Problem difficulty analysis for particle swarm optimization: deception and modality
Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation
Optimal contraction theorem for exploration-exploitation tradeoff in search and optimization
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Quantifying ruggedness of continuous landscapes using entropy
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Exploring the influence of problem structural characteristics on evolutionary algorithm performance
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Genetic Local Search for Optimum Multiuser Detection Problem in DS-CDMA Systems
ICIC '07 Proceedings of the 3rd International Conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence
On multivariate genetic systems
FUZZ-IEEE'09 Proceedings of the 18th international conference on Fuzzy Systems
Decomposition of fitness functions in random heuristic search
FOGA'07 Proceedings of the 9th international conference on Foundations of genetic algorithms
FOGA'07 Proceedings of the 9th international conference on Foundations of genetic algorithms
Instance generators and test suites for the multiobjective quadratic assignment problem
EMO'03 Proceedings of the 2nd international conference on Evolutionary multi-criterion optimization
Evolving finite state transducers: some initial explorations
EuroGP'03 Proceedings of the 6th European conference on Genetic programming
EvoWorkshops'03 Proceedings of the 2003 international conference on Applications of evolutionary computing
Interactive ec control of synthesized timbre
Evolutionary Computation
A new approach to evolutionary optimized fuzzy neural networks
ICS'06 Proceedings of the 10th WSEAS international conference on Systems
Fitness-probability cloud and a measure of problem hardness for evolutionary algorithms
EvoCOP'11 Proceedings of the 11th European conference on Evolutionary computation in combinatorial optimization
Defining locality as a problem difficulty measure in genetic programming
Genetic Programming and Evolvable Machines
Negative slope coefficient: a measure to characterize genetic programming fitness landscapes
EuroGP'06 Proceedings of the 9th European conference on Genetic Programming
Landscape properties and hybrid evolutionary algorithm for optimum multiuser detection problem
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part I
Evolutionary algorithm characterization in real parameter optimization problems
Applied Soft Computing
EvoCOP'13 Proceedings of the 13th European conference on Evolutionary Computation in Combinatorial Optimization
A survey of techniques for characterising fitness landscapes and some possible ways forward
Information Sciences: an International Journal
On the taxonomy of optimization problems under estimation of distribution algorithms
Evolutionary Computation
Information Sciences: an International Journal
Hi-index | 0.00 |
This paper studies a number of predictive measures of problem difficulty, among which epistasis variance and fitness distance correlation are the most widely known. Our approach is based on comparing the reference class of a measure to a number of known easy function classes. First, we generalize the reference classes of fitness distance correlation and epistasis variance, and construct a new predictive measure that is insensitive to nonlinear fitness scaling. We then investigate the relations between the reference classes of the measures and a number of intuitively easy classes. We also point out the need to further identify which functions are easy for a given class of evolutionary algorithms in order to design more efficient hardness indicators for them. We finally restrict attention to the genetic algorithm (GA), and consider both GA-easy and GA-hard fitness functions, and give experimental evidence that the values of the measures, based on random samples, can be completely unreliable and entirely uncorrelated to the convergence quality and convergence speed of GA instances using either proportional or ranking selection