Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Vassilev, V.K., Fogarty, T.C., Miller, J.F.: Smoothness, ruggedness and neutrality of fitness landscapes: from theory to application, pp. 3–44. Springer, Inc., New York (2003)
Borenstein, Y., Poli, R.: Information landscapes and problem hardness. In: Proceedings of the 2005 Conference on Genetic and Evolutionary Computation, GECCO 2005, pp. 1425–1431. ACM, New York (2005)
Wright, S.: The roles of mutation, inbreeding, crossbreeding, and selection in evolution. In: Proc. 6th Congr. Genetics, vol. 1, p. 365 (1932)
Jones, T., Forrest, S.: Fitness distance correlation as a measure of problem difficulty for genetic algorithms. In: Proceedings of the 6th International Conference on Genetic Algorithms, pp. 184–192. Morgan Kaufmann Publishers Inc., San Francisco (1995)
Collard, P., Vérel, S., Clergue, M.: Local search heuristics: Fitness cloud versus fitness landscape. CoRR, abs/0709.4010 (2007)
Vanneschi, L., Tomassini, M., Collard, P., Vérel, S.: Negative slope coefficient: A measure to characterize genetic programming fitness landscapes. In: Collet, P., Tomassini, M., Ebner, M., Gustafson, S., Ekárt, A. (eds.) EuroGP 2006. LNCS, vol. 3905, pp. 178–189. Springer, Heidelberg (2006)
Smithand, T., Husbands, P., Layzell, P., O’Shea, M.: Fitness landscapes and evolvability. Evol. Comput. 10, 1–34 (2002)
Vanneschi, L., Clergue, M., Collard, P., Tomassini, M., Vérel, S.: Fitness clouds and problem hardness in genetic programming. In: Deb, K., et al. (eds.) GECCO 2004. LNCS, vol. 3103, pp. 690–701. Springer, Heidelberg (2004)
Vanneschi, L., Vérel, S., Tomassini, M., Collard, P.: NK landscapes difficulty and negative slope coefficient: How sampling influences the results. In: Giacobini, M., Brabazon, A., Cagnoni, S., Di Caro, G.A., Ekárt, A., Esparcia-Alcázar, A.I., Farooq, M., Fink, A., Machado, P. (eds.) EvoWorkshops 2009. LNCS, vol. 5484, pp. 645–654. Springer, Heidelberg (2009)
Merz, P.: Advanced fitness landscape analysis and the performance of memetic algorithms. Evol. Comput. 12, 303–325 (2004)
He, J., Yao, X.: Towards an analytic framework for analysing the computation time of evolutionary algorithms. Artificial Intelligence 145, 59–97 (2003)
Madras, N.: Lectures on Monte Carlo Methods. American Mathematical Society, Rhode Island (2002)
Mengshoel, O.J., Goldberg, D.E., Wilkins, D.C.: Deceptive and other functions of unitation as bayesian networks (1998)
Deb, K., Goldberg, D.E.: Analyzing deception in trap functions. In: Foundations of Genetic Algorithms, vol. 2, pp. 93–108 (1993)
Rivest, R., Stein, C., Cormen, T., Leiserson, C.: Introduction to Algorithms. MIT Press and McGraw-Hill (1990)
Naudts, B., Kallel, L.: A comparison of predictive measures of problem difficulty in evolutionary algorithms. IEEE Transactions on Evolutionary Computation 4(1), 1–15 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lu, G., Li, J., Yao, X. (2011). Fitness-Probability Cloud and a Measure of Problem Hardness for Evolutionary Algorithms. In: Merz, P., Hao, JK. (eds) Evolutionary Computation in Combinatorial Optimization. EvoCOP 2011. Lecture Notes in Computer Science, vol 6622. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20364-0_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-20364-0_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-20363-3
Online ISBN: 978-3-642-20364-0
eBook Packages: Computer ScienceComputer Science (R0)