Introduction to Algorithms
Fitness landscapes and evolvability
Evolutionary Computation
Fitness Distance Correlation as a Measure of Problem Difficulty for Genetic Algorithms
Proceedings of the 6th International Conference on Genetic Algorithms
Towards an analytic framework for analysing the computation time of evolutionary algorithms
Artificial Intelligence
Smoothness, ruggedness and neutrality of fitness landscapes: from theory to application
Advances in evolutionary computing
Advanced fitness landscape analysis and the performance of memetic algorithms
Evolutionary Computation - Special issue on magnetic algorithms
Information landscapes and problem hardness
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
NK Landscapes Difficulty and Negative Slope Coefficient: How Sampling Influences the Results
EvoWorkshops '09 Proceedings of the EvoWorkshops 2009 on Applications of Evolutionary Computing: EvoCOMNET, EvoENVIRONMENT, EvoFIN, EvoGAMES, EvoHOT, EvoIASP, EvoINTERACTION, EvoMUSART, EvoNUM, EvoSTOC, EvoTRANSLOG
Negative slope coefficient: a measure to characterize genetic programming fitness landscapes
EuroGP'06 Proceedings of the 9th European conference on Genetic Programming
A comparison of predictive measures of problem difficulty inevolutionary algorithms
IEEE Transactions on Evolutionary Computation
ICONIP'11 Proceedings of the 18th international conference on Neural Information Processing - Volume Part II
Why six informants is optimal in PSO
Proceedings of the 14th annual conference on Genetic and evolutionary computation
The lay of the land: a brief survey of problem understanding
Proceedings of the 14th annual conference companion on Genetic and evolutionary computation
Fitness landscapes and graphs: multimodularity, ruggedness and neutrality
Proceedings of the 15th annual conference companion on Genetic and evolutionary computation
A survey of techniques for characterising fitness landscapes and some possible ways forward
Information Sciences: an International Journal
| Hi-index | 0.00 |
Evolvability is an important feature directly related to problem hardness for Evolutionary Algorithms (EAs). A general relationship that holds for Evolvability and problem hardness is the higher the degree of evolvability, the easier the problem is for EAs. This paper presents, for the first time, the concept of Fitness-Probability Cloud (fpc) to characterise evolvability from the point of view of escape probability and fitness correlation. Furthermore, a numerical measure called Accumulated Escape Probability (aep) based on fpc is proposed to quantify this feature, and therefore problem difficulty. To illustrate the effectiveness of our approach, we apply it to four test problems: OneMax, Trap, OneMix and Subset Sum. We then contrast the predictions made by the aep to the actual performance measured using the number of fitness evaluations. The results suggest that the new measure can reliably indicate problem hardness for EAs.